二维数组中查找一个数字

Vince_Wang1

于 2020-02-04 19:02:05 发布

阅读量320

点赞数

分类专栏：剑指offer 文章标签： java leetcode 算法数据结构

本文链接：https://blog.csdn.net/Vince_Wang1/article/details/104173467

版权

剑指offer 专栏收录该内容

1 篇文章 0 订阅

订阅专栏

今天沃尔又长高了只能看剑指offer了书上p40 java实现
边界判断+条件判断

public class offer {
    public static boolean findInPartiallySortedMatrix(int[][] data,int num){
        if(data==null ||data.length==0 || data[0].length==0)
            return false;
        int rowMax = data.length-1,colMax = data[0].length-1;
        int colCur = data.length-1,rowCur = 0;
        while(true){
            if(rowCur<0 | rowCur>rowMax | colCur<0 | colCur>colMax)
                return false;
            if(data[rowCur][colCur]==num)
                return true;
            else if(data[rowCur][colCur]>num)
                colCur--;
            else
                rowCur++;
        }
    }
    public static void main(String[] args){
        int[][] data = {{1,2,8,9},
                {2,4,9,12},
                {4,7,10,13},
                {6,8,11,15}};
        System.out.println(findInPartiallySortedMatrix(data, 15));
        System.out.println(findInPartiallySortedMatrix(data, 5));
    }

}