Finding in a two-dimensional array-Sword point offer

Description of the lookup topic in a two-dimensional array

In a two-dimensional array, 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.

Enter a description

Array: two-dimensional array to find

Target: The number found

Output description

Find to return True, find not to return false

Ideas

1. Because the array is ascending from left to right from top to bottom, so we can start from the upper right corner to find, if the upper right corner of the number than target, then it is in the column is large, can be shed, until the small, and then start looking down, if the upper-right corner than target small, it is located in this column is small, You can drop it down until you find one that is greater than or equal to target.
2. We can also start looking from the lower left corner, the truth is the same, is the size of the comparison to the reverse

Code

PublicClass Solution {public BooleanFind(int []Arrayint target) {Boolean found =Falseif (Array! = NULL &&Array.Length >0 &&array[0].length > 0) {int row = 0; int column = array[0].length- Span class= "Hljs-number" >1; while (Row <= (array.length-1 ) && column >= 0) {if ( Array[row][column] = = target) {found = true; break;} else if (array[row][column] > target) {column--;} else {row++;}}} return found;}            

Find in a two-dimensional array-Sword point offer