判斷二維數組是否含有該整數

關鍵代碼

public class Solution {
    public boolean Find(int target, int [][] array) {
            int c=0;
       if(array==null || array.length==0 || array[0].length==0)//判斷邊界
             return false;
        else {
            if(target<array[0][0] && target>array[array.length-1][array[0].length-1])
                return false;
            else
            {
                for(int i=0;i<array.length;i++) {
                   if(target<=array[i][array[0].length-1])
                    { for (int j = array[0].length-1; j >=0; j--)
                        if (array[i][j] == target)
                        {    c=1;
                            break;
                        }
                    }
                    if(c==1)
                        break;
                }
            }
        }
            if(c==1)
                return  true;
            else
                return false;
    }
}