refactor 456

fishercoder1534 · fishercoder1534 · commit e59063b8bc1d · 2019-04-18T07:28:48.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_456.java b/src/main/java/com/fishercoder/solutions/_456.java
@@ -33,31 +33,31 @@
 
 public class _456 {
 
-    /**Looked at this post: https://discuss.leetcode.com/topic/67881/single-pass-c-o-n-space-and-time-solution-8-lines-with-detailed-explanation
-     * It scans only once, this is the power of using correct data structure.
-     * It goes from the right to the left.
-     * It keeps pushing elements into the stack,
-     * but it also keeps poping elements out of the stack as long as the current element is bigger than this number.*/
-    public static boolean find132pattern(int[] nums) {
-        Deque<Integer> stack = new LinkedList<>();
-
-        int s3 = Integer.MIN_VALUE;
-        for (int i = nums.length - 1; i >= 0; i--) {
-            if (nums[i] < s3) {
-                return true;
-            } else {
-                while (!stack.isEmpty() && nums[i] > stack.peek()) {
-                    s3 = Math.max(s3, stack.pop());
+    public static class Solution1 {
+        /**
+         * credit: https://discuss.leetcode.com/topic/67881/single-pass-c-o-n-space-and-time-solution-8-lines-with-detailed-explanation
+         * It scans only once, this is the power of using correct data structure.
+         * It goes from the right to the left.
+         * It keeps pushing elements into the stack,
+         * but it also keeps poping elements out of the stack as long as the current element is bigger than this number.
+         */
+        public boolean find132pattern(int[] nums) {
+            Deque<Integer> stack = new LinkedList<>();
+
+            int s3 = Integer.MIN_VALUE;
+            for (int i = nums.length - 1; i >= 0; i--) {
+                if (nums[i] < s3) {
+                    return true;
+                } else {
+                    while (!stack.isEmpty() && nums[i] > stack.peek()) {
+                        s3 = Math.max(s3, stack.pop());
+                    }
                 }
+                stack.push(nums[i]);
             }
-            stack.push(nums[i]);
-        }
 
-        return false;
+            return false;
+        }
     }
 
-    public static void main(String... args) {
-        int[] nums = new int[]{-1, 3, 2, 0};
-        System.out.println(find132pattern(nums));
-    }
 }
diff --git a/src/test/java/com/fishercoder/_456Test.java b/src/test/java/com/fishercoder/_456Test.java
@@ -0,0 +1,23 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._456;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static junit.framework.Assert.assertEquals;
+
+public class _456Test {
+    private static _456.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _456.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(true, solution1.find132pattern(new int[]{-1, 3, 2, 0}));
+
+    }
+
+}
