Search a 2D Matrix II
Total Accepted: 928 Total Submissions: 2932 My Submissions Question Solution
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.
【解题思路】
二分查找。
初始化 i = 0,j = col - 1,判断当前值和target大小,如果相等直接返回true。
如果matirx[i][j]比当前值大,左移一列。如果比当前值小,下移一行。
Total Accepted: 928 Total Submissions: 2932 My Submissions Question Solution
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.
【解题思路】
二分查找。
初始化 i = 0,j = col - 1,判断当前值和target大小,如果相等直接返回true。
如果matirx[i][j]比当前值大,左移一列。如果比当前值小,下移一行。
Java AC
public class Solution {
public boolean searchMatrix(int[][] matrix, int target) {
if(matrix == null || matrix.length == 0){
return false;
}
int m = matrix.length;
int n = matrix[0].length;
int i = 0;
int j = n - 1;
while(i < m && j >= 0){
if(matrix[i][j] == target){
return true;
}
if(matrix[i][j] > target){
j--;
}else if(matrix[i][j] < target){
i++;
}
}
return false;
}
}