Douglas_LT的博客

每日一题ing，今天是个medium题300. Longest Increasing Subsequence class Solution { public: vector<vector<int>> permute(vector<int>& nums) { int len=nums.size(); vector<vector<int>> ret; dfs(nums,ret,0,len)

每日一题ing，今天是个medium题322. Coin Change class Solution { public: vector<vector<int>> permute(vector<int>& nums) { int len=nums.size(); vector<vector<int>> ret; dfs(nums,ret,0,len); return re