Create 0047-permutations-ii.java

[sumit16sharma]

Given a collection of numbers, nums, that might contain duplicates, return all possible unique permutations in any order.

Input: nums = [1,1,2] Output: [[1,1,2], [1,2,1], [2,1,1]]

Input: nums = [2,2,1,1] Output: [[1,1,2,2],[1,2,1,2],[1,2,2,1],[2,1,1,2],[2,1,2,1],[2,2,1,1]]

[a93a]

Could you provide your submission URL, thanks. And please do follow the Contribution Guidelines.