NeetCode #488LC-78MediumBacktrackingNC 150NC 250
← Back to All Problems#488 · #78 · Subsets(子集)
📌 Problem Statement & Constraints
Given an integer array
nums of unique elements, return all possible subsets (the power set) in any order. Constraints: 1 <= nums.length <= 10, -10 <= nums[i] <= 10.🔒
Sign In to Unlock Full Solutions for All 973 Problems
Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!