[Leetcode]Palindrome Partitioning
来源:互联网 发布:包装设计用什么软件 编辑:程序博客网 时间:2024/06/03 10:20
方法:回溯
解空间
class Solution {public: vector<vector<string>> partition(string s) { // Start typing your C/C++ solution below // DO NOT write int main() function ret.clear(); vector<string> ans; partition(s, 0, ans); return ret; } void partition(string &s, int begin, vector<string> &ans){ if(begin == s.size()) { ret.push_back(ans); return; } for(int i = begin; i < s.size(); ++i) { if(isPalindrome(s, begin, i)) { ans.push_back(s.substr(begin, i-begin+1)); partition(s, i+1, ans); ans.pop_back(); } } } bool isPalindrome(string s, int i, int j) { while(i < j) { if(s[i] != s[j]) return false; ++i, --j; } return true; }private: vector<vector<string>> ret;};
- 【leetcode】Palindrome Partitioning && Palindrome Partitioning II
- [LeetCode] Palindrome Partitioning && Palindrome Partitioning II
- LeetCode Palindrome Partitioning I&&Palindrome Partitioning II
- LeetCode Palindrome Partitioning, Palindrome Partitioning II
- [Leetcode][python]Palindrome Partitioning/Palindrome Partitioning II
- Leetcode:Palindrome Partitioning & Palindrome Partitioning II
- LeetCode: Palindrome Partitioning
- LeetCode : Palindrome Partitioning II
- [leetcode] Palindrome Partitioning II
- leetcode 122: Palindrome Partitioning
- leetcode:Palindrome Partitioning II
- leetcode:Palindrome Partitioning
- 【leetcode】Palindrome Partitioning
- 【leetcode】Palindrome Partitioning II
- leetcode - Palindrome Partitioning II
- Leetcode - Palindrome Partitioning
- LeetCode之Palindrome Partitioning
- [LeetCode]Palindrome Partitioning
- Android中级之网络数据解析一之xml解析
- (十)装饰器模式详解(与IO不解的情缘)
- mysql 密码修改
- 黑马程序员:DVD管理系统项目之一--核心集合的选择问题
- 经验
- [Leetcode]Palindrome Partitioning
- 算法导论-第11章
- OnClientClick用法 单击服务器 button 前先调用 JS 验证剩余字数,超出返回,不执行后台
- IE8兼容模式与非兼容式的Object元素新发现
- 个人说说为什么线程之间的数据为什么要用委托传递
- 《设计模式》笔记: 访问者模式
- <c:if test="${fn:contains(name, searchString)}">
- Thinking in C++: 面向对象编程要点
- HDU 1210 Eddy's 洗牌问题 数论