Combination Sum II

You get an array candidates of integers and an integer target. The array can contain the same value more than one time. Find all the combinations of items from candidates with the sum target.

You can use each item of candidates at most one time. Two items with the same value are two different items. But two combinations are the same when they have the same values the same number of times. The result must not contain the same combination two times.

If no combination exists, return an empty list. You can return the combinations in any order, and the values in each combination in any order.