Added more tests for task 32.

Author: javadev

src/main/java/g0001_0100/s0032_longest_valid_parentheses/Solution.java

@@ -5,7 +5,6 @@ public int longestValidParentheses(String symbols) {
         int max = 0;
         char[] s = symbols.toCharArray();
         int[] dp = new int[s.length];
-
         for (int i = 1; i < s.length; i++) {
             if (s[i] == ')') {
                 if (s[i - 1] == '(') {
@@ -18,11 +17,9 @@ public int longestValidParentheses(String symbols) {
                         dp[i] += ((i - dp[i - 1]) >= 2) ? dp[i - dp[i - 1] - 2] : 0;
                     }
                 }
-
                 max = Math.max(max, dp[i]);
             }
         }
-
         return max;
     }
 }

src/test/java/g0001_0100/s0032_longest_valid_parentheses/SolutionTest.java

@@ -10,4 +10,14 @@ public class SolutionTest {
     public void longestValidParentheses() {
         assertThat(new Solution().longestValidParentheses("(()"), equalTo(2));
     }
+
+    @Test
+    public void longestValidParentheses2() {
+        assertThat(new Solution().longestValidParentheses(")()())"), equalTo(4));
+    }
+
+    @Test
+    public void longestValidParentheses3() {
+        assertThat(new Solution().longestValidParentheses(""), equalTo(0));
+    }
 }