refactor 335

fishercoder1534 · fishercoder1534 · commit b43170b0cfac · 2019-01-07T07:24:52.000-08:00
diff --git a/src/main/java/com/fishercoder/solutions/_335.java b/src/main/java/com/fishercoder/solutions/_335.java
@@ -45,29 +45,33 @@ Return true (self crossing)
 
  */
 public class _335 {
-
-    /**reference: https://discuss.leetcode.com/topic/38014/java-oms-with-explanation/2*/
-    public boolean isSelfCrossing(int[] x) {
-        int l = x.length;
-        if (l <= 3) {
-            return false;
-        }
-
-        for (int i = 3; i < l; i++) {
-            if (x[i] >= x[i - 2] && x[i - 1] <= x[i - 3]) {
-                return true;  //Fourth line crosses first line and onward
+    public static class Solution1 {
+        /** reference: https://discuss.leetcode.com/topic/38014/java-oms-with-explanation/2 */
+        public boolean isSelfCrossing(int[] x) {
+            int l = x.length;
+            if (l <= 3) {
+                return false;
             }
-            if (i >= 4) {
-                if (x[i - 1] == x[i - 3] && x[i] + x[i - 4] >= x[i - 2]) {
-                    return true; // Fifth line meets first line and onward
+
+            for (int i = 3; i < l; i++) {
+                if (x[i] >= x[i - 2] && x[i - 1] <= x[i - 3]) {
+                    return true;  //Fourth line crosses first line and onward
                 }
-            }
-            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]) {
-                    return true;  // Sixth line crosses first line and onward
+                if (i >= 4) {
+                    if (x[i - 1] == x[i - 3] && x[i] + x[i - 4] >= x[i - 2]) {
+                        return true; // Fifth line meets first line and onward
+                    }
+                }
+                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]) {
+                        return true;  // Sixth line crosses first line and onward
+                    }
                 }
             }
+            return false;
         }
-        return false;
     }
 }
