refactor 139

fishercoder1534 · fishercoder1534 · commit 04da4df42844 · 2020-06-25T07:52:58.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_139.java b/src/main/java/com/fishercoder/solutions/_139.java
@@ -2,28 +2,12 @@
 
 import java.util.List;
 
-/**
- * 139. Word Break
- *
- * Given a non-empty string s and a dictionary wordDict containing a list of non-empty words,
- * determine if s can be segmented into a space-separated sequence of one or more dictionary words.
- * You may assume the dictionary does not contain duplicate words.
-
- For example, given
- s = "leetcode",
- dict = ["leet", "code"].
-
- Return true because "leetcode" can be segmented as "leet code".
-
- UPDATE (2017/1/4):
- The wordDict parameter had been changed to a list of strings (instead of a set of strings).
- Please reload the code definition to get the latest changes.
- */
-
 public class _139 {
 
     public static class Solution1 {
-        /** this beats 70.46% submission. */
+        /**
+         * this beats 70.46% submission.
+         */
         public boolean wordBreak(String s, List<String> wordDict) {
             int n = s.length();
             boolean[] dp = new boolean[n + 1];
@@ -85,7 +69,7 @@ public boolean wordBreak(String s, List<String> wordDict) {
             dp[0] = true;
             for (int i = 1; i <= n; i++) {
                 for (int lastWordLength = 1; lastWordLength <= i && lastWordLength <= maxLen;
-                    lastWordLength++) {
+                     lastWordLength++) {
                     if (!dp[i - lastWordLength]) {
                         continue;
                     }
