100 天 DSA 编码挑战的第 82 天
发布: (2025年12月25日 GMT+8 02:38)
1 min read
原文: Dev.to
Source: Dev.to
Problem
在二维矩阵中寻找峰值元素
GeeksforGeeks 题目链接
难度:中等 准确率:28.51%
Example
Input: mat[][] = [[10, 20, 15],
[21, 30, 14]]
Solution
class Solution:
def findPeakGrid(self, mat):
n = len(mat)
m = len(mat[0])
l, r = 0, m - 1
while l mat[max_row][mid]:
max_row = i
left = mat[max_row][mid-1] if mid-1 >= 0 else float('-inf')
right = mat[max_row][mid+1] if mid+1 = left and mat[max_row][mid] >= right:
return [max_row, mid]
elif left > mat[max_row][mid]:
r = mid - 1
else:
l = mid + 1
return [-1, -1]