二维数组遍历

public class Array {
	//二维数组遍历
	public boolean Find(int [][] array,int target) 
	{
		for(int i = 0; i < array.length; i ++)
		{
			for(int j = 0; j < array[i].length; j ++)
			{
				if(array[i][j] == target)
				{
					return true;
				}
			}
		}
		return false;
    }
	
	//从左下角开始查找
	public boolean Find2(int[][] array, int target)
	{
		int i = array.length - 1;
		int j = 0;
		while(i >= 0 && j <= array[0].length - 1)
		{
			if(target > array[i][j])
			{
				j ++;
			}
			else if(target < array[i][j])
			{
				i --;
			}
			else
			{
				return true;
			}
		}
		return false;
	}
}