AlgoMaster Logo

Combination Sum II

candidates=[1, 1, 2, 5, 6, 7, 10],target=8
0 / 310
skipskipskipskipskipskip+7skip+6skipskip+5skipskipskip+2skipskipskipskip+6+5skipskipskip+1skipskipskipskipskip+7+6skipskip+5skipskipskip+2skipskipskipskip+5+1×2skipskipskipskipskip+6+5skipskipskip+2skipskipskipskippairs1 ×0/22 ×0/15 ×0/16 ×0/17 ×0/110 ×0/1target 8result 0/4
Step:Start: Find combinations that sum to target (each candidate used at most once)
1
combinationSum2([1,1,2,5,6,7,10...