<reponame>drunkwater/leetcode<filename>medium/python/c0023_47_permutations-ii/00_leetcode_0023.py
# DRUNKWATER TEMPLATE(add description and prototypes)
# Question Title and Description on leetcode.com
# Function Declaration and Function Prototypes on leetcode.com
#47. 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]]
#        """



# Time Is Money
# DRUNKWATER TEMPLATE(add description and prototypes)
# Question Title and Description on leetcode.com
# Function Declaration and Function Prototypes on leetcode.com
#47. 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]]
#        """



# Time Is Money
# DRUNKWATER TEMPLATE(add description and prototypes) # Question Title and Description on leetcode.com # Function Declaration and Function Prototypes on leetcode.com #47. 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]] #        """ # Time Is Money