问题描述:
样例输入:
代码如下:
package Leetcode;
import java.util.Scanner;
public class CheckStraightLine {
public static boolean checkStraightLine(int[][] coordinates) {
int len=coordinates.length;
if (len==1||len==2) return true;
if (coordinates[1][0]-coordinates[0][0]==0)
{
for (int i = 2; i < len; i++) {
if (coordinates[i][0]-coordinates[0][0]!=0)
return false;
}
return true;
}
if (coordinates[1][1]-coordinates[0][1]==0)
{
for (int i = 2; i < len; i++) {
if (coordinates[i][1]-coordinates[0][1]!=0)
return false;
}
return true;
}
double k=((coordinates[1][1]-coordinates[0][1])*1.0)/(coordinates[1][0]-coordinates[0][0]);
for (int i = 2; i <len ; i++) {
if (Math.abs(((coordinates[i][1]-coordinates[0][1])*1.0)/(coordinates[i][0]-coordinates[0][0])-k)>0.0000001)
{
return false;
}
}
return true;
}
public static void main(String[] args) {
Scanner scanner=new Scanner(System.in);
int len=scanner.nextInt();
int len1=scanner.nextInt();
int [][]coordinates=new int[len][len1];
for (int i = 0; i <len ; i++) {
for (int j = 0; j <len1 ; j++) {
coordinates[i][j]=scanner.nextInt();
}
}
System.out.println(checkStraightLine(coordinates));
}
}
运行结果如下: