checkio -- Find Sequence

    Find Sequence

You are given a matrix of NxN (4≤N≤10). You should check if there is a sequence of 4 or more matching digits. The sequence may be positioned horizontally, vertically or diagonally (NW-SE or NE-SW diagonals).

find-sequence find-sequence

Input: A list of lists. Each list contains integers.

Output: A boolean. Whether or not a sequence exists.


Example:

?
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
checkio([
     [ 1 , 2 , 1 , 1 ],
     [ 1 , 1 , 4 , 1 ],
     [ 1 , 3 , 1 , 6 ],
     [ 1 , 7 , 2 , 5 ]
]) = = True
checkio([
     [ 7 , 1 , 4 , 1 ],
     [ 1 , 2 , 5 , 2 ],
     [ 3 , 4 , 1 , 3 ],
     [ 1 , 1 , 8 , 1 ]
]) = = False
checkio([
     [ 2 , 1 , 1 , 6 , 1 ],
     [ 1 , 3 , 2 , 1 , 1 ],
     [ 4 , 1 , 1 , 3 , 1 ],
     [ 5 , 5 , 5 , 5 , 5 ],
     [ 1 , 1 , 3 , 1 , 1 ]
]) = = True
checkio([
     [ 7 , 1 , 1 , 8 , 1 , 1 ],
     [ 1 , 1 , 7 , 3 , 1 , 5 ],
     [ 2 , 3 , 1 , 2 , 5 , 1 ],
     [ 1 , 1 , 1 , 5 , 1 , 4 ],
     [ 4 , 6 , 5 , 1 , 3 , 1 ],
     [ 1 , 1 , 9 , 1 , 2 , 1 ]
     ]) = = True




def checkio(matrix):
    if len(matrix)<4:
        return False
    for i in range(len(matrix)-3):
        for j in range(len(matrix)-3):
            if (matrix[i][j] == matrix[i][j+1] and matrix[i][j] == matrix[i][j+2] and matrix[i][j] == matrix[i][j+3]) or (matrix[i][j] == matrix[i+1][j] and matrix[i][j] == matrix[i+2][j] and matrix[i][j] == matrix[i+3][j]) or (matrix[i][j] == matrix[i+1][j+1] and matrix[i][j] == matrix[i+2][j+2] and matrix[i][j] == matrix[i+3][j+3]):
                return True
    for i in range(3,len(matrix)):
        for j in range(len(matrix)-3):
            if (matrix[i][j] == matrix[i][j+1] and matrix[i][j] == matrix[i][j+2] and matrix[i][j] == matrix[i][j+3]) or (matrix[i][j] == matrix[i-1][j-1] and matrix[i][j] == matrix[i-2][j-2] and matrix[i][j] == matrix[i-3][j-3]):
                return True
    for i in range(len(matrix)-3):
        for j in range(3,len(matrix)):
            if (matrix[i][j] == matrix[i+1][j] and matrix[i][j] == matrix[i+2][j] and matrix[i][j] == matrix[i+3][j]) or (matrix[i][j] == matrix[i+1][j-1] and matrix[i][j] == matrix[i+2][j-2] and matrix[i][j] == matrix[i+3][j-3]):
                return True
    return False



 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值