在行列都排好序的矩阵中找数

package com.day1.practice;

public class FindNumInSortedMatrix {
    public static boolean isContains(int[][] matrix, int Key) {
        //定义初始索引位置为右上角的点
        int iR=0;
        int iC=matrix[0].length-1;
        int endR=matrix.length;
        int endC=-1;
        while (iR<endR&&iC>endC)
        {
            if (matrix[iR][iC]==Key){
                return true;
            }
            if (Key>matrix[iR][iC]){
                iR++;
                continue;//这里要加continue,不然可能会继续到下一个if造成数组越界
            }
            if (Key<matrix[iR][iC])
            {
                iC--;
                continue;
            }        }
        return false;
    }

    public static void main(String[] args){
        int[][] matrix = new int[][] { { 0, 1, 2, 3, 4, 5, 6 },// 0
                { 10, 12, 13, 15, 16, 17, 18 },// 1
                { 23, 24, 25, 26, 27, 28, 29 },// 2
                { 44, 45, 46, 47, 48, 49, 50 },// 3
                { 65, 66, 67, 68, 69, 70, 71 },// 4
                { 96, 97, 98, 99, 100, 111, 122 },// 5
                { 166, 176, 186, 187, 190, 195, 200 },// 6
                { 233, 243, 321, 341, 356, 370, 380 } // 7
        };
        int K = 43;
        System.out.println(isContains(matrix, K));
    }
}