public int maxPoints(Point[] points) {
       int big =0;
       int flag =0;
       if(points.length<2){
           return points.length;
       }
       for(int i = 0; i < points.length ; i++)
           for(int j=i+1; j <points.length; j++){
               if((points[i].x != points[j].x) || (points[i].y != points[j].y) ){
                   int temp = Number(points[i],points[j],points);
                   if(temp > big)
                       big = temp;
                   flag =1;
               }
           }
       if(flag ==0) // 所有的点同一行或者同一列。
           return points.length;
       else
           return big;

   }