(M)Backtracking:46. Permutations
来源:互联网 发布:慈溪行知职高在哪 编辑:程序博客网 时间:2024/06/05 00:59
输出给定数组的所有全排列。
这道题还是比较简单的回溯。根据上一篇216Combination Sum3的经验,这次是要输出给定数组的所有全排列,要用到一个visit数组来标识哪些数现在是可以选的。
class Solution {public: vector<vector<int>> permute(vector<int>& nums) { vector<vector<int>> res; vector<int> visit(nums.size(), 0); vector<int> r; backtracking(nums, visit, r, res); return res; } void backtracking(vector<int>& nums, vector<int>& visit, vector<int>& r, vector<vector<int>>& res) { if(r.size() == nums.size()) { res.push_back(r); return; } for(int i = 0; i < nums.size(); ++i) { if(visit[i] == 0) { r.push_back(nums[i]); visit[i] = 1; backtracking(nums, visit, r, res); r.erase(--r.end()); visit[i] = 0; } } } };
阅读全文
0 0
- (M)Backtracking:46. Permutations
- (M)Backtracking:47. Permutations II
- 【Leetcode】Permutations (Backtracking)
- 【Leetcode】Permutations II (Backtracking)
- (M)Backtracking:78. Subsets
- (M)Backtracking:77. Combinations
- (M)Backtracking:526. Beautiful Arrangement
- (M)Backtracking:22. Generate Parentheses
- (M)Backtracking:39. Combination Sum
- (M)Backtracking:90. Subsets II
- (M)Backtracking:131. Palindrome Partitioning
- (M)Backtracking:60. Permutation Sequence
- (M)Backtracking:79. Word Search
- LeetCode *** 47. Permutations II (Backtracking )
- (M)Backtracking:216. Combination Sum III
- (M)Backtracking:40. Combination Sum II
- (M)Backtracking: 93. Restore IP Addresses
- backtracking
- vs2013 无法打开 源 文件 "SDKDDKVer.h"
- 项目中ztree树在tomcat中不出现问题
- java与mqtt的那些事(二)
- Android匿名共享内存(Ashmem)原理
- linux下修改文件最大描述符
- (M)Backtracking:46. Permutations
- eclipse安装和中文汉化,以及配置
- 【Tensorflow】 第四节 环境搭建二 Ubuntu16.04LTS安装JDK8和PyCharm IDE
- Go时间戳和日期字符串的相互转换
- floodlight之forwarding模块源码解析
- 基于软件的负载均衡(Nginx与ZooKeeper解析)
- 图片之scaleType属性
- 生命周期
- xunsearch创建索引