Word Break -- leetcode

Word Break -- leetcode

 

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

Basic Ideas:

Dynamic Planning.

The array dp [I] indicates whether words can be separated before the I character. I starts from 0.

Known dp [0 .. i], for dp [I + 1], you need to try again, s [k .. i], 0 <= k <= I.

 

The actual execution time on leetcode is 12 ms.

 

 

Class Solution {public: bool wordBreak (string s, unordered_set

 
  
& WordDict) {vector

  
   
Dp (s. size () + 1); dp [0] = true; for (int I = 1; I <= s. size (); I ++) {for (int j = 0; j