题解 | #二维数组中的查找#
二维数组中的查找
http://www.nowcoder.com/practice/abc3fe2ce8e146608e868a70efebf62e
public class Solution {
public boolean Find(int target, int [][] array) {
int m = array.length;
int n = array[0].length;
int r = 0, c = n - 1;
while(r < m && c > -1) {
if(array[r][c] == target) {
return true;
} else if(target > array[r][c]) {
r++;
} else {
c--;
}
}
return false;
}
}
