LeetCode 1381. 设计一个支持增量操作的栈

原题目：https://leetcode-cn.com/problems/design-a-stack-with-increment-operation/

 

代码：

class CustomStack {
private:
    vector<int> nums;
    int count,index=0,tmp;
public:
    CustomStack(int maxSize) {
        count = maxSize;
    }
    
    void push(int x) {
        if(index >= count) return;
        nums.push_back(x);index++;
    }
    
    int pop() {
        if(index==0) return -1;
        tmp = nums[--index];
        nums.pop_back();
        return tmp;
    }
    
    void increment(int k, int val) {
        for(int i=0;i<k && i<index;i++){
            nums[i] += val;
        }
    }
};