- Difficulty: Medium
- Tags: LeetCode, Medium, Array, Dynamic Programming, Matrix, leetcode-562, O(m * n), O(n), 🔒
Problem
Given an m x n
binary matrix mat
, return the length of the longest line of consecutive one in the matrix.
The line could be horizontal, vertical, diagonal, or anti-diagonal.
Â
Example 1:
Input: mat = [[0,1,1,0],[0,1,1,0],[0,0,0,1]] Output: 3
Example 2:
Input: mat = [[1,1,1,1],[0,1,1,0],[0,0,0,1]] Output: 4
Â
Constraints:
m == mat.length
n == mat[i].length
1 <= m, n <= 104
1 <= m * n <= 104
mat[i][j]
is either0
or1
.