#!/usr/bin/env python
# -*- coding: utf-8 -*-
# @Time    : 2020/4/22 22:06
# @Author  : Fhh
# @File    : 40.py
# Good good study,day day up!
"""给定一个数组 candidates 和一个目标数 target ，找出 candidates 中所有可以使数字和为 target 的组合。
candidates 中的每个数字在每个组合中只能使用一次。
说明：
所有数字（包括目标数）都是正整数。
解集不能包含重复的组合。 
示例 1:
输入: candidates = [10,1,2,7,6,1,5], target = 8,
所求解集为:
[
  [1, 7],
  [1, 2, 5],
  [2, 6],
  [1, 1, 6]
]
示例 2:
输入: candidates = [2,5,2,1,2], target = 5,
所求解集为:
[
  [1,2,2],
  [5]
]
"""
from typing import List


class Solution:
    def combinationSum2(self, candidates: List[int], target: int) -> List[List[int]]:

        def sumarr(arr, nums):
            sum = 0
            for i in arr:
                sum += nums[i]
            return sum

        res = []

        def func(tmp, nums, target):
            for i in range(len(nums)):
                if not tmp or i > tmp[-1]:
                    if sumarr(tmp + [i], nums) == target:
                        res.append(tmp + [i])
                    elif sumarr(tmp + [i], nums) > target:
                        break
                    else:
                        func(tmp + [i], nums, target)

        candidates.sort()
        func([], candidates, target)
        for i in range(len(res)):
            for j in range(len(res[i])):
                res[i][j] = candidates[res[i][j]]
        res = list(set(tuple(t) for t in res))
        res = [list(t) for t in res]

        return res


s = Solution()
print(s.combinationSum2(candidates=[], target=8))
