[LeetCode]Subsets II

385 단어 자바LeetCode
Given a collection of integers that might contain duplicates, S, return all possible subsets.
Note:
Elements in a subset must be in non-descending order.
The solution set must not contain duplicate subsets.
For example, If S =  [1,2,2] , a solution is:
재 귀 + 증 량 구조 법
[
  [2],
  [1],
  [1,2,2],
  [2,2],
  [1,2],
  []
]

좋은 웹페이지 즐겨찾기