Tuesday, March 12, 2013

Subsets II

Subsets IIJun 25 '12
Given a collection of integers that might contain duplicates, S, return all possible subsets.
Note:
  • Elements in a subset must be in non-descending order.
  • The solution set must not contain duplicate subsets.
For example,
If S = [1,2,2], a solution is:
[
  [2],
  [1],
  [1,2,2],
  [2,2],
  [1,2],
  []
]

1 comment:

  1. Instead of using vector prevSet and checking
    if (currSet!=prevSet) we can do :

    if (indx == start || S[indx] != S[indx-1])

    - Hari

    ReplyDelete