剑指Offer JZ1

二维数组：
[ [1,2,8,9],
[2,4,9,12],
[4,7,10,13],
[6,8,11,15]]

C#

class Solution
{
    public bool Find(int target, int[][] array)
    {
        for(int i=0;i<array.Length;i++)
        {
            for(int j=0;j<array[i].Length;j++)
            {
                if(array[i][j]==target)
                    return true;
            }
        }
        return false;
    }
}

Java

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