update: 139

Author: hijiangtao

README.md

@@ -87,6 +87,7 @@ This is the solutions collection of my LeetCode submissions, most of them are pr
 | 135 | [Candy](https://leetcode.com/problems/candy/)                                                                                                   | [JavaScript](./src/candy/res.js)                                                                                  | Hard       |
 | 136 | [Single Number](https://leetcode.com/problems/single-number/)                                                                                   | [JavaScript](./src/single-number/res.js)                                                                          | Easy       |
 | 137 | [Single Number II](https://leetcode.com/problems/single-number-ii/)                                                                             | [JavaScript](./src/single-number-ii/res.js)                                                                       | Medium     |
+| 139 | [word-break](https://leetcode.com/problems/word-break/)                                                                                         | [TypeScript](./src/word-break/res.ts)                                                                             | Medium     |
 | 151 | [Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string/)                                                           | [JavaScript](./src/reverse-words-in-a-string/res.js)                                                              | Medium     |
 | 152 | [Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/)                                                             | [JavaScript](./src/maximum-product-subarray/res.js)                                                               | Medium     |
 | 153 | [Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/)                                     | [JavaScript](./src/find-minimum-in-rotated-sorted-array/res.js)                                                   | Medium     |

src/word-break/res.ts

@@ -0,0 +1,18 @@
+function wordBreak(s: string, wordDict: string[]): boolean {
+    if (!s) {
+        return true;
+    }
+    const n = s.length;
+    const dp = new Array(n+1).fill(false);
+    dp[0] = true;
+
+    for (let i = 0; i < n; i++) {
+        for (let j = i+1; j <= n+1; j++) {
+            if (dp[i] && wordDict.includes(s.slice(i, j))) {
+                dp[j] = true;
+            }
+        }
+    }
+
+    return dp[n];
+};