moonlightshadow123
6/25/2017 - 2:24 PM

139. Word Break

  1. Word Break
solution.py
content_copyfile_download
_
139-Word-Break.md
content_copyfile_download
  • Rendered
  • Source

https://leetcode.com/problems/word-break/#/description

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