Skip to content

Latest commit

 

History

History
57 lines (29 loc) · 748 Bytes

File metadata and controls

57 lines (29 loc) · 748 Bytes

中文文档

Description

Given a 01 matrix M, find the longest line of consecutive one in the matrix. The line could be horizontal, vertical, diagonal or anti-diagonal.

Example:

Input:

[[0,1,1,0],

 [0,1,1,0],

 [0,0,0,1]]

Output: 3

Hint:

The number of elements in the given matrix will not exceed 10,000.

Solutions

Python3

Java

...