docs(DP): update LongestValidParentheses.java

Dynamic Programming/LongestValidParentheses.java

@@ -1,11 +1,9 @@
-
 import java.util.Scanner;
 
 /**
  * Given a string containing just the characters '(' and ')', find the length of
  * the longest valid (well-formed) parentheses substring.
  *
- *
  * @author Libin Yang (https://github.com/yanglbme)
  * @since 2018/10/5
  */
@@ -57,7 +55,5 @@ public class LongestValidParentheses {
         }
 
         sc.close();
-
     }
-
 }