public int inc(int bom, int dis) {
bom %= size;
if (bom == 0) {
bom = size;
}
Deque<Integer> tempStack = new LinkedList<Integer>();
for (int i = 0; i < bom; i++) {
tempStack.offerLast(stack.pollFirst() + dis);
}
for (int i = 0; i < bom; i++) {
stack.offerFirst(tempStack.pollLast());
}
return stack.peekLast();
}
public int push(int key) {
stack.offerLast(key);
size++;
// System.out.println(stack.peek());
return key;
}
