利用链表和数组实现栈

分别利用单向链表和数组实现栈

主菜单包含基本添加打印等功能

import java.util.Scanner;

public class ArrayStackDemo {
	public static void main(String[] args) {
		ArrayStack stack = new ArrayStack(4);
		String key = "";
		boolean loop = true;
		Scanner scanner = new Scanner(System.in);
		while(loop) {
			System.out.println("show:打印栈");
			System.out.println("exit:退出程序");
			System.out.println("push:入栈");
			System.out.println("pop:出栈");
			System.out.println("请输入");
			key = scanner.next();
			switch(key) {
			case "show":
				stack.list();
				break;
			case "push":
				System.out.println("请输入一个数：");
				int value = scanner.nextInt();
				stack.push(value);
				break;
			case "pop":
				try {
					int res = stack.pop();
					System.out.println("出栈的数据是：" + res);
				} catch (Exception e) {
					System.out.println(e.getMessage());
				}
				break;
			case "exit":
				scanner.close();
				loop = false;
				break;
			default:
					break;
			}
		}
		System.out.println("程序退出");
	}
}
           

利用数组实现栈

class ArrayStack {
	private int maxSize;
	private int[] stack;
	private int top = -1;

	public ArrayStack(int maxSize) {
		this.maxSize = maxSize;
		this.stack = new int[this.maxSize];
	}

	// 栈满
	public boolean isFull() {
		return top == maxSize - 1;
	}

	// 栈空
	public boolean isEmpty() {
		return top == -1;
	}
	//入栈
	public void push(int value) {
		if(isFull()) {
			System.out.println("栈满");
			return;
		}
		top++;
		stack[top] = value;
	}
	//出栈
	public int pop() {
		if(isEmpty()) {
			throw new RuntimeException("栈空，没有数据");
		}
		int value = stack[top];
		top--;
		return value;
	}
	
	public void list() {
		if(isEmpty()) {
			System.out.println("栈空");
			return;
		}
		for(int i = top;i>=0;i--) {
			System.out.println("stack["+ i+ "] = " + stack[i]);			
		}
	}
	
}
           

利用链表实现栈

class LinkedStack {
	private int maxSize;
	private Node stack;
	private int top = 0;

	public LinkedStack(int maxSize) {
		this.maxSize = maxSize;
	}

	// 栈满
	public boolean isFull() {
		return top == maxSize;
	}

	// 栈空
	public boolean isEmpty() {
		return top == 0;
	}

	// 入栈
	public void push(int value) {
		if (isFull()) {
			System.out.println("栈满");
			return;
		}
		top++;
		Node node = new Node(value);
		if(stack != null) {
			node.next = stack;			
		}
		stack = node;
	}

	// 出栈
	public int pop() {
		if (isEmpty()) {
			throw new RuntimeException("栈空，没有数据");
		}
		int value = stack.no;
		stack = stack.next;
		top--;
		return value;
	}
	
	public void list() {
		if (isEmpty()) {
			System.out.println("栈空");
			return;
		}
		Node temp = stack;
		while (temp != null) {
			System.out.println(temp);
			temp = temp.next;
		}
	}
}

class Node {
	public int no;
	public Node next;

	public Node(int no) {
		this.no = no;
	}

	@Override
	public String toString() {
		return "Node [no=" + no + "]";
	}
}