Leetcode subsets II

Given a collection of integers that might contain duplicates, Nums, return all possible subsets.

Note:

• Elements in a subset must is in non-descending order.
• The solution set must not contain duplicate subsets.

For example,
If nums = [1,2,2] , a solution is:

[  2],  [1],  [1,2,2],  [2,2], [up  ],  []]

With Leetcode subsets

The difference is that there is a need to improvise a copy of an array, only one element at a time, rather than using ANS-[x] to remove all elements of x in ans.

defSubsets_with_dup (Nums) sub ([nums.sort],0) EnddefSub (ans,start=0) T=ans.length (start...t).|i|Ans[i].each Do|x|Temp=ans[i].dup temp.length.times do|j|ifTEMP[J] = =x Temp.delete_at (j) BreakEnd End ans<<temp unless ans.include? (temp) End endreturnAnsifAns[-1].empty? Sub (ans,t) End

Leetcode subsets II