Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
Find Sequence solution in Uncategorized category for Find Sequence by capback250
# migrated from python 2.7
import re
def builder(matrix):
sq = []
for counter in range(len(matrix)):
temp = []
i = 0
j = counter
while i < counter + 1:
temp.append(int(matrix[i][j]))
i += 1
j -= 1
sq.append(temp)
return sq
def p(reshetka):
aa = []
for y in range(len(reshetka)):
temp=[]
for x in range(len(reshetka)):
temp.append(reshetka[x][y])
aa.append(list(reversed(temp)))
return aa
def diagonals(matrix):
result = []
if len(matrix) < 4:
print(0)
else:
diags = []
for x in builder(matrix):
if x not in diags:
diags.append(x)
for x in builder(p(p(matrix))):
if list(reversed(x)) not in diags:
diags.append(x)
for x in diags:
if len(x) >= 4:
result.append(x)
return result
def simple_search(matrix):
c = 0
for x in matrix:
if re.findall(r'(\d)\1\1\1+', str(x).replace(', ','')):
c += 1
if c:
return True
else:
return False
def checkio(matrix):
for x in diagonals(matrix):
if re.findall(r'(\d)\1\1\1+', str(x).replace(', ','')):
return True
for x in diagonals(p(matrix)):
if re.findall(r'(\d)\1\1\1+', str(x).replace(', ','')):
return True
if simple_search(matrix):
return True
if simple_search(list(zip(*matrix))):
return True
else:
return False
Sept. 7, 2015