[LeetCode] 240. Search a 2D Matrix II 搜索一個二維矩陣 II
阿新 • • 發佈:2018-03-23
str sort sel int als amp rom pro otto
Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:
- Integers in each row are sorted in ascending from left to right.
- Integers in each column are sorted in ascending from top to bottom.
For example,
Consider the following matrix:
[ [1, 4, 7, 11, 15], [2, 5, 8, 12, 19], [3, 6, 9, 16, 22], [10, 13, 14, 17, 24], [18, 21, 23, 26, 30] ]
Given target = 5
, return true
.
Given target = 20
, return false
.
74. Search a 2D Matrix 的變形,這題的矩陣特點是:每一行是按從左到右升序排列;每一列從上到下按升序排列。
解法:有特點的數是左下角和右上角的數。比如左下角的18開始,上面的數比它小,右邊的數比它大,和目標數相比較,如果目標數大,就往右搜,如果目標數小,就往左搜。這樣就可以判斷目標數是否存在。或者從右上角15開始,左面的數比它小,下面的數比它大。
Python:
class Solution: def searchMatrix(self, matrix, target): m = len(matrix) if m == 0: return False n = len(matrix[0]) if n == 0: return False i, j = 0, n - 1 while i < m and j >= 0: if matrix[i][j] == target: return True elif matrix[i][j] > target: j -= 1 else: i += 1 return False
C++:
class Solution { public: bool searchMatrix(vector<vector<int> > &matrix, int target) { if (matrix.empty() || matrix[0].empty()) return false; if (target < matrix[0][0] || target > matrix.back().back()) return false; int x = matrix.size() - 1, y = 0; while (true) { if (matrix[x][y] > target) --x; else if (matrix[x][y] < target) ++y; else return true; if (x < 0 || y >= matrix[0].size()) break; } return false; } };
類似題目:
[LeetCode] 74. Search a 2D Matrix 搜索一個二維矩陣
[LeetCode] 240. Search a 2D Matrix II 搜索一個二維矩陣 II