Sep 19, 2022 · Sep 13, 2022 · Sep 13, 2022 · Sep 13, 2022 · Sep 14, 2022 · Sep 19, 2022
diff --git a/problems/0139.单词拆分.md b/problems/0139.单词拆分.md
Original file line number	Diff line number	Diff line change
Expand Up		@@ -250,6 +250,26 @@ class Solution {
		}
		}

	// 另一种思路的背包算法
	class Solution {
	public boolean wordBreak(String s, List<String> wordDict) {
	boolean[] dp = new boolean[s.length() + 1];
	dp[0] = true;

	for (int i = 1; i <= s.length(); i++) {
	for (String word : wordDict) {
	int len = word.length();
	if (i >= len && dp[i - len] && word.equals(s.substring(i - len, i))) {
	dp[i] = true;
	break;
	}
	}
	}

	return dp[s.length()];
	}
	}

		// 回溯法+记忆化
		class Solution {
		private Set<String> set;
Expand Down