new_contents: """Leetcode 47. Permutations II
  Medium
  
  URL: https://leetcode.com/problems/permutations-ii/
  
  Given a collection of numbers that might contain duplicates,
  return all possible unique permutations.
  
  Example:
  Input: [1,1,2]
  Output:
  [
    [1,1,2],
    [1,2,1],
    [2,1,1]
  ]
  """
  
  class Solution(object):
      def permuteUnique(self, nums):
          """
          :type nums: List[int]
          :rtype: List[List[int]]
          """
          pass
  
  
  def main():
      pass
  
  
  if __name__ == '__main__':
      main()
  
subject: Add lc0047_permutations_ii.py