refactor 335

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/_335.java

@@ -1,52 +1,10 @@
 package com.fishercoder.solutions;
 
-/**
- * 335. Self Crossing
- *
- * You are given an array x of n positive numbers.
- * You start at point (0,0) and moves x[0] metres to the north,
- * then x[1] metres to the west,
- * x[2] metres to the south,
- * x[3] metres to the east and so on.
- * In other words, after each move your direction changes counter-clockwise.
-
- Write a one-pass algorithm with O(1) extra space to determine, if your path crosses itself, or not.
-
- Example 1:
- Given x =
- [2, 1, 1, 2]
- ,
- ?????
- ?   ?
- ???????>
- ?
-
- Return true (self crossing)
- Example 2:
- Given x =
- [1, 2, 3, 4]
- ,
- ????????
- ?      ?
- ?
- ?
- ?????????????>
-
- Return false (not self crossing)
- Example 3:
- Given x =
- [1, 1, 1, 1]
- ,
- ?????
- ?   ?
- ?????>
-
- Return true (self crossing)
-
- */
 public class _335 {
     public static class Solution1 {
-        /** reference: https://discuss.leetcode.com/topic/38014/java-oms-with-explanation/2 */
+        /**
+         * reference: https://discuss.leetcode.com/topic/38014/java-oms-with-explanation/2
+         */
         public boolean isSelfCrossing(int[] x) {
             int l = x.length;
             if (l <= 3) {
@@ -64,9 +22,9 @@ public boolean isSelfCrossing(int[] x) {
                 }
                 if (i >= 5) {
                     if (x[i - 2] - x[i - 4] >= 0
-                        && x[i] >= x[i - 2] - x[i - 4]
-                        && x[i - 1] >= x[i - 3] - x[i - 5]
-                        && x[i - 1] <= x[i - 3]) {
+                            && x[i] >= x[i - 2] - x[i - 4]
+                            && x[i - 1] >= x[i - 3] - x[i - 5]
+                            && x[i - 1] <= x[i - 3]) {
                         return true;  // Sixth line crosses first line and onward
                     }
                 }