【Leetcode】Word Break (DP)

Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionary words.

For example, given
s = "leetcode",
dict = ["leet", "code"].

Return true because "leetcode" can be segmented as "leet code".

动态规划的经典题目

思路是

res[j]&&dict.contains(s.substring[j, i+1])

	public boolean wordBreak(String s, Set<String> dict) {
		if (s == null || s.length() == 0) {
			return false;
		}
		boolean[] result = new boolean[s.length() + 1];
		result[0] = true;
		for (int i = 0; i < s.length(); i++) {
			StringBuilder str = new StringBuilder(s.substring(0, i + 1));
			for (int j = 0; j <= i; j++) {
				if (result[j] && dict.contains(str.toString())) {
					result[i + 1] = true;
					break;
				}
				str.deleteCharAt(0);
			}
		}
		return result[s.length()];
	}