问题描述:
Give a string, you can choose to split the string after one character or two adjacent characters, and make the string to be composed of only one character or two characters. Output all possible results.
样例
Given the string "123"
return [["1","2","3"],["12","3"],["1","23"]]
将字符串一个或两个的情况作为出口,当大于两个时,进行递归。
代码:
class Solution {
public:
/*
* @param : a string to be split
* @return: all possible split string array
*/
vector<vector<string> > digui(string s)
{ vector<string> v1;
vector<string> v2;
vector<vector<string>> v3;
if(s.size()==0)
{
v3.push_back(v2);
return v3;
}
if(s.size()<=2)
{
v2.push_back(s);
v3.push_back(v2);
if(s.size()==2)
{
v1.push_back(s.substr(0,1));//截字符串(起始,数目)
v1.push_back(s.substr(1,1));
v3.push_back(v1);
}
return v3;
}
if(s.size()>2)
{//截一个
string a=s.substr(0,1);
string b=s.substr(1);//截字符串(起始),截到末尾
vector<vector<string>> B=digui(b);//得到b串分解后得B
for(int i=0;i<B.size();i++)
B[i].insert(B[i].begin(),a);//insert(要插入位置,插入元素)
//截两个
string c=s.substr(0,2);
string d=s.substr(2);
vector<vector<string> > C=digui(d);
for(int j=0;j<C.size();j++)
C[j].insert(C[j].begin(),c);
B.insert(B.end(),C.begin(),C.end());
return B;
}
}
vector<vector<string>> splitString(string& s) {
// write your code here
return digui(s);
}
};
感悟:
对于vector用法的了解加深,注意substr()函数和insert()函数的用法。