leetcode593. Valid Square

593. Valid Square

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.

解法

使用set，四个点之间的距离，然后只有2个值，则满足条件，且其中不能有0，因为如果有0，会重合，不满足条件。

public class Solution {
    public boolean validSquare(int[] p1, int[] p2, int[] p3, int[] p4) {
        if (p1 == null || p1.length == 0 || p2 == null || p2.length == 0) {
            return false;
        }
        if (p3 == null || p3.length == 0 || p4 == null || p4.length == 0) {
            return false;
        }

        Set<Integer> set = new HashSet<>();
        set.add(valid(p1, p2));
        set.add(valid(p1, p3));
        set.add(valid(p1, p4));
        set.add(valid(p2, p3));
        set.add(valid(p2, p4));
        set.add(valid(p3, p4));
        if (!set.contains(0) && set.size() == 2) {
            return true;
        }

        return false;
    }

    private int valid(int[] a, int[] b) {
        return (a[0] - b[0]) * (a[0] - b[0]) + (a[1] - b[1]) * (a[1] - b[1]);
    }
}