Lintcode: k Sum II

Given n unique integers, number k (1<=k<=n)  and target. Find all possible k integers where their sum is target.Example
Given [1,2,3,4], k=2, target=5, [1,4] and [2,3] are possible solutions.

这道题同Combination Sum II

 1 public class Solution {
 2     /**
 3      * @param A: an integer array.
 4      * @param k: a positive integer (k <= length(A))
 5      * @param target: a integer
 6      * @return a list of lists of integer
 7      */
 8     public ArrayList<ArrayList<Integer>> kSumII(int A[], int k, int target) {
 9         // write your code here
10         ArrayList<ArrayList<Integer>> res = new ArrayList<ArrayList<Integer>>();
11         ArrayList<Integer> path = new ArrayList<Integer>();
12         helper(res, path, A, k, target, 0);
13         return res;
14     }
15
16     public void helper(ArrayList<ArrayList<Integer>> res, ArrayList<Integer> path, int[] A, int k, int remain, int index) {
17         if (path.size() == k) {
18             if (remain == 0) {
19                 res.add(new ArrayList<Integer>(path));
20             }
21             return;
22         }
23         for (int i=index; i<A.length; i++) {
24             path.add(A[i]);
25             helper(res, path, A, k, remain-A[i], i+1);
26             path.remove(path.size()-1);
27         }
28     }
29 }

转载于:https://www.cnblogs.com/EdwardLiu/p/4314783.html

Lintcode: k Sum II相关推荐

lintcode: k Sum 解题报告
K SUM My Submissions http://www.lintcode.com/en/problem/k-sum/ 题目来自九章算法 13% Accepted Given n distinc ...
[LintCode]k Sum
题目 Given n distinct positive integers, integer k (k <= n) and a number target. Find k numbers whe ...
LeetCode 167. Two Sum II - Input array is sorted--Python解法
题目地址:Two Sum II - Input array is sorted - LeetCode Given an array of integers that is already sorted ...
Digit Sum II（ ABC044ARC060）
问题 G: Digit Sum II 时间限制: 1 Sec 内存限制: 128 MB 提交: 36 解决: 11 [提交][状态][讨论版][命题人:admin] 题目描述 For intege ...
[LeetCode]113.Path Sum II
[题目] Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the giv ...
LeetCode_Path Sum II
一.题目 Path Sum II Total Accepted: 46778 Total Submissions: 175830My Submissions Given a binary tree a ...
113. Path Sum II
/** 113. Path Sum II * 11.18 By Mingyang* 典型的backtracking,不过注意,这里的值可能是负数,所以不能用sum小于0来做任何判断* 1.长度标准:无 ...
leetcode 112. Path Sum, 113. Path Sum II | 112,113. 路径总和 I, II（Java）
题目 https://leetcode.com/problems/path-sum/ https://leetcode.com/problems/path-sum-ii/ 题解简单的遍历二叉树,不解 ...
2019-ACM-ICPC-南京区网络赛-E. K Sum（莫比乌斯反演 + 杜教筛）
K Sum 推式子 Fn(k)=∑l1=1n∑l2=1n⋯∑lk=1n(gcd(l1,l2,-,lk))2=∑d=1nd2∑l1=1nd∑l2=1nd⋯∑lk=1nd(gcd(l1,l2,-,lk)= ...

Lintcode: k Sum II

Lintcode: k Sum II相关推荐

最新文章

热门文章