java 实现二维数组查找

public class Solution {
    public boolean Find(int target, int [][] array) {
        int col=array[0].length-1;
        int row=0;
        boolean key=false;
        while( row <= array.length-1 && col>= 0){
           if(array[row][col]==target){
              key=true;
                break;
            }
          else if(array[row][col]>target){
             --col;
         }
         else{
             ++row;
         } 
         }
        return key;
    }
}

posted on 2018-01-01 11:05  cayman丿2016  阅读(136)  评论(0编辑  收藏  举报

导航