C#: Count specified element in a stack
Write a C# program to count specified element in a given stack.
Sample Solution:
C# Code:
using System;
// Implementation of a Stack data structure
public class Stack
{
private int[] items; // Array to hold stack elements
private int top; // Index representing the top of the stack
// Constructor to initialize the stack with a specified size
public Stack(int size)
{
items = new int[size]; // Initializing the array with the given size
top = -1; // Initializing top to -1, indicating an empty stack
}
// Method to check if the stack is empty
public bool IsEmpty()
{
return top == -1; // Returns true if top is -1 (empty stack), otherwise false
}
// Method to check if the stack is full
public bool IsFull()
{
return top == items.Length - 1; // Returns true if top is at the last index of the array (full stack)
}
// Method to push an element onto the stack
public void Push(int item)
{
if (IsFull())
{
Console.WriteLine("Stack Full!"); // Displays a message if the stack is full
return;
}
items[++top] = item; // Inserts the item at the incremented top index
}
// Method to pop an element from the stack
public int Pop()
{
if (IsEmpty())
{
Console.WriteLine("Stack underflow"); // Displays a message if the stack is empty
return -1;
}
return items[top--]; // Removes and returns the top element by decrementing top
}
// Method to peek at the top element of the stack without removing it
public int Peek()
{
if (IsEmpty())
{
Console.WriteLine("Stack is empty"); // Displays a message if the stack is empty
return -1;
}
return items[top]; // Returns the element at the top index without removing it
}
// Method to get the current size of the stack
public static int Size(Stack stack)
{
return stack.top + 1; // Returns the number of elements in the stack
}
// Method to count occurrences of specified elements in a stack
public static int Count(Stack stack, int value)
{
int count = 0;
Stack temp = new Stack(Size(stack)); // Temporary stack to store elements
// Count occurrences while preserving stack order
while (!stack.IsEmpty())
{
int current = stack.Pop(); // Remove an element from the original stack
if (current == value)
{
count++; // Increment count for each occurrence of the specified value
}
temp.Push(current); // Store the removed element in the temporary stack
}
// Restore original stack order
while (!temp.IsEmpty())
{
stack.Push(temp.Pop()); // Restore elements to the original stack
}
return count; // Return the count of occurrences
}
// Method to display the stack elements
public static void Display(Stack stack)
{
if (stack.IsEmpty())
{
Console.WriteLine("Stack is empty");
return;
}
Console.WriteLine("Stack elements:");
for (int i = stack.top; i >= 0; i--)
{
Console.Write(stack.items[i] + " "); // Displays each element in the stack
}
}
}
// Main class to demonstrate the functionality of the Stack class
public class Program
{
public static void Main(string[] args)
{
Console.WriteLine("Initialize a stack:");
Stack stack = new Stack(10); // Creating a stack with a size of 10
Console.WriteLine("Input some elements onto the stack:");
stack.Push(10);
stack.Push(50);
stack.Push(30);
stack.Push(40);
stack.Push(50);
stack.Push(50);
Stack.Display(stack); // Displaying the elements in the original stack
int value = 50; // Value to count occurrences
int count = Stack.Count(stack, value); // Counting the occurrences of the specified value
Console.WriteLine("\nNumber of occurrences of {0} in stack: {1}", value, count);
}
}
Sample Output:
Initialize a stack: Input some elements onto the stack: Stack elements: 50 50 40 30 50 10 Number of occurrences of 50 in stack: 3
Flowchart:
C# Sharp Code Editor:
Improve this sample solution and post your code through Disqus
Previous: Count all the elements in a stack.
Next: Check if an element is present or not in a stack.
What is the difficulty level of this exercise?
Test your Programming skills with w3resource's quiz.
- Weekly Trends and Language Statistics
- Weekly Trends and Language Statistics