139. Word Break java solutions

weixin_30770495

于 2016-07-14 20:15:00 发布

阅读量53

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/guoguolan/p/5671610.html

本文介绍了一种判断字符串是否能通过字典中的单词进行分割的方法。利用动态规划思想，通过布尔数组记录每个位置前的子串是否可以被正确分割。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

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