[LeetCode]47.Permutations II

【題目】 Given a collection of numbers that might contain duplicates, return all possible unique permutations. For example, [1,1,2]have the following unique permutations: [1,1,2],[1,2,1], and[2,1,1]. 【分析】

>>阅读原文<<