leetcode139. 单词拆分

class Solution {
    public boolean wordBreak(String s, List<String> wordDict) {
        //f[i]用于表示以i为结尾的字符串是否能够拼成
        int n = s.length();
        boolean[] f = new boolean[n+1];
        f[0] = true;
        for(int i = 1;i <= n;i++){
            for(int j = 0;j < wordDict.size();j++){
                String word = wordDict.get(j);
                if(i-word.length() < 0 || !f[i-word.length()])
                    continue;
                if(isFix(s,word,i-1))
                    f[i] = true;
            }
        }
        return f[n];
    }

    public boolean isFix(String s,String word,int index){
        for(int i = word.length()-1;i >= 0;i--){
            if(word.charAt(i) != s.charAt(index))
                return false;
            index--;
        }
        return true;
    }
}