码迷,mamicode.com
首页 > 其他好文 > 详细

LeetCode:Word Break

时间:2016-06-12 02:42:54      阅读:116      评论:0      收藏:0      [点我收藏+]

标签:

Word Break


Total Accepted: 89221 Total Submissions: 347438 Difficulty: Medium

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

Subscribe to see which companies asked this question
















java code:

public class Solution {
    public boolean wordBreak(String s, Set<String> wordDict) {
        
        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;
                    break;
                }
            }
        }
        return dp[s.length()];
    }
}


LeetCode:Word Break

标签:

原文地址:http://blog.csdn.net/itismelzp/article/details/51615767

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!