Question

Given a stack of integers, calculate the sum of the integer values. Also, the stack should still be unchanged after you have calculated the sum Hint: take the items off the stack to sum them up and keep them on a second temporary stack so you can put them all back on after you have calculated the sum.

Answer 1

Since you have not mentioned the language of your preference, I am providing the code in Java.

CODE

import java.util.Scanner;

import java.util.Stack;

public class Main {

public static void main(String[] args) {

Scanner sc = new Scanner(System.in);

Stack<Integer> st = new Stack<>();

System.out.println("Enter the number of elements of the stack: ");

int n = sc.nextInt();

System.out.println("Enter the stack elements: ");

for (int i=0; i<n; i++) {

st.push(sc.nextInt());

}

Stack<Integer> temp = new Stack<>();

int sum = 0;

for (int el : st) {

int popped = st.pop();

sum += popped;

temp.push(popped);

}

for (int el : temp ) {

st.push(temp.pop());

}

System.out.println("Sum = " + sum);

System.out.println("Stack elements: \n" + st);

}

}