word-break
来源:互联网 发布:佰斯纳特 淘宝 编辑:程序博客网 时间:2024/05/17 09:32
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”.
这道题目可以利用动态规划的方法来做,首先设置dp[i]为以i结尾的是否能被字典分割. dp[i]和dp[j]和i-j之间的字符是否在字典中有关.
class Solution {public: bool wordBreak(string s, unordered_set<string> &dict) { const unsigned int len = s.size(); if (len == 0) return false; char* dp = new char[len]; //保存字符0-i之间是否能被字典分割. memset(dp, 0, sizeof(*dp)*len); int maxsize = 0; for (auto iter = dict.cbegin(); iter != dict.end(); ++iter)//计算字典中的最长字符串可以减少判断的次数 { if (iter->size() > maxsize) maxsize = iter->size(); } if (dict.find(s.substr(0, 1)) != dict.end()) //设置dp[0] { dp[0] = 1; } for (int i = 1; i != len; ++i) { if (i+1<= maxsize&&dict.find(s.substr(0, i + 1)) != dict.cend()) //判断是否从0-i在字典中,当然长度要小于字典中的最大长度. { dp[i] = 1; continue; } for (int j = i - 1; j >= 0 && (i - j) <= maxsize; --j) //判断dp[j]为真和i-j在字典中是否同时成立 { if (dp[j] == 1 && dict.find(s.substr(j+1, i - j)) != dict.cend()){ dp[i] = 1; break; } } } bool res=dp[len-1]; delete[] dp; //释放空间 return res; }};
0 0
- Word-break:break-word
- Word Break && Word Break ||
- word-break
- Word Break
- Word Break
- Word Break
- word break
- Word Break
- Word Break
- Word Break
- Word Break
- Word Break
- Word Break
- Word Break
- Word Break
- Word Break
- Word Break
- Word Break
- Google VR Sample 遇到 Gradle sync failed 的解决方案
- openVR之十二大驱动接口
- 四种常用的排序算法
- 学术笔记·人口老龄化与认识反思·十四
- 数据结构复习之序
- word-break
- 一元多项式的相加
- 宏观介绍React
- Matlab-奈奎斯特滤波器实现《二》
- Maven的使用
- jquery插件开发学习笔记(七)——页面平滑滚动改进
- HTML学习笔记2
- 【js实现】在排序数组中,找出给定数字的出现次数,比如 [1, 2, 2, 2, 3] 中2的出现次数是3次
- IT健康小贴士