Leet Code Daily 2024-05-21 - Subsets

class Solution {
public:
    vector<vector<int>> subsets(vector<int>& nums) {
        vector<vector<int>> ret;
        const int n = nums.size();
        for (int mask = 0; mask < (1 << n); mask++) {
            vector<int> s;
            for (int i = 0; i < n; i++) {
                if (mask & (1 << i)) {
                    s.push_back(nums[i]);
                }
            }
            ret.push_back(s);
        }
        return ret;
    }
};