[剑指Offer][数组]二维数组中的查找

 1 public class Solution {
 2     public boolean Find(int target, int [][] array) {
 3         if(array.length == 0 || array[0].length == 0) {
 4             return false;
 5         }
 6         for(int i = 0; i < array.length; i ++) {
 7             for(int j = 0; j < array[i].length; j ++) {
 8                 if(array[i][j] == target) {
 9                     return true;
10                 }
11             }
12         }
13         return false;
14     }
15 }

 1 public class Solution {
 2     public boolean Find(int target, int [][] array) {
 3         if(array.length == 0 || array[0].length == 0) {
 4             return false;
 5         }
 6         int i = 0;
 7         int j = array[0].length - 1;
 8         while(i < array.length && j >= 0) {
 9             if(array[i][j] == target) {
10                 return true;
11             } else if(array[i][j] > target) {
12                 j --;
13             } else if(array[i][j] < target) {
14                 i ++;
15             }
16         }
17         return false;
18     }
19 }