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".

---

解题思路：

Dynamic Programming.

本题我自己怎么也没想清楚，看了答案才理解。好好记住！

---

Java code:

public class Solution {    public boolean wordBreak(String s, Set
     
       wordDict) {        if(s == null) {            return false;        }        boolean[] dp = new  boolean[s.length()+1];        dp[0] = true;        for(int i = 1; i <= s.length(); i++){            for(int j = 0; j < i; j++) {                if(dp[j] && wordDict.contains(s.substring(j, i))){                    dp[i] = true;                }            }        }        return dp[s.length()];    }}
     

---

Reference:

1. https://leetcode.com/discuss/63212/java-solution-using-dp