Java: Count all the elements in a stack

Last update on May 09 2025 12:57:10 (UTC/GMT +8 hours)

7. Count all elements in a stack.

Write a Java program to count all stack elements.

Sample Solution:

Java Code:

import java.util.Scanner;
public class Stack {
  private int[] arr;
  private int top;

  // Constructor to initialize the stack
  public Stack(int size) {
    arr = new int[size];
    top = -1;
  }

  // Method to push an element onto the stack
  public void push(int num) {
    if (top == arr.length - 1) {
      System.out.println("Stack is full");
    } else {
      top++;
      arr[top] = num;
    }
  }

  // Method to pop an element from the stack
  public int pop() {
    if (top == -1) {
      System.out.println("Stack Underflow");
      return -1;
    } else {
      int poppedElement = arr[top];
      top--;
      return poppedElement;
    }
  }

  // Method to get the top element of the stack
  public int peek() {
    if (top == -1) {
      System.out.println("Stack is empty");
      return -1;
    } else {
      return arr[top];
    }
  }

  // Method to check if the stack is empty
  public boolean isEmpty() {
    return top == -1;
  }

  // Method to count elements
  public int count() {
    return top + 1;
  }

  public void display() {
    if (top == -1) {
      System.out.println("Stack is empty");
    } else {
      System.out.print("Stack elements: ");
      for (int i = top; i >= 0; i--) {
        System.out.print(arr[i] + " ");
      }
      System.out.println();
    }
  }

  public static void main(String[] args) {
    System.out.println("Initialize a stack:");
    Stack stack = new Stack(10);
    System.out.println("\nInput some elements on the stack:");
    stack.push(1);
    stack.push(3);
    stack.push(2);
    stack.push(0);
    stack.push(7);
    stack.push(5);
    stack.push(-1);
    stack.display();
    int ctr = stack.count();
    System.out.println("\nNumber of elements in the said stack: " + ctr);
  }
}

Sample Output:

Input some elements on the stack:
Stack elements: -1 5 7 0 2 3 1

Number of elements in the said stack: 7

Flowchart:

For more Practice: Solve these Related Problems:

• Write a Java program to count the number of elements in a stack using recursion without altering its content.
• Write a Java program to count stack elements by transferring them to an auxiliary stack and then restoring the original stack.
• Write a Java program to implement a method that returns the size of a stack using an iterative loop and a counter.
• Write a Java program to compute the size of a stack using Java 8 streams by converting the stack to a stream.

Go to:

• Java Stack Exercises Home ↩
• Java Exercises Home ↩

PREV : Remove all the elements from a stack.
NEXT : Check if an element is present in the stack.

Live Demo:

Java Code Editor:

Improve this sample solution and post your code through Disqus