refactor 32

fishercoder1534 · fishercoder1534 · commit 57ca6310ddb8 · 2020-02-26T07:06:12.000-08:00
diff --git a/src/main/java/com/fishercoder/solutions/_32.java b/src/main/java/com/fishercoder/solutions/_32.java
@@ -6,8 +6,16 @@
  * 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.
+ *
+ * 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 {
