refactor 32

fishercoder1534 · fishercoder1534 · commit 1207a1e593a7 · 2017-12-23T08:07:15.000-08:00
diff --git a/src/main/java/com/fishercoder/solutions/_32.java b/src/main/java/com/fishercoder/solutions/_32.java
@@ -3,29 +3,31 @@
 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.
-
- For "(()", the longest valid parentheses substring is "()", which has length = 2.
-
- Another example is ")()())", where the longest valid parentheses substring is "()()", which has length = 4.
+ * For "(()", the longest valid parentheses substring is "()", which has length = 2.
+ * Another example is ")()())", where the longest valid parentheses substring is "()()", which has length = 4.
  */
 public class _32 {
-	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;
-	}
+  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;
+    }
+  }
 }
