https://leetcode.cn/problems/convert-1d-array-into-2d-array/
class Solution {
public:
    vector<vector<int>> construct2DArray(vector<int>& original, int m, int n) {
        vector<vector<int>> ret;
        if(m*n != original.size())
            return ret;

        int count = 0;
        vector<int> tmp;
        for(auto e : original)
        {
            tmp.push_back(e);
            count++;
            if(count == n)
            {
                ret.push_back(tmp);
                count = 0;
                tmp.clear();
            }
        }

        return ret;
    }
};
--------------------------------------------------------------------------------------------
https://leetcode.cn/problems/build-an-array-with-stack-operations/
class Solution {
public:
    vector<string> buildArray(vector<int>& target, int n) {
        vector<string> ret;
        
        int num = 1;
        int i = 0;
        while(i < target.size())
        {
            if(num == target[i])
            {
                ret.push_back("Push");
                num++;
                i++;
            }
            else
            {
                while(num != target[i])
                {
                    ret.push_back("Push");
                    ret.push_back("Pop");
                    num++;
                }
            }
        }

        return ret;
    }
};
--------------------------------------------------------------------------------------------