![](https://img-blog.csdnimg.cn/20201014180756780.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
图
图
三块桌布
这个作者很懒,什么都没留下…
展开
-
lc47.全排列II【数列含有相同数字,回溯法DFS+剪枝(剪掉相同数字相邻的排列)】
视频题解说得很清楚https://leetcode-cn.com/problems/permutations-ii/solution/hui-su-suan-fa-python-dai-ma-java-dai-ma-by-liwe-2/(我基本上就是把java翻译成c++)class Solution {public: vector<vector<int>> permuteUnique(vector<int>& nums) { ...原创 2020-09-18 21:09:06 · 183 阅读 · 0 评论 -
lc46.全排列【回溯法,DFS】
看了这个题解,把java翻译成了c++。回溯法本质上就是DFS。class Solution {public: vector<vector<int>> permute(vector<int>& nums) { vector<vector<int>> re; int len=nums.size(); if(len==0) return re; bool us...原创 2020-09-18 18:53:47 · 181 阅读 · 0 评论 -
Saving James Bond - Easy Version【DFS】
7-10Saving James Bond - Easy Version(25分)This time let us consider the situation in the movie "Live and Let Die" in which James Bond, the world's most famous spy, was captured by a group of drug dealers. He was sent to a small piece of land at the cent..原创 2020-09-14 15:53:25 · 133 阅读 · 0 评论