[LeetCode] 47. Permutations II 全排列之二

Given a collection of numbers, nums, that might contain duplicates, return all possible unique permutations in any order. Example 1: Input: nums = [1,