552. Sum of Numbers in a Stack

Calculate the sum of all numbers in a Stack.

Assumption: The Stack is not null or empty.

Example:

Stack contains 7,5,3,0

Answer: 15

class Solution {
	public int sumOfStack(Deque<Integer> stack) {
        int sum = stack.pop();
        while (!stack.isEmpty()) {
            sum += stack.pop();
        }
    return sum;
	}
}