From 6dd9d117ffc60cb6854f26814b05aa5be2033e84 Mon Sep 17 00:00:00 2001
From: matthew <1123957599@qq.com>
Date: Tue, 2 Apr 2024 23:58:58 +0800
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A00139.=E5=8D=95=E8=AF=8D?=
 =?UTF-8?q?=E6=8B=86=E5=88=86=20Python=20DP=E5=89=AA=E6=9E=9D=E6=96=B9?=
 =?UTF-8?q?=E6=B3=95?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0139.单词拆分.md | 21 +++++++++++++++++++++
 1 file changed, 21 insertions(+)

diff --git a/problems/0139.单词拆分.md b/problems/0139.单词拆分.md
index a3d59ec7..5ad0fcb0 100644
--- a/problems/0139.单词拆分.md
+++ b/problems/0139.单词拆分.md
@@ -394,7 +394,28 @@ class Solution:
                     dp[j] = dp[j] or (dp[j - len(word)] and word == s[j - len(word):j])
         return dp[len(s)]
 ```
+DP（剪枝）
 
+```python
+class Solution(object):
+    def wordBreak(self, s, wordDict):
+
+        # 先对单词按长度排序
+        wordDict.sort(key=lambda x: len(x))
+        n = len(s)
+        dp = [False] * (n + 1)
+        dp[0] = True
+        # 遍历背包
+        for i in range(1, n + 1):
+            # 遍历单词
+            for word in wordDict:
+                # 简单的 “剪枝”
+                if len(word) > i:
+                    break
+                dp[i] = dp[i] or (dp[i - len(word)] and s[i - len(word): i] == word)
+        return dp[-1]
+
+```
 
 
 ### Go：