Find in 12-d arrays

The title is described in a two-dimensional array in which each row is ordered in ascending order from left to right, and each column is sorted in ascending order from top to bottom. Complete a function, enter a two-dimensional array and an integer to determine if the array contains the integer. Ideas: 利用二维数组由上到下，由左到右递增的规律， 那么选取右上角或者左下角的元素a[row][col]与target进行比较， 当target小于元素a[row][col]时，那么target必定在元素a所在行的左边, 即col--； 当target大于元素a[row][col]时，那么target必定在元素a所在列的下边, 即row++；

1  Public classSolution {2      Public BooleanFind (intTargetint[] Array) {3         introws = 0;4         intcols = array[0].length-1;5           while(Rows<=array.length-1 && cols>=0){6             if(target = = Array[rows][cols])return true;7             Else if(Target > Array[rows][cols]) rows + + ;8                 ElseCols--;9             Ten         } One         return false; A     } -}

Find in 12-d arrays