数据结构---栈的实现

数据结构—栈的实现

package com.stack;

import java.util.Scanner;
import java.util.regex.Matcher;

public class stack {

	private int maxSize;// 栈最大容量
	
	private int [] stacks; // 用数组模拟栈
	
	private int front;// 指针
	
	
	public stack(int maxSize) {
		this.maxSize = maxSize;
		stacks = new int [maxSize];
		front = -1;
	}
	
	// 判断栈是否为空
	public boolean isEmpty() {
		return this.front == - 1;
	}
	
	// 判断栈是否满
	public boolean isFull() {
		return this.front == maxSize -1;
	}
	
	// 向栈中添加数据
	public void add(int num) {
		if(isFull()) { // 入栈时先判断是否栈满
			System.out.println("栈已满");
			return;
		}else {
		front++;// 指针向上移动
		stacks[front]=num;
		 }
	}
	// 元素出栈
	public int remove() {
		if(isEmpty()) { // 出栈时先判断是否为空
			throw new RuntimeException("栈空，没有数据");
		}
		
		int value = stacks[front];
		front--;
		return value;
		
	}
	
	// 查看栈顶元素
	public  int findTop() {
		if(isEmpty()) { // 出栈时先判断是否为空
			throw new RuntimeException("栈空，没有数据");
		}
		int temp = stacks[front];
		return temp;
	}
	
	// 输出所有元素
	public void list() {
		if(isEmpty()) { // 出栈时先判断是否为空
			System.out.println("栈为空");
			return;
		}
		for (int i = front;i>=0;i--) { // 遍历出栈
			System.out.printf("stacks[%d]=%d\n",i,stacks[i]);
			}
	}
	
	public static void main(String[] args) {
		Scanner input = new Scanner(System.in);
		System.out.println("******请输入栈的容量******");
		int capacity = input.nextInt();
		stack stack = new stack(capacity);// 创建对象，并为栈的容量进行赋值
		boolean flag = true;
		
		
		while(flag) {
			System.out.println("--------------------------");
			System.out.println("※※※find:查看栈顶※※※");
			System.out.println("※※※push:元素入栈※※※");
			System.out.println("※※※ pop :元素出栈※※※");
			System.out.println("※※※list:遍历出栈※※※");
			System.out.println("※※※exit:退出操作※※※");
			System.out.println("※※※请输入你的选择※※※");
			System.out.println("--------------------------");
			String key = input.next();
			switch (key) {
			case "push":
				System.out.println("请输入要入栈的元素");
				int num = input.nextInt();
				stack.add(num);
				break;
				
			case "find":
				try {
					int findTop = stack.findTop();
					System.out.printf("栈顶元素为%d\n",findTop);
					break;
				} catch (Exception e) {
			}
				
				
			case "list":
				stack.list();
				break;
				
			case "pop":
				try {
					int remove = stack.remove();
					System.out.printf("出栈的数据是 %d\n", remove);
					break;
				} catch (Exception e) {
					System.out.println(e.getMessage());
				}
				
			case "exit":
				input.close();
				flag = false;
				break;
			}
			
		}
		System.out.println("程序已退出");
	}
}