593. Valid Square

最新推荐文章于 2020-02-26 21:15:44 发布

qq_27262609

最新推荐文章于 2020-02-26 21:15:44 发布

阅读量281

点赞数

本文链接：https://blog.csdn.net/qq_27262609/article/details/73651012

版权

我其实挺佩服我自己的。。。这题考的是初中平面几何。。而我居然还记得23333

public class Solution {
    public boolean validSquare(int[] p1, int[] p2, int[] p3, int[] p4) {
        int[] nums = new int[6];
        nums[0] = (p1[0] - p2[0]) * (p1[0] - p2[0]) + (p1[1] - p2[1]) * (p1[1] - p2[1]);
        nums[1] = (p1[0] - p3[0]) * (p1[0] - p3[0]) + (p1[1] - p3[1]) * (p1[1] - p3[1]);
        nums[2] = (p1[0] - p4[0]) * (p1[0] - p4[0]) + (p1[1] - p4[1]) * (p1[1] - p4[1]);

        nums[3] = (p2[0] - p4[0]) * (p2[0] - p4[0]) + (p2[1] - p4[1]) * (p2[1] - p4[1]);
        nums[4] = (p3[0] - p4[0]) * (p3[0] - p4[0]) + (p3[1] - p4[1]) * (p3[1] - p4[1]);

        nums[5] = (p2[0] - p3[0]) * (p2[0] - p3[0]) + (p2[1] - p3[1]) * (p2[1] - p3[1]);

        Arrays.sort(nums);
        if(nums[0]!=nums[1]||nums[0]!=nums[2]||nums[0]!=nums[3]){
            return false;
        }
        if(nums[0]==nums[1]&&nums[0]==nums[2]&&nums[0]==nums[3]&&nums[0]==nums[4]&&nums[0]==nums[5]){
            return false;
        }
        if(nums[0]+nums[1]!=nums[5]){
            return false;
        }

        return true;
    }
}

Given the coordinates of four points in 2D space, return whether the four points could construct a square.

The coordinate (x,y) of a point is represented by an integer array with two integers.

Example:

Input: p1 = [0,0], p2 = [1,1], p3 = [1,0], p4 = [0,1]
Output: True

Note:

All the input integers are in the range [-10000, 10000].
A valid square has four equal sides with positive length and four equal angles (90-degree angles).
Input points have no order.