Leetcode Word Break
2014-05-28 21:46
190 查看
动态规划
使用数组flag[i] 保存字符串0~i是否满足存在在dict里
使用数组flag[i] 保存字符串0~i是否满足存在在dict里
public class Solution { public boolean wordBreak(String s, Set<String> dict) { if (s == null) return false; boolean flag[] = new boolean[s.length() + 1]; flag[0] = true; for (int i = 1; i <= s.length(); i++) { for (String temp : dict) { int length = temp.length(); if (length > i) { flag[i] = false; continue; } if (s.substring(i - length, i).equals(temp) && flag[i - length]) { flag[i] = true; break; } flag[i] = false; } } return flag[s.length()]; } }
相关文章推荐
- leetcode -- word break II
- leetCode Word Break解题分享
- leetcode Word Break II
- 【LeetCode】WordBreak动规解法
- leetCode_Word BreakII
- Leetcode: Word Break II
- LeetCode 140. Word Break II
- 【LeetCode】140. Word Break II
- leetcode[140] Word Break II
- Leetcode 之 Word Break1 和 Word Break2
- LeetCode ||& Word Break && Word Break II(转)——动态规划
- LeetCode Word Break II
- [Leetcode][JAVA] Word Break II
- Leetcode在线编程word-break
- [LeetCode] - Word Break II
- [leetcode-140]word breakII(java)
- LeetCode Word Break (dp)
- LeetCode练习-动态规划算法-word-break
- leetcode: Word Break 纪念又一次死在动态规划上