Java常见的数据结构之栈和队列详解

using System;
using System.Collections.Generic;

class Program
{
    static void Main()
    {
        Stack<int> stack = new Stack<int>();

        // 入栈
        stack.Push(1);
        stack.Push(2);
        stack.Push(3);

        // 出栈
        int poppedItem = stack.Pop();
        Console.WriteLine("Popped: " + poppedItem); // 输出：Popped: 3

        // 查看栈顶元素
        int topItem = stack.Peek();
        Console.WriteLine("Top: " + topItem); // 输出：Top: 2

        // 遍历栈
        while (stack.Count > 0)
        {
            int item = stack.Pop();
            Console.WriteLine(item);
        }
    }
}

import java.util.Stack;

public class Main {
    public static void main(String[] args) {
        Stack<Integer> stack = new Stack<>();

        // 入栈
        stack.push(1);
        stack.push(2);
        stack.push(3);

        // 出栈
        int poppedItem = stack.pop();
        System.out.println("Popped: " + poppedItem); // 输出：Popped: 3

        // 查看栈顶元素
        int topItem = stack.peek();
        System.out.println("Top: " + topItem); // 输出：Top: 2

        // 遍历栈
        while (!stack.isEmpty()) {
            int item = stack.pop();
            System.out.println(item);
        }
    }
}

using System;
using System.Collections.Generic;

class Program
{
    static void Main()
    {
        Queue<int> queue = new Queue<int>();

        // 入队
        queue.Enqueue(1);
        queue.Enqueue(2);
        queue.Enqueue(3);

        // 出队
        int dequeuedItem = queue.Dequeue();
        Console.WriteLine("Dequeued: " + dequeuedItem); // 输出：Dequeued: 1

        // 查看队头元素
        int frontItem = queue.Peek();
        Console.WriteLine("Front: " + frontItem); // 输出：Front: 2

        // 遍历队列
        foreach (int item in queue)
        {
            Console.WriteLine(item);
        }
    }
}

import java.util.LinkedList;
import java.util.Queue;

public class Main {
    public static void main(String[] args) {
        Queue<Integer> queue = new LinkedList<>();

        // 入队
        queue.offer(1);
        queue.offer(2);
        queue.offer(3);

        // 出队
        int dequeuedItem = queue.poll();
        System.out.println("Dequeued: " + dequeuedItem); // 输出：Dequeued: 1

        // 查看队头元素
        int frontItem = queue.peek();
        System.out.println("Front: " + frontItem); // 输出：Front: 2

        // 遍历队列
        for (int item : queue) {
            System.out.println(item);
        }
    }
}