leetcode:Word Break
来源:互联网 发布:java 选课系统 编辑:程序博客网 时间:2024/05/17 01:37
class Solution {public: bool wordBreak(string s, unordered_set<string> &dict) { int n = s.length(); if(n == 0) return true; bool * canBreak = new bool[n]; memset(canBreak,false, n*sizeof(bool)); for(int i = 0; i < n;i++) { if(dict.count(s.substr(0,i+1)) > 0) { canBreak[i] = true; continue; } for(int j = 0; j < i;j++) { if(canBreak[j] && dict.count(s.substr(j+1,i-j))>0) { canBreak[i]=true; break; } } } bool result = canBreak[n-1]; delete [] canBreak; return result; }};
0 0
- leetcode Word Break & Word Break ||
- Leetcode: Word Break
- [leetcode]Word Break
- [leetcode]Word Break II
- LeetCode:Word Break
- LeetCode:Word Break II
- Leetcode: Word Break II
- [LeetCode] Word Break
- [LeetCode] Word Break II
- LeetCode: Word Break
- leetcode之Word Break
- [LeetCode]Word Break II
- [LeetCode]Word Break
- leetcode-Word Break
- LeetCode 之 Word Break
- leetcode word break
- LeetCode | Word Break
- LeetCode | Word Break II
- Parrot源码分析之海贼王
- 【SNMP】SNMP RFC文档下载网址
- fork函数与子进程
- android 音乐播放器----歌词在线下载
- PHP无限级分类
- leetcode:Word Break
- 温习c++之类型。
- 母函数 入门 + 模板
- 版本控制工具Git详解(更新中)
- javabean中类存放问题
- 设计模式学习(一)---装饰着模式(Decorator)
- 再一次,HELLO WORLD.
- Ignatius and the Princess III(杭电1028)(母函数)
- 开始自己的博客之旅