Word Break 139

https://leetcode.com/problems/word-break/description/

Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, determine if s can be segmented into a space-separated sequence of one or more dictionary words. You may assume the dictionary does not contain duplicate words.

For example, given
s = “leetcode”,
dict = [“leet”, “code”].
Return true because “leetcode” can be segmented as “leet code”.

解题思路:
dp[i] 表示字符串0~i-1能够被字典中的单词分割
状态转移方程:

dp[i] = dp[j]&(string[j-1,i] in wordDict) (0<j<i)

边界

dp[0] = false;
dp[i] = true  string[0~i] in wordDict
public class Word_Break_139 {

    /**
     * dp[i] 表示字符串0~i-1能够被字典中的单词分割
     * 
     * 状态转移方程
     * dp[i] = dp[j]&(string[j-1,i] in wordDict) (0<j<i)
     * 
     * 边界
     * dp[0] = false;
     * dp[i] = true  string[0~i] in wordDict
     * @param s
     * @param wordDict
     * @return
     */
    public boolean wordBreak(String s, List<String> wordDict) {
        if(wordDict==null||wordDict.size()==0||s==null||s.length()==0)return false;
        int n = s.length();
        boolean[] dp = new boolean[n+1];

        for(int i=0;i<n;i++){
            if(wordDict.contains(s.substring(0, i+1)))dp[i+1]=true;
            for(int j=0;j<=i;j++){
                String subStr = s.substring(j, i+1);
                dp[i+1] = dp[i+1]||(dp[j]&&wordDict.contains(subStr));
            }
        }
        return dp[n];
    }

    public static void main(String[] args) {
        List<String> wordDict = Arrays.asList(new String[]{"a"});
        String s = "a";
        System.out.println(new Word_Break_139().wordBreak(s, wordDict));

    }
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值