leetcode

0 class CustomStack {

1 vector<int> st;

2 int size = 0;

3

4 public:

5 CustomStack(int maxSize) : st(maxSize) {}

6

7 void push(int x) {

8 if (size == st.size()) return;

9 st[size++] = x;

10 }

11

12 int pop() {

13 if (size == 0) return -1;

14 return st[--size];

15 }

16

17 void increment(int k, int val) {

18 for (int i = 0; i < min(k, size); i++)

19 st[i] += val;

20 }

21 };