剑指offer - 面试题3：二维数组中的查找

问题导读：

代码：

import java.util.Scanner;

public class interview_3 {
public static void main(String []args) {

Scanner cin = new Scanner(System.in);

int [][]arr = {
{1,2,8,9},
{2,4,9,12},
{4,7,10,13},
{6,8,11,15}
};
int target = cin.nextInt();

if(findNumber(arr, arr.length, arr[0].length, target)) {
System.out.println("ok!");
} else {
System.out.println("no!");
}
}
public static boolean findNumber(int[][] matrix, int rows, int columns, int number) {
boolean found = false;
if(matrix != null && rows > 0 && columns > 0) {
int row = rows -1;
int column = 0;
while(row>=0 && column<columns) {
if(matrix[row][column]==number) {
found = true;
break;
} else if(matrix[row][column]>number) {
row--;
} else {
column++;
}
}
}
return found;
}
}

测试：

peerslee@peerslee-ubuntu:~/ws/java/offer$ java interview_3
1
ok!
peerslee@peerslee-ubuntu:~/ws/java/offer$ java interview_3
2
ok!
peerslee@peerslee-ubuntu:~/ws/java/offer$ java interview_3
5
no!
peerslee@peerslee-ubuntu:~/ws/java/offer$ java interview_3
0
no!