GoLang Solution For LeetCode Problem: Combination Sum II
Solving Combination Sum II in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.
- The solution set must not contain duplicate combinations.
Input: candidates = [10,1,2,7,6,1,5], target = 8, A solution set is: [ [1, 7], [1, 2, 5], [2, 6], [1, 1, 6] ]
Input: candidates = [2,5,2,1,2], target = 5, A solution set is: [ [1,2,2],  ]
See the full details of the problem Combination Sum II at LeetCode
Originally posted at: @github.com/halfrost/LeetCode-Go