LeetCode - Combinations
来源:互联网 发布:单片机应用技术 编辑:程序博客网 时间:2024/05/01 06:59
Given two integers n and k, return all possible combinations of k numbers out of 1 ... n.
For example,
If n = 4 and k = 2, a solution is:
[ [2,4], [3,4], [2,3], [1,2], [1,3], [1,4],]
这道题使用了深度优先遍历的算法。
void search(Node root){ if(root == null) return; visit(root); root.visited = true; foreach(Node n in root.adjacent){ if(n.visited == false){ search(n); } }}
我的代码在自己的eclipse上跑LeetCode的用例结果都正确,但是在LeetCode上,同样的样例不知道为什么会显示和我本地不一样的结果。这个问题我是第二次碰到了,不知道如何解决。下面是我自己测试没有问题的代码。
public class Solution { static ArrayList<ArrayList<Integer>> result = new ArrayList<ArrayList<Integer>>();static ArrayList<Integer> r = new ArrayList<Integer>();static int count = 0;public ArrayList<ArrayList<Integer>> search(int n,int k, int number){r.add(number);count++;if(count == k){ArrayList<Integer> m = new ArrayList<Integer>();for (Integer ii : r){m.add(ii);}result.add(m);r.remove(count - 1);count --;}else{for(int i = number + 1; i <= n; i ++){search(n,k,i);}}return result;} public ArrayList<ArrayList<Integer>> combine(int n, int k) { for(int q = 1; q <= n - k + 1; q++) { r = new ArrayList<Integer>(); count = 0; search(n,k,q); } return result; }}
0 0
- LeetCode: Combinations
- LeetCode: Combinations
- LeetCode Combinations
- [Leetcode] Combinations
- [LeetCode] Combinations
- Leetcode: Combinations
- LeetCode Combinations
- [Leetcode] Combinations
- [Leetcode] Combinations
- [leetcode] Combinations
- [LeetCode]Combinations
- [leetcode]Combinations
- LeetCode-Combinations
- [leetcode] Combinations
- LeetCode - Combinations
- 【Leetcode】Combinations
- Leetcode: Combinations
- 【leetcode】Combinations
- Anagrams
- sdut2125 串结构练习——字符串匹配(strstr求子串)
- CF 219D 树形dp
- [leet code] Insertion Sort List
- Two Sum
- LeetCode - Combinations
- String to Integer
- 3Sum
- Valid Parentheses
- Merge Two Sorted List
- Implement strStr()
- 安装pvfs2
- Pow(x,n)
- Lesson 2: Udacity Intro to Parallel Programming