demo7.txt

package chapter8;

//在排好序的矩阵中找数字
public class demo7 {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		int[][] arr = {{0,1,2,5},{2,3,4,7},{4,4,4,8},{5,7,7,9}};
		System.out.println(find(arr,9));
	}
	public static boolean find(int[][] arr,int k){
		int i = 0;
		int j = arr[0].length-1;
		while(i<arr.length && j>=0){
			if(arr[i][j] == k){
				return true;
			}
			else if(arr[i][j] > k){   //这里大于小于要搞仔细
				j--;
			}
			else{
				i++;
			}
		}
		return false;
	}
	
}