LeetCode-46-Permutations(DFS)-Medium
来源:互联网 发布:30岁找不到女朋友 知乎 编辑:程序博客网 时间:2024/05/08 23:55
题意理解:
给定vector,其中的元素均为唯一的,求解vector中元素所有的排列方式;
题目分析:
典型的DFS
解题代码:
class Solution {private: vector<vector<int>> ans; void dfs(vector<int> &preAns, vector<int> &subNums){ if(subNums.size()==0){ ans.push_back(preAns); return; } int size=subNums.size(); for(int i=0; i<size; i++){ int n=subNums[i]; vector<int> tPreAns(preAns); tPreAns.push_back(n); vector<int> tSubNums(subNums); tSubNums.erase(find(tSubNums.begin(), tSubNums.end(),n)); dfs(tPreAns, tSubNums); } }public: vector<vector<int>> permute(vector<int>& nums) { vector<int> pre; dfs(pre, nums); return ans; }};
0 0
- LeetCode-46-Permutations(DFS)-Medium
- LeetCode #46 - Permutations - Medium
- 【Leetcode-Medium-46】Permutations
- LeetCode-47-Permutations II(DFS/剪枝)-Medium
- [Leetcode 46, Medium] Permutations I
- LeetCode 46. Permutations (Medium)
- Leetcode 46. Permutations (Medium) (cpp)
- Leetcode OJ 46. Permutations [Medium]
- Medium 46题 Permutations
- LeetCode 46. Permutations DFS
- 【Leetcode】46. Permutations【DFS】
- leetcode---permutations---dfs
- leetcode---permutations-ii---dfs
- Leetcode 47. Permutations II (Medium) (cpp)
- 【Leetcode】47. Permutations II 【DFS】
- [LeetCode]46. Permutations &&深搜DFS
- [LeetCode]Permutations(回溯&&DFS&&递归!!!!)
- [LeetCode]Permutations II(!!!!!DFS递归&&回溯)
- C语言,从升序方幂数列中求得具体项数的值的解法
- 机器学习之决策树
- java28.XML操作------DOM方式解析XML数据
- 【架构】架构没你想的那么难之三层架构
- 158_弹性碰撞 Physics Experiment (POJ No 3684)
- LeetCode-46-Permutations(DFS)-Medium
- web前端开发笔记
- Leetcode: Perfect Squares
- leetcode之Maximum Subarray
- 随笔
- 数据传递的几种方式:代理,通知,block,单例
- autocommit(自动提交) mysql
- Machine Learning Notes
- SQL学习(五)