659. Split Array into Consecutive Subsequences

659. Split Array into Consecutive Subsequences

You are given an integer array sorted in ascending order (may contain duplicates), you need to split them into several subsequences, where each subsequences consist of at least 3 consecutive integers. Return whether you can make such a split.

Example 1：

Input: [1,2,3,3,4,5]
Output: True
Explanation:
You can split them into two consecutive subsequences : 
1, 2, 3
3, 4, 5

Example 2：

Input: [1,2,3,3,4,4,5,5]
Output: True
Explanation:
You can split them into two consecutive subsequences : 
1, 2, 3, 4, 5
3, 4, 5

Example 3：

Input: [1,2,3,4,4,5]
Output: False
Explanation:
You can not split them into consecutive subsequences

Note：
The length of the input is in range of [1, 10000]

分析：
题目要求分解连续子串，每个子串至少有三个元素。那么分解的策略是这样的：由于是排好序的一串数字，那么先统计所有数字的频率。然后从第一个数字开始，检查每个数字的前一个数字是否为一个串的结尾，如果是，就把这个元素加进串里，更新串的结束点。如果不是，则再次判断该数字能不能和后两个数字组成一个串，如果可以的话，更新他们的剩余量，再把新的串的末尾数字记录下来。如果两种情况都不符合，则说明该字符串不能被分解。详细的算法如下：

class Solution {
public:
    bool isPossible(vector<int>& nums) {
        if (nums.empty()) return false;
        int size = nums.size();
        map<int, int> freq;
        map<int, int> tail;

        // count the frequency
        for (int &num : nums) freq[num]++;

        for (int &num : nums) {
            if (!freq[num]) continue;
            freq[num]--;
            if (tail[num - 1] > 0) {
                tail[num - 1]--;
                tail[num]++;
            }
            else if (freq[num + 1] && freq[num + 2]) {
                freq[num + 1]--;
                freq[num + 2]--;
                tail[num + 2]++;
            }
            else return false;
        }
        return true;
    }
};