上次编辑到这里，代码来自缓存 点击恢复默认模板
class Solution {
public:
bool searchMatrix(vector<vector<int>>& matrix, int target) {
}
};
python3 解法, 执行用时: 44 ms, 内存消耗: 15.3 MB, 提交时间: 2022-08-17 10:23:10
class Solution:
def searchMatrix(self, matrix: List[List[int]], target: int) -> bool:
from functools import reduce
return target in reduce(lambda x, y: x+y, matrix)
golang 解法, 执行用时: 0 ms, 内存消耗: 2.5 MB, 提交时间: 2022-08-17 10:18:00
func searchMatrix(matrix [][]int, target int) bool {
m, n := len(matrix), len(matrix[0])
i := sort.Search(m*n, func(i int) bool { return matrix[i/n][i%n] >= target })
return i < m*n && matrix[i/n][i%n] == target
}
