**Leetcode 659. Split Array into Consecutive Subsequences

最新推荐文章于 2021-08-26 15:16:42 发布

Z-Pilgrim

最新推荐文章于 2021-08-26 15:16:42 发布

阅读量273

点赞数

分类专栏： LeetCode题解

本文链接：https://blog.csdn.net/u011026968/article/details/82944887

版权

LeetCode题解专栏收录该内容

271 篇文章 0 订阅

订阅专栏

https://leetcode.com/problems/split-array-into-consecutive-subsequences/description/

这个代码技巧性太强了参考了http://www.cnblogs.com/grandyang/p/7525821.html

基本思路就是，up维护数可能存在次数的上限，

class Solution {
public:
    bool isPossible(vector<int>& nums) {
        unordered_map< int, int > freq, up;
        for (auto v : nums) freq[v]++;
        for (auto v : nums) {
            if (!freq[v])continue;
            if ( up[v] > 0 ) {
                up[v] --;
                up[v+1]++;
            } else if ( freq[v + 1] > 0 && freq[v + 2] > 0 ) {
                freq[v+1]--;
                freq[v+2]--;
                up[v+3] ++;
            } else return false;
            freq[v]--;
        }
        return true;
    }
};