Leetcode 593. Valid Square

最新推荐文章于 2024-11-11 20:59:17 发布

jiongjiongai

最新推荐文章于 2024-11-11 20:59:17 发布

阅读量210

点赞数

文章标签： leetcode

本文链接：https://blog.csdn.net/phoenix198425/article/details/78578977

版权

题目

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:
1. All the input integers are in the range [-10000, 10000].
2. A valid square has four equal sides with positive length and four equal angles (90-degree angles).
3. Input points have no order.

解题思路

利用已知的两个点 $A, B$ 直接求出来另外两个点 $C, D$ ：

$A(x_1, y_1), B(x_2, y_2) C(x_3, y_3), D(x_4, y_4)$
1. $AB$ 是边时，分两种情况：
1.1 正方形逆时针方向是 $ABCD$ ：

A D \to = B C \to = A B \to \cdot i = [(x 2 - x 1) + (y 2 - y 1) i] \cdot i = (y 1 - y 2) + (x 2 - x 1) i

$\vec{AD} =\vec{BC} = \vec{AB} \cdot i\\ = [(x_2 - x_1) + (y_2 - y_1)i] \cdot i \\ = (y_1 - y_2) + (x_2 - x_1)i$

C = x 2 + y 2 i + (y 1 - y 2) + (x 2 - x 1) i = (x 2 + y 1 - y 2, x 2 - x 1 + y 2)

$C = x_2 + y_2 i + (y_1 - y_2) + (x_2 - x_1)i \\ = ( x_2 + y_1 - y_2 , x_2 - x_1 + y_2 )$

D = x 1 + y 1 i + (y 1 - y 2) + (x 2 - x 1) i = (x 1 + y 1 - y 2, x 2 - x 1 + y 1)

$D = x_1 + y_1 i + (y_1 - y_2) + (x_2 - x_1)i \\ = ( x_1 + y_1 - y_2 , x_2 - x_1 + y_1 )$
1.2 正方形顺时针方向是

ABCD $ABCD$ ：

A D \to = B C \to = A B \to \cdot (- i) = - [(x 2 - x 1) + (y 2 - y 1) i] \cdot i = (y 2 - y 1) + (x 1 - x 2) i

$\vec{AD} =\vec{BC} = \vec{AB} \cdot ( -i) \\ = -[(x_2 - x_1) + (y_2 - y_1)i] \cdot i \\ = (y_2 - y_1) + (x_1 - x_2)i$

C = x 2 + y 2 i + (y 2 - y 1) + (x 1 - x 2) i = (x 2 + y 2 - y 1, x 1 - x 2 + y 2)

$C = x_2 + y_2 i + (y_2 - y_1) + (x_1 - x_2)i \\ = ( x_2 + y_2 - y_1 , x_1 - x_2 + y_2 )$

D = x 1 + y 1 i + (y 2 - y 1) + (x 1 - x 2) i = (x 1 + y 2 - y 1, x 1 - x 2 + y 1)

$D = x_1 + y_1 i + (y_2 - y_1) + (x_1 - x_2)i \\ = ( x_1 + y_2 - y_1 , x_1 - x_2 + y_1 )$
2. AB是对角线时，只有一种情况。设正方形逆时针方向是

ADBC $ADBC$ ：

A C \to = A B \to \cdot 1 2 (1 + i) = 1 2 [(x 2 - x 1) + (y 2 - y 1) i] \cdot (1 + i) = 1 2 [x 2 - x 1 + y 1 - y 2 + (x 2 - x 1 + y 2 - y 1) i]

$\vec{AC} = \vec{AB} \cdot \frac{1}{2}(1 + i) \\ = \frac{1}{2} [(x_2 - x_1) + (y_2 - y_1)i] \cdot (1 + i) \\ = \frac{1}{2} [x_2 - x_1 + y_1 - y_2 + (x_2 - x_1 + y_2 - y_1)i]$

C = x 1 + y 1 i + 1 2 [x 2 - x 1 + y 1 - y 2 + (x 2 - x 1 + y 2 - y 1) i] = 1 2 [x 1 + x 2 + y 1 - y 2 + (x 2 - x 1 + y 1 + y 2) i]

$C = x_1 + y_1 i + \frac{1}{2} [x_2 - x_1 + y_1 - y_2 + (x_2 - x_1 + y_2 - y_1)i] \\ = \frac{1}{2} [x_1 + x_2 + y_1 - y_2 + (x_2 - x_1 + y_1 + y_2)i]$

A D \to = A B \to \cdot 1 2 (1 - i) = 1 2 [(x 2 - x 1) + (y 2 - y 1) i] \cdot (1 - i) = 1 2 [x 2 - x 1 + y 2 - y 1 + (x 1 - x 2 + y 2 - y 1) i]

$\vec{AD} = \vec{AB} \cdot \frac{1}{2}(1 - i) \\ = \frac{1}{2} [(x_2 - x_1) + (y_2 - y_1)i] \cdot (1 - i) \\ = \frac{1}{2} [x_2 - x_1 + y_2 - y_1 + (x_1 - x_2 + y_2 - y_1)i]$

D = x 1 + y 1 i + 1 2 [x 2 - x 1 + y 2 - y 1 + (x 1 - x 2 + y 2 - y 1) i] = 1 2 [x 1 + x 2 - y 1 + y 2 + (x 1 - x 2 + y 1 + y 2) i]

$D = x_1 + y_1 i + \frac{1}{2} [x_2 - x_1 + y_2 - y_1 + (x_1 - x_2 + y_2 - y_1)i] \\ = \frac{1}{2} [x_1 + x_2 - y_1 + y_2 + (x_1 - x_2 + y_1 + y_2)i]$

代码

#include <stdbool.h>

/* p1 = q1 and p2 = q2 or p1 = q2 and p2 = q1 */
bool same_points(int *p1, int *p2, int *q1, int *q2, int shift)
{
    return (p1[0] == q1[0] << shift && p2[0] == q2[0] << shift
        && p1[1] == q1[1] << shift && p2[1] == q2[1] << shift)
        || (p1[0] == q2[0] << shift && p2[0] == q1[0] << shift
            && p1[1] == q2[1] << shift && p2[1] == q1[1] << shift);
}

int valid_square(int* p1, int* p2, int* p3, int* p4)
{
    int x1 = p1[0];
    int y1 = p1[1];
    int x2 = p2[0];
    int y2 = p2[1];
    int points[][2] =
    {
        { x1 + y1 - y2, -x1 + x2 + y1 },
        { x2 + y1 - y2, -x1 + x2 + y2 },
        { x1 - y1 + y2, x1 - x2 + y1 },
        { x2 - y1 + y2, x1 - x2 + y2 },
        { x1 + x2 + y1 - y2, -x1 + x2 + y1 + y2 },
        { x1 + x2 - y1 + y2,  x1 - x2 + y1 + y2 }
    };

    return same_points(points[0], points[1], p3, p4, 0)
        || same_points(points[2], points[3], p3, p4, 0)
        || same_points(points[4], points[5], p3, p4, 1);
}

bool validSquare(int* p1, int p1Size, int* p2, int p2Size, int* p3, int p3Size, int* p4, int p4Size)
{
    return !(p1[0] == p2[0] && p1[1] == p2[1] ) /* p1 != p2 */
        && valid_square(p1, p2, p3, p4);
}