refactor 593

fishercoder1534 · fishercoder1534 · commit 96bf66ecc185 · 2020-07-17T07:06:16.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_593.java b/src/main/java/com/fishercoder/solutions/_593.java
@@ -4,22 +4,6 @@
 import java.util.Arrays;
 import java.util.List;
 
-/**
- * 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.
-
- */
 public class _593 {
     public static class Solution1 {
         /**
