##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
(LeetCode 78)
Given an integer array nums of unique elements, return all possible subsets (the power set).
Example: nums = [1,2,3] returns [[], [1], [2], [3], [1,2], [1,3], [2,3], [1,2,3]]. There are 2^3 = 8 subsets.
Read the full problem, then return for the solution approach.
