博客域名:
http://www.xnerv.wang
原题页面: https://oj.leetcode.com/problems/combination-sum-ii/
题目类型:
难度评价:★
本文地址: http://blog.csdn.net/nerv3x3/article/details/39453251
A solution set is:
原题页面: https://oj.leetcode.com/problems/combination-sum-ii/
题目类型:
难度评价:★
本文地址: http://blog.csdn.net/nerv3x3/article/details/39453251
Given a collection of candidate numbers (C) and a target number (T), find all unique combinations inC where the candidate numbers sums to T.
Each number in C may only be used once in the combination.
Note:
- All numbers (including target) will be positive integers.
- Elements in a combination (a1, a2, … ,ak) must be in non-descending order. (ie, a1 ≤a2 ≤ … ≤ ak).
- The solution set must not contain duplicate combinations.
10,1,2,7,6,1,5
and target
8
,
A solution set is:
[1, 7]
[1, 2, 5]
[2, 6]
[1, 1, 6]
class Solution:
def __init__(self):
self.nums = None
self.len_nums = 0
self.total = 0
self.combinations = [ ]
def doCombinationSum(self, prefix, prefix_total, start, last, used):
if start >= self.len_nums:
return
num = self.nums[start]
result = True
if num != last or used: ###
if prefix_total + num == self.total:
new_prefix = prefix[:]
new_prefix.append(num)
self.combinations.append(new_prefix)
return
elif prefix_total + num < self.total:
new_prefix = prefix[:]
new_prefix.append(num)
self.doCombinationSum(new_prefix, prefix_total + num, start + 1, num, True)
self.doCombinationSum(new_prefix, prefix_total + num, start, num, True)
else:
return
if num != last: ###
self.doCombinationSum(prefix, prefix_total, start + 1, num, False)
return True
# @param candidates, a list of integers
# @param target, integer
# @return a list of lists of integers
def combinationSum(self, candidates, target):
self.nums = candidates
self.nums.sort()
self.len_nums = len(self.nums)
if 0 == self.len_nums:
return [ ]
self.total = target
self.doCombinationSum([ ], 0, 0, -1, True)
return self.combinations