C++暴力递归相关题目
#include<iostream>
#include<vector>
#include<string>
#include<list>
#include<algorithm>
#include<stack>
using namespace std;
void func(int i, string start, string end, string other)
{
if (i == 1)
{
cout << "Move 1 from" << start << "to" << end << endl;
}
else
{
func(i - 1, start, other, end);
cout << "Move" << i << "from" << start << "to" << end << endl;
func(i - 1, other, end, start);
}
}
void hanoi(int n)
{
if (n > 0)
{
func(n, "左", "右", "中");
}
}
void process(string str, int i)
{
if (i == str.length())
{
cout << str << endl;
return;
}
process(str, i + 1);
char tmp = str[i];
str[i] = NULL;
process(str, i + 1);
str[i] = tmp;
}
void printAllSubsquence(string str)
{
process(str, 0);
}
void swap(string str, int i, int j)
{
char ch = str[i];
str[i] = str[j];
str[j] = ch;
}
void process(string str, int i, list<string>res)
{
if (i == str.length())
{
res.push_back(str);
}
bool visit[26]{};
for (int j =i;j<str.size();j++)
{
if (!visit[str[j]] - 'a')
{
visit[str[j] - 'a'] = true;
swap(str, i, j);
process(str, i + 1, res);
swap(str, i, j);
}
}
}
list<string> printFullArry(string str)
{
list<string>res;
process(str, 0, res);
return res;
}
int f(vector<int>& nums, int i, int j);
int s(vector<int>& nums, int i, int j)
{
if (i == j)
{
return 0;
}
return min(f(nums, i + 1, j), f(nums, i, j - 1));
}
int f(vector<int>& nums, int i, int j)
{
if (i == j)
{
return nums[i];
}
return max(nums[i] + s(nums, i + 1, j), nums[j] + s(nums, i, j - 1));
}
int win1(vector<int>&nums)
{
if (nums.size()==0)
{
return 0;
}
return max(f(nums, 0, nums.size() - 1), s(nums, 0, nums.size() - 1));
}
int win2(vector<int>& nums)
{
if (nums.size() == 0)
{
return 0;
}
}
int f(stack<int>stc)
{
int result = stc.top();
stc.pop();
if (stc.empty())
{
return result;
}
int last = f(stc);
stc.push(result);
return last;
}
void reverse(stack<int>stc)
{
if (stc.empty())
{
return;
}
int i = f(stc);
reverse(stc);
stc.push(i);
}
int process(vector<char>str, int i)
{
if (i == str.size())
{
return 1;
}
if (str[i] == '0')
{
return 0;
}
if (str[i] == '1')
{
int res = process(str, i + 1);
if (i + 1 < str.size())
{
res += process(str, i + 2);
}
return res;
}
if (str[i] == '2')
{
int res = process(str, i + 1);
if (i + 1 < str.size() && (str[i + 1] >= '0' && str[i + 1] <= '6'))
{
res += process(str, i + 2);
}
return res;
}
return process(str, i + 1);
}
int process1(vector<int>& weights, vector<int>values, int i, int alreadyweight, int bag)
{
if (alreadyweight > bag)
{
return 0;
}
if (i == weights.size())
{
return 0;
}
return max(process1(weights, values, i + 1, alreadyweight, bag), values[i]+process1(weights, values, i + 1, alreadyweight + weights[i], bag));
}
int main()
{
system("pause");
return 0;
}