[LeetCode]Word Break

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

利用遞歸動態規劃，而且遞歸的條件要有限制

public class Solution {
	boolean f[];
    public boolean wordBreak(String s, Set dict) {
    	f = new boolean[s.length()];
    	wordBreak(s,dict,0);
    	return f[s.length()-1];
    }
    
    private void wordBreak(String s, Set dict,int index){
    	if(index>=s.length()) return;
    	for(int i=index;i

參考九章算法，提取出set裡字符串的最長距離，可以進一步減小算法
public class Solution {
	boolean f[];
	int maxLen = Integer.MIN_VALUE;

    public boolean wordBreak(String s, Set dict) {
    	f = new boolean[s.length()];
    	maxLength(dict);
    	wordBreak(s,dict,0);
    	return f[s.length()-1];
    }
    
    private void wordBreak(String s, Set dict,int index){
    	if(index>=s.length()) return;
    	for(int i=index;i dict){
    	Iterator it = dict.iterator();
    	while(it.hasNext()){
    		maxLen = Math.max(maxLen, it.next().length());
    	}
    }
}