61 lines
1.1 KiB
Python
61 lines
1.1 KiB
Python
from string import *
|
|
from re import *
|
|
from datetime import *
|
|
from collections import *
|
|
from heapq import *
|
|
from bisect import *
|
|
from copy import *
|
|
from math import *
|
|
from random import *
|
|
from statistics import *
|
|
from itertools import *
|
|
from functools import *
|
|
from operator import *
|
|
from io import *
|
|
from sys import *
|
|
from json import *
|
|
from builtins import *
|
|
import string
|
|
import re
|
|
import datetime
|
|
import collections
|
|
import heapq
|
|
import bisect
|
|
import copy
|
|
import math
|
|
import random
|
|
import statistics
|
|
import itertools
|
|
import functools
|
|
import operator
|
|
import io
|
|
import sys
|
|
import json
|
|
from typing import *
|
|
|
|
|
|
# @leet start
|
|
class Solution:
|
|
def subsetsWithDup(self, nums: List[int]) -> List[List[int]]:
|
|
res = []
|
|
|
|
nums.sort()
|
|
|
|
def backtrack(start, path):
|
|
res.append(path[:])
|
|
|
|
for i in range(start, len(nums)):
|
|
if i > start and nums[i] == nums[i - 1]:
|
|
continue
|
|
|
|
path.append(nums[i])
|
|
backtrack(i + 1, path)
|
|
path.pop()
|
|
|
|
backtrack(0, [])
|
|
return res
|
|
|
|
|
|
# @leet end
|
|
|