摘要: ``` class Solution { public: unordered_map cnt; vector> res; vector path; vector> subsetsWithDup(vector& nums) { for(auto i:nums) cnt[i]++; dfs(-10);/ 阅读全文
posted @ 2023-06-07 21:04 穿过雾的阴霾 阅读(8) 评论(0) 推荐(0)
摘要: ``` class Solution { public: vector> res; vector> combinationSum2(vector& candidates, int target) { sort(candidates.begin(),candidates.end()); dfs(can 阅读全文
posted @ 2023-06-07 20:37 穿过雾的阴霾 阅读(8) 评论(0) 推荐(0)
摘要: ``` class Solution { public: vector> res; vector> combinationSum(vector& candidates, int target) { dfs(candidates,0,target); return res; } vector path 阅读全文
posted @ 2023-06-07 20:09 穿过雾的阴霾 阅读(10) 评论(0) 推荐(0)