Search in 2D Matrix

与CC150相似

public  Point SearchMatrix(int[][] Matrix, int target){
    int Nrow = Matrix.length;
    int Ncol = Matrix[0].length;
    int row = 0;
    int col = Ncol-1;

    while(row<Nrow && col>=0){
    if(Matrix[row][col]==target){
       return new Point[row][col];
    }
      else if(Matrix[row][col]>target){
      col--;
      }
      else{
      row++;
      }
    row++;
    col--;  
    }
    return new Point[-1][-1];
  }
   class Point{
  int x;
  int y;
  }