首页 > 其他 > 详细

[Leetcode] Word Break

时间:2014-06-16 07:31:11      阅读:298      评论:0      收藏:0      [点我收藏+]

Question:

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

-----------------------------------------

Solution:dp

bubuko.com,布布扣
 1 public class Solution {
 2     public boolean wordBreak(String s, Set<String> dict) {
 3         boolean[] state=new boolean[s.length()+1];
 4         state[0]=true;
 5         for(int i=1;i<=s.length();i++){
 6             for(int j=i-1;j>=0;j--){
 7                 if(state[j]&&dict.contains(s.substring(j, i))){
 8                     state[i]=true;
 9                     break;
10                 }
11             }
12         }
13         return state[s.length()];
14     }
15 }
bubuko.com,布布扣

 

[Leetcode] Word Break,布布扣,bubuko.com

[Leetcode] Word Break

原文:http://www.cnblogs.com/Phoebe815/p/3783878.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!