因每天学习而伟大

// 栈、队列、堆一些题目和算法实现/****************************************************  函数功能： 使用队列实现栈的push,pop,top,empty操作*  参数说明**  日期：2018-06-10-09.31***************************************************/class MySta...

#include <iostream>#include <vector>#include <algorithm>using namespace std;struct ListNode{    int val;    ListNode* next;    ListNode(int x):val(x),next(NULL){}};bool cmp1(const Li...

#include <iostream>#include <vector>#include <set>#include <algorithm>using namespace std;void generate(int i,vector<int>& nums,vector<int>& item,vector&amp

#include <iostream>#include <vector>#include <algorithm>using namespace std;class Solution{public:    /***************************************************    *  函数功能：爬楼梯    *  参数说明  ...

#include <iostream>#include <vector>#include <map>#include <algorithm>#include <stack>#include <bitset>#include <string>using namespace std;int g_hasp_map[1&a

#include <iostream>#include <vector>#include <map>#include <algorithm>#include <stack>#include <bitset>#include <string>using namespace std;int g_hasp_map[1&a

#include <iostream>#include <vector>#include <queue>#include <map>#include <set>#include <unordered_set>#include <algorithm>using namespace std;bool cmp(int a

#include <iostream>#include <vector>#include <queue>using namespace std;struct TreeNode{    int val;    TreeNode* left,*right;    TreeNode(int x):val(x),left(NULL),right(NU...

31. Next Permutation Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.If such arrangement is not possible, it must rearrange it...