HW7.15

最新推荐文章于 2024-05-26 21:36:47 发布

weixin_30920513

最新推荐文章于 2024-05-26 21:36:47 发布

阅读量59

点赞数

原文链接：http://www.cnblogs.com/wood-python/p/5861131.html

版权

 1 public class Solution
 2 {
 3     public static void main(String[] args)
 4     {
 5         double[][] set1 = {{1, 1}, {2, 2}, {3, 3}, {4, 4}};
 6         double[][] set2 = {{0, 1}, {1, 2}, {4, 5}, {5, 6}};
 7         double[][] set3 = {{0, 1}, {1, 2}, {4, 5}, {4.5, 4}};
 8 
 9         System.out.println(isOnOneLine(set1));
10         System.out.println(isOnOneLine(set2));
11         System.out.println(isOnOneLine(set3));
12     }
13 
14     public static boolean isOnOneLine(double[][] array)
15     {
16         double sub = array[0][1] - array[0][0];
17         for(int i = 0; i < array.length; i++)
18         {
19             if(array[i][1] - array[i][0] != sub)
20                 return false;
21         }
22         return true;
23     }
24 }