码迷,mamicode.com
首页 >  
搜索关键字:partitioning    ( 428个结果
Palindrome Partitioning--LeetCode
题目: Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s. For example, given s = "aab", Return ...
分类:其他好文   时间:2015-04-11 16:22:37    阅读次数:129
Leetcode:Palindrome Partitioning
Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s. For example, given s = "aab", Return [ ["aa","...
分类:其他好文   时间:2015-04-08 15:06:58    阅读次数:79
LeetCode --- 87. Scramble String
题目链接:Scramble String Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively. Below is one possible representation of s1 = "great": ...
分类:其他好文   时间:2015-04-07 23:33:46    阅读次数:556
Palindrome Partitioning II
Given a strings, partitionssuch that every substring of the partition is a palindrome.Return the minimum cuts needed for a palindrome partitioning ofs...
分类:其他好文   时间:2015-04-07 17:01:07    阅读次数:160
Palindrome Partitioning
https://leetcode.com/problems/palindrome-partitioning/Given a strings, partitionssuch that every substring of the partition is a palindrome.Return all...
分类:其他好文   时间:2015-04-06 15:23:49    阅读次数:112
[LeetCode] Palindrome Partitioning II
Palindrome Partitioning II   Given a string s, partition s such that every substring of the partition is a palindrome. Return the minimum cuts needed for a palindrome partitioning of s. ...
分类:其他好文   时间:2015-04-05 22:00:12    阅读次数:127
Palindrome Partitioning
这道题采用动态规划的思想。参考了别人的做法。class Solution{public: vector> result; vector> partition(string s) { int len = s.length(); vector soloresult; if(s.leng...
分类:其他好文   时间:2015-04-05 18:47:49    阅读次数:141
Palindrome Partitioning——LeetCode
Given a strings, partitionssuch that every substring of the partition is a palindrome.Return all possible palindrome partitioning ofs.For example, giv...
分类:其他好文   时间:2015-04-05 15:53:15    阅读次数:107
UVa 11584 Partitioning by Palindromes【DP】
题意:给出一个字符串,问最少能够划分成多少个回文串dp[i]表示以第i个字母结束最少能够划分成的回文串的个数dp[i]=min(dp[i],dp[j]+1)(如果从第j个字母到第i个字母是回文串)想不明白的还是初始化初始化为:dp[i]=i+1,后来= =,发现应该是这样的从第1个字母到第i个字母最...
分类:其他好文   时间:2015-03-30 01:29:17    阅读次数:140
【软件测试】等价类划分(Equivalence partitioning)
等价类划分【Equivalence partitioning】也叫做ECP [1]是一种将软件单元的输入数据转换成从该试验的情况下可以推导等效数据的分区的软件测试技术。是典型的黑盒测试内容。原理上每一个测试例子最终应该完成对所有情况的测试,这种测试尝试定义发现错误的方法,从而用来减少用于测试的必要测...
分类:其他好文   时间:2015-03-29 17:49:27    阅读次数:168
428条   上一页 1 ... 23 24 25 26 27 ... 43 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!