CODE 87: Permutations
来源:互联网 发布:淘宝上怎么复制链接 编辑:程序博客网 时间:2024/04/29 06:55
Given a collection of numbers, return all possible permutations.
For example,[1,2,3]
have the following permutations:[1,2,3]
, [1,3,2]
, [2,1,3]
, [2,3,1]
, [3,1,2]
, and [3,2,1]
.
public ArrayList<ArrayList<Integer>> permute(int[] num) {// Note: The Solution object is instantiated only once and is reused by// each test case.ArrayList<Integer> numbers = new ArrayList<Integer>();for (int n : num) {numbers.add(n);}return dfs(numbers);}ArrayList<ArrayList<Integer>> dfs(ArrayList<Integer> numbers) {if (numbers.size() <= 1) {ArrayList<ArrayList<Integer>> results = new ArrayList<ArrayList<Integer>>();ArrayList<Integer> result = new ArrayList<Integer>(numbers);results.add(result);return results;}ArrayList<ArrayList<Integer>> results = new ArrayList<ArrayList<Integer>>();ArrayList<Integer> newNumbers = new ArrayList<Integer>(numbers);for (int i = 0; i < numbers.size(); i++) {Integer number = numbers.get(i);newNumbers.remove(number);ArrayList<ArrayList<Integer>> res = dfs(newNumbers);for (ArrayList<Integer> re : res) {re.add(0, number);results.add(re);}newNumbers.add(number);}return results;}
- CODE 87: Permutations
- CODE 86: Permutations II
- [leet code] Permutations
- [leet code] Permutations II
- Permutations(Leet Code)
- leetcode 日经贴,Cpp code -Permutations
- leetcode 日经贴,Cpp code -Permutations II
- Permutations
- Permutations
- Permutations
- Permutations
- Permutations
- Permutations
- Permutations
- Permutations
- Permutations
- Permutations
- Permutations
- 排序0-n^k-1范围内的n个数,要求时间复杂度为线性
- NYOJ练习题 删除元素(二分查找)
- 给菜鸟级Android程序员的一封信
- 08-MyBatis_与spring的整合之初步
- android 9 patch
- CODE 87: Permutations
- C++0x新特性:decltype类型指示符与返回类型后置语法
- 谈套接字的理解
- django 上传文件
- shell 学习三之特殊 meta
- 学术搜索-如何查找计算机科学类学术论文
- E-R图转换成关系模式
- CSDN 真垃圾,奶奶的,下载个资源,登录了也提示下载请登录,shit
- Magento Core: (FIX) Admin slow loading on product save