yangkaiming2537的博客

第一种方法，暴力法递归。 class Solution { public: int DFS(vector<vector<int>>& triangle, int i, int j) { if (i == triangle.size()-1) return triangle[i][j];//一开始写成了triangle[0][0] //画递归树调试递...

class Solution { private: vector<vector<int>>res; public: void DFS(int n, int k, int start, vector<int>& tem) { if (tem.size() == k) { res.push_back(tem); return; ...

#include<iostream> #include<vector> #include<algorithm> using namespace std; //全排列2 class Solution { public: void DFS(vector<vector<int>>& res, vector<int>...

#include<iostream> #include<vector> using namespace std; //全排列 class Solution { public: void DFS(vector<vector<int>>& res, vector<int>& tem, vector<int>n...

#include<iostream> #include<vector> using namespace std; class Solution { public: //判断某字符是否为回文字符串 bool isPartition(string str) { int leftboundary = str.size() / 2; for (int i = 0; ...

#include<iostream> #include<vector> using namespace std; class Solution { public: void DFS(vector<string>& res,string digits,int k,int size,string one, vector<string>...