How to solve the combinatorial summation problem with LeetCode
This article will explain in detail how LeetCode solves the problem of portfolio summation. The editor thinks it is very practical, so I share it for you as a reference. I hope you can get something after reading this article.
Title
Given an array candidates without repeating elements and a target number target, find all the combinations in candidates that can make the sum of numbers target.
Numbers in candidates can be selected indefinitely.
Description: all numbers (including target) are positive integers. The solution set cannot contain duplicate combinations. Example 1: input: candidates = [2dje 3je 6je 7], target = 7, the solution set is: [[7], [2je 2je 3]] example 2: input: candidates = [2je 3je 5], target = 8, the solution set is: [2m 2m 2m 2J 2], [2m 3e 3], [3J 5] hint: 1
