//#############################################################################
int main(int argc, char * argv[]){
int sol,input;
cout << "Please choose solution:";
cin >> sol;
cout << endl << "Please input n:";
cin >> input;
cout << endl;
switch(sol){
case 1:
generateParenthesis(input);
cout << "Result:"<<endl;
for (vector<string>::iterator it = result.begin() ; it != result.end(); ++it)
cout << *it << endl;
break;
case 2:
Solution aa;
result = aa.generateParenthesis(input);
cout << "Result:"<<endl;
for (vector<string>::iterator it = result.begin() ; it != result.end(); ++it)
cout << *it << endl;
break;
case 3:
Solution2 bb;
result = bb.generateParenthesis(input);
cout << "Result:"<<endl;
for (vector<string>::iterator it = result.begin() ; it != result.end(); ++it)
cout << *it << endl;
break;
}
}
int main(){
vector<int> preorder{1, 2, 3, 4, 5, 6},
inorder{3, 2, 4, 1, 5, 6};
Solution2 s;
auto res = s.buildTree(preorder, inorder);
printTree(res);
return 0;
}
int main(){
Solution2 s;
auto res = s.combine(4,2);
for(auto it: res){
for(auto it2: it)
cout << it2 << " ";
cout << endl;
}
return 0;
}
int main()
{
Solution2 S;
R r;
r.a = 2;
string s1 = "aabcc",s2 = "dbbca", s3 = "aadbbbaccc";
cout << S.isInterleave(s1,s2,s3);
system("pause");
return 0;
}
void test2() {
cout << "test2" << endl;
string s = "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaab";
string d[] = {"a","aa","aaa","aaaa","aaaaa","aaaaaa","aaaaaaa","aaaaaaaa","aaaaaaaaa","aaaaaaaaaa"};
set<string> dict;
for (int i = 0; i < 10; ++ i) { dict.insert(d[i]); }
Solution2 so;
vector<string> ans = so.wordBreak(s, dict);
dumpVec(ans);
}
int main(){
Solution2 sol;
TreeNode *root = new TreeNode(1);
root->right = new TreeNode(2);
(root->right)->left = new TreeNode(3);
vector<int> out = sol.inorderTraversal(root);
for(int i=0; i<out.size();i++){
cout << out[i] << " ";
}
cout <<endl;
return 1;
}
int main()
{
Solution2 s;
vector<int> v1 = { 10 }, v2 = { 2, 4, 6, 7, 8 }, v3 = {6, 7, 8,9,10};
auto l1 = lc_createlist(v1, true), l2 = lc_createlist(v2, true), l3 = lc_createlist(v3);
vector<ListNode *> lists = { l1, l2};
auto l4 = s.mergeKLists(lists);
lc_printlist(l4);
lc_destroylist(l4);
system("pause");
return 0;
}
int main()
{
string s = ")(((()(y((u()(z()()";
//string s = "i))((()(n(())i((((";
Solution2 solu;
vector<string> re = solu.removeInvalidParentheses(s);
cout << endl << "----------------------------" << endl;
for (auto elems : re)
{
cout << elems << endl;
}
//cout << solu.validParentheses(s) << endl;
}
int main(){
vector<vector<char> >board;
string line[9] = {"..9748...","7........",".2.1.9...","..7...24.",".64.1.59.",".98...3..","...8.3.2.","........6","...2759.."};
for(int i = 0;i < 9;i++){
vector<char> tmp;
for(int j = 0;j < 9;j++)
tmp.push_back(line[i][j]);
board.push_back(tmp);
}
Solution2* s = new Solution2();
s->solveSudoku(board);
return 0;
}
int main(int argc, char *argv[])
{
string a = "aab";
string b = "*?*a";
Solution2 solution;
if (solution.isMatch(a.c_str(), b.c_str()))
{
printf("match\n");
}
return 0;
}
int main() {
Solution2 s;
vector<int>v1 = {0,1};
vector<int>v2 = {0,0};
vector<int>v3 = {0,1};
vector<int>v4 = {1,0};
vector<int>v5 = {1,0};
vector<vector<int>>A{v1,v2,v3};
vector<vector<int>>B{v4,v5};
s.multiply(A, B);
return 0;
}
int main() {
Solution2 s;
Examples eg;
vector<int> a, b;
a.push_back(1);
a.push_back(2);
a.push_back(3);
b.push_back(2);
b.push_back(3);
b.push_back(4);
TreeNode* res = s.buildTree(a, b);
if (res)
cout << res->val << endl;
}
int main(int argc,const char *argv[]){
Solution2 s;
cout<<s.shortestPalindrome("babbbabbaba")<<endl;
return 0;
}
int main()
{
Solution2 sl;
string s = sl.shortestPalindrome("aaacecaaa");
}
int main(int argc, const char * argv[]) {
Solution2 test;
cout<<test.countPrimes(1500000)<<endl;
std::cout << "All is done!\n";
return 0;
}
int main()
{
string s = "aba";
Solution2 sl;
cout << sl.longestPalindrome(s) << endl;
}
