FilesExpand file tree

 master

/

wordBreak.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

34 lines (20 loc) · 987 Bytes

 master

/

wordBreak.java

Copy path

Top

File metadata and controls

• Code
• Blame

34 lines (20 loc) · 987 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

// 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. You may assume the dictionary does not contain duplicate words.

// For example, given

// s = "leetcode",

// dict = ["leet", "code"].

// Return true because "leetcode" can be segmented as "leet 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()];

}

}