refactor 452

fishercoder1534 · fishercoder1534 · commit ae32d87955a2 · 2019-04-14T09:02:37.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_452.java b/src/main/java/com/fishercoder/solutions/_452.java
@@ -29,26 +29,28 @@
  */
 public class _452 {
 
-    //credit: https://discuss.leetcode.com/topic/66579/java-greedy-soution/6
-    public int findMinArrowShots(int[][] points) {
-
-        if (points == null || points.length == 0) {
-            return 0;
-        }
-        // sort points based on their end point.
-        Arrays.sort(points, (p1, p2) -> Integer.compare(p1[1], p2[1]));
-        int currentEnd = points[0][1];
-        int count = 1;
-        for (int[] p : points) {
-            // if the point starts after currentEnd, it means this balloons not been bursted. Then we shot the balloon in its end point. Otherwise, means this balloon has been bursted, then ignore it.
-            if (p[0] > currentEnd) {
-                count++;
-                currentEnd = p[1];
-            } else {
-                continue;
+    public static class Solution1 {
+        /**
+         * credit: https://discuss.leetcode.com/topic/66579/java-greedy-soution/6
+         */
+        public int findMinArrowShots(int[][] points) {
+            if (points == null || points.length == 0) {
+                return 0;
             }
+            // sort points based on their end point.
+            Arrays.sort(points, (p1, p2) -> Integer.compare(p1[1], p2[1]));
+            int currentEnd = points[0][1];
+            int count = 1;
+            for (int[] p : points) {
+                // if the point starts after currentEnd, it means this balloons not been bursted. Then we shot the balloon in its end point. Otherwise, means this balloon has been bursted, then ignore it.
+                if (p[0] > currentEnd) {
+                    count++;
+                    currentEnd = p[1];
+                } else {
+                    continue;
+                }
+            }
+            return count;
         }
-        return count;
     }
-
 }
