Problem Word Break

Problem Description:

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:

 1 public boolean wordBreak(String s, Set<String> dict) {
 2        Set<Character> set = new HashSet<Character>();
 3         for (int i = 0; i < s.length(); i++) {
 4             set.add(s.charAt(i));
 5         }
 6         for (char a : set) {
 7             boolean found = false;
 8             for (String word : dict) {
 9                 if (word.indexOf((int)a) >= 0) {
10                     found = true;
11                 }
12             }
13
14             if (! found) {
15                 return false;
16             }
17         }
18
19         if (s == null || dict.size() == 0 || dict == null) {
20             return false;
21         }
22         if (s.equals("")) return true;
23
24         for (String word : dict) {
25             if (word.length() <= s.length()) {
26                 if (s.substring(0, word.length()).equals(word)) {
27                     boolean result = wordBreak(s.substring(word.length()), dict);
28                     if (result) return true;
29                 }
30             }
31         }
32
33         return false;
34     }

Problem Word Break

时间： 2024-10-24 18:54:13

Problem Word Break的相关文章

Problem Word Break II

Problem Description: Given a string s and a dictionary of words dict, add spaces in s to construct a sentence where each word is a valid dictionary word. Return all such possible sentences. For example, givens = "catsanddog",dict = ["cat&qu

Word Break II

https://oj.leetcode.com/problems/word-break-ii/ Given a string s and a dictionary of words dict, add spaces in s to construct a sentence where each word is a valid dictionary word. Return all such possible sentences. For example, givens = "catsanddog

[leecode]Word Break II

Word Break II Given a string s and a dictionary of words dict, add spaces in s to construct a sentence where each word is a valid dictionary word. Return all such possible sentences. For example, givens = "catsanddog",dict = ["cat", &q

Word Break && Word Break II

Word Break && Word Break II Word Break 题目: 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 = ["

[C++]LeetCode: 113 Word Break II (DP && Backtacking) 求解拆分组合

题目: Given a string s and a dictionary of words dict, add spaces in s to construct a sentence where each word is a valid dictionary word. Return all such possible sentences. For example, given s = "catsanddog", dict = ["cat", "cats

leetcode[140] Word Break II

这题是上一题的加强版,这里需要返回的是所有可能的分割词.例如: s = "catsanddog",dict = ["cat", "cats", "and", "sand", "dog"]. A solution is ["cats and dog", "cat sand dog"]. 先用dp求得每个起点到终点是否符合word break 1中的条

Leetcode dfs Word Break II

Word Break II Total Accepted: 15138 Total Submissions: 92228My Submissions Given a string s and a dictionary of words dict, add spaces in s to construct a sentence where each word is a valid dictionary word. Return all such possible sentences. For ex

Leetcode dp Word Break

Word Break Total Accepted: 22281 Total Submissions: 105657My Submissions 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 = "leetcod

【leetcode】Word Break II

Given a string s and a dictionary of words dict, add spaces in s to construct a sentence where each word is a valid dictionary word. Return all such possible sentences. For example, givens = "catsanddog",dict = ["cat", "cats"