Subsets
-
[Algo Rhythm🕺💃] LeetCode 78. SubsetsAlgo Rhythm🕺💃/LeetCode 2020. 8. 22. 23:38
📚 Problem description Given a set of distinct integers, nums, return all possible subsets (the power set). Note: The solution set must not contain duplicate subsets. Example: Input: nums = [1,2,3] Output: [ [3], [1], [2], [1,2,3], [1,3], [2,3], [1,2], [] ] 🎯 Solution 1. Backtracking class Solution { List answer = new ArrayList(); public List subsets(int[] nums) { List list = new ArrayList(); bac..