Leetcode

39. Combination Sum

Given an array of distinct integers candidates and a target integer target, return a list of all unique combinations of candidates where the chosen numbers sum to target. You may return the combinations in any order.

The same number may be chosen from candidates an unlimited number of times. Two combinations are unique if the frequency of at least one of the chosen numbers is different.

It is guaranteed that the number of unique combinations that sum up to target is less than 150 combinations for the given input.

Example 1:

Input: candidates = [2,3,6,7], target = 7
Output: [[2,2,3],[7]]
Explanation:
2 and 3 are candidates, and 2 + 2 + 3 = 7. Note that 2 can be used multiple times.
7 is a candidate, and 7 = 7.
These are the only two combinations.

Example 2:

Input: candidates = [2,3,5], target = 8
Output: [[2,2,2,2],[2,3,3],[3,5]]

Example 3:

Input: candidates = [2], target = 1
Output: []

Example 4:

Input: candidates = [1], target = 1
Output: [[1]]

Example 5:

Input: candidates = [1], target = 2
Output: [[1,1]]

Constraints:

  • 1 <= candidates.length <= 30
  • 1 <= candidates[i] <= 200
  • All elements of candidates are distinct.
  • 1 <= target <= 500

Solution(Python3):

class Solution:
def combinationSum(self, candidates, target):
ret = []
self.dfs(candidates, target, [], ret)
return ret
def dfs(self, nums, target, path, ret):
if target < 0:
return
if target == 0:
ret.append(path)
return
for i in range(len(nums)):
self.dfs(nums[i:], target - nums[i], path+[nums[i]], ret)
# TC: O(N^(T/M)+1), where N is the number of candidates, T is the target value, and M is the minimum value among the candidates
# SC: O(T/M)

Link

--

--

--

My homepage to record my thought processes for solving SQL and Algorithm questions

Recommended from Medium

🐎Griffin Race — ELO Calibration matches

Monitor SSH Session Connection Attempts using Grafana, InfluxDB and Telegraf

4 Ways to get the most from an iOS Coding Bootcamp

4 Ways to get the most from an iOS Coding Bootcamp

Design Patterns — overview

Arth-Task-4.1 (How to contribute limited storage to the Hadoop Cluster?)

How To Choose Right DevOps Tools For Your Business | HData Systems

CSS preprocessor made simple: What and Why.

The Best Employee Monitoring Software of 2019

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store
Isabelle

Isabelle

In love with telling stories with data

More from Medium

1155. Number of Dice Rolls With Target Sum

Leetcode Blind 75 Practice-Maximum Subarray

Minimum Operations to Reduce X to Zero — LeetCode

Solve Top LeetCode Problem Smartly