首页 > itarticle > [leetcode] problem 139 – word break

[leetcode] problem 139 – word break

admin 11月 13, 2020 0

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.

Note

  • The same word in the dictionary may be reused multiple times in the segmentation.
  • You may assume the dictionary does not contain duplicate words.

Example

No.1

Input: s = “leetcode”, wordDict = [“leet”, “code”]

Output: true

Explanation: Return true because “leetcode” can be segmented as “leet code”.

No.2

Input: s = “applepenapple”, wordDict = [“apple”, “pen”]

Output: true

Explanation: Return true because “applepenapple” can be segmented as “apple pen apple”.
Note that you are allowed to reuse a dictionary word.

No.3

Input: s = “catsandog”, wordDict = [“cats”, “dog”, “sand”, “and”, “cat”]

Output: false

Code

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
 

public boolean (String s, List<String> wordDict) {
    Set<String> dict = new HashSet<>();
    boolean[] dp = new boolean[s.length() + 1];

    for (String word : wordDict)
        dict.add(word);

    dp[0] = true;

    for (int i = 0; i < dp.length; i++) {
        for (int j = 0; j < i; j++) {
            if (dp[j] && dict.contains(s.substring(j, i))) {
                dp[i] = true;
                break;
            }
        }
    }

    return dp[dp.length - 1];
}
微海报分享

近期文章

近期评论

标签

热门

文章归档

分类目录

功能