refactor 32

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/_32.java

@@ -2,40 +2,25 @@
 
 import java.util.Stack;
 
-/**
- * 32. Longest Valid Parentheses
- *
- * Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring.
- *
- * Example 1:
- * Input: "(()"
- * Output: 2
- * Explanation: The longest valid parentheses substring is "()"
- *
- * Example 2:
- * Input: ")()())"
- * Output: 4
- * Explanation: The longest valid parentheses substring is "()()"
- */
 public class _32 {
-  public static class Solution1 {
-    public int longestValidParentheses(String s) {
-      int result = 0;
-      Stack<Integer> stack = new Stack();
-      stack.push(-1);
-      for (int i = 0; i < s.length(); i++) {
-        if (s.charAt(i) == '(') {
-          stack.push(i);
-        } else {
-          stack.pop();
-          if (stack.isEmpty()) {
-            stack.push(i);
-          } else {
-            result = Math.max(result, i - stack.peek());
-          }
+    public static class Solution1 {
+        public int longestValidParentheses(String s) {
+            int result = 0;
+            Stack<Integer> stack = new Stack();
+            stack.push(-1);
+            for (int i = 0; i < s.length(); i++) {
+                if (s.charAt(i) == '(') {
+                    stack.push(i);
+                } else {
+                    stack.pop();
+                    if (stack.isEmpty()) {
+                        stack.push(i);
+                    } else {
+                        result = Math.max(result, i - stack.peek());
+                    }
+                }
+            }
+            return result;
         }
-      }
-      return result;
     }
-  }
 }