139 LeetCode Java: Word Break – Medium | cheonhyangzhang's programming
139 LeetCode Java: Word Break – Medium
Leave a reply
Problem:
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".
Thoughts:
We could use a dynamic programing approach for this problem.
A[i] stands for for the substring [0, i], if it is a valid word break string.
A[i] = A[j] && dict.contains(substring(j+1, i))
Read full article from 139 LeetCode Java: Word Break – Medium | cheonhyangzhang's programming
