update 334

Author: fishercoder1534

Diff for: paginated_contents/algorithms/1st_thousand/README.md

@@ -494,7 +494,7 @@
 | 337 | [House Robber III](https://leetcode.com/problems/house-robber-iii/)                                                                                                                           | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/firstthousand/_337.java)                                                                  |                                                                               | Medium                           | DP                                                                   
 | 336 | [Palindrome Pairs](https://leetcode.com/problems/palindrome-pairs/)                                                                                                                           | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/firstthousand/_336.java)                                                                  |                                                                               | Hard                             |
 | 335 | [Self Crossing](https://leetcode.com/problems/self-crossing/)                                                                                                                                 | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/firstthousand/_335.java)                                                                  |                                                                               | Hard                             | Math                                                                 
-| 334 | [Increasing Triplet Subsequence](https://leetcode.com/problems/increasing-triplet-subsequence/)                                                                                               | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/firstthousand/_334.java)                                                                  |                                                                               | Medium                           |
+| 334 | [Increasing Triplet Subsequence](https://leetcode.com/problems/increasing-triplet-subsequence/)                                                                                               | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/firstthousand/_334.java)                                                                  |                                                                               | Medium                           | Array, Greedy
 | 333 | [Largest BST Subtree](https://leetcode.com/problems/largest-bst-subtree/)                                                                                                                     | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/firstthousand/_333.java)                                                                  |                                                                               | Medium                           | Tree                                                                 
 | 332 | [Reconstruct Itinerary](https://leetcode.com/problems/reconstruct-itinerary/)                                                                                                                 | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/firstthousand/_332.java)                                                                  |                                                                               | Medium                           | Graph, DFS                                                           
 | 331 | [Verify Preorder Serialization of a Binary Tree](https://leetcode.com/problems/verify-preorder-serialization-of-a-binary-tree/)                                                               | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/firstthousand/_331.java)                                                                  |                                                                               | Medium                           | Stack                                                                

Diff for: src/main/java/com/fishercoder/solutions/firstthousand/_334.java

@@ -1,7 +1,6 @@
 package com.fishercoder.solutions.firstthousand;
 
 public class _334 {
-
     public static class Solution1 {
         /**
          * Time: O(n^2)

Diff for: src/test/java/com/fishercoder/firstthousand/_334Test.java

@@ -1,37 +1,44 @@
 package com.fishercoder.firstthousand;
 
 import com.fishercoder.solutions.firstthousand._334;
-import org.junit.BeforeClass;
-import org.junit.Test;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
 
-import static org.junit.Assert.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 public class _334Test {
     private static _334.Solution1 solution1;
     private static _334.Solution2 solution2;
 
-    @BeforeClass
-    public static void setup() {
+    @BeforeEach
+    public void setup() {
         solution1 = new _334.Solution1();
         solution2 = new _334.Solution2();
     }
 
     @Test
     public void test1() {
-        assertEquals(true, solution1.increasingTriplet(new int[]{2, 1, 5, 0, 4, 6}));
-        assertEquals(true, solution2.increasingTriplet(new int[]{2, 1, 5, 0, 4, 6}));
+        assertTrue(solution1.increasingTriplet(new int[]{2, 1, 5, 0, 4, 6}));
+        assertTrue(solution2.increasingTriplet(new int[]{2, 1, 5, 0, 4, 6}));
     }
 
     @Test
     public void test2() {
-        assertEquals(false, solution1.increasingTriplet(new int[]{5, 4, 3, 2, 1}));
-        assertEquals(false, solution2.increasingTriplet(new int[]{5, 4, 3, 2, 1}));
+        assertFalse(solution1.increasingTriplet(new int[]{5, 4, 3, 2, 1}));
+        assertFalse(solution2.increasingTriplet(new int[]{5, 4, 3, 2, 1}));
     }
 
     @Test
     public void test3() {
-        assertEquals(false, solution1.increasingTriplet(new int[]{1, 1, -2, 6}));
-        assertEquals(false, solution2.increasingTriplet(new int[]{1, 1, -2, 6}));
+        assertFalse(solution1.increasingTriplet(new int[]{1, 1, -2, 6}));
+        assertFalse(solution2.increasingTriplet(new int[]{1, 1, -2, 6}));
+    }
+
+    @Test
+    public void test4() {
+        assertFalse(solution1.increasingTriplet(new int[]{1, 1, 1, 1, 1, 1, 1}));
+        assertFalse(solution2.increasingTriplet(new int[]{1, 1, 1, 1, 1, 1, 1}));
     }
 
 }