首页 > 其他 > 详细

90. Subsets II

时间:2018-05-20 10:25:34      阅读:131      评论:0      收藏:0      [点我收藏+]

https://leetcode.com/problems/subsets-ii/description/

class Solution {
public:
    vector<vector<int>> subsetsWithDup(vector<int>& nums) {
        vector<vector<int>> res;
        res.push_back(vector<int>());
        sort(nums.begin(), nums.end());
        for (int j = 0, pre_sz; j < nums.size(); j++) {
            int n = nums[j];
            int sz = res.size();
            int start = (j > 0 && nums[j] == nums[j-1]) ? pre_sz : 0;
            pre_sz = sz;
            for (int i = start; i < sz; i++) {
                vector<int> v = res[i];
                v.push_back(n);
                res.push_back(v);
            }
        }
        return res;
    }
};

 

90. Subsets II

原文:https://www.cnblogs.com/JTechRoad/p/9062410.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!