Java实现栈数据结构（Stack）

package 多线程;

import java.util.Scanner;

public class stack {





		public static void main(String[] args){
		Stack stack1 = new Stack(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":
				stack1.list();
				break;
	        case "push":
	        	System.out.println("输入数");
	        	int value = scanner.nextInt();
	        	stack1.push(value);
				
				break;
	        case "pop":
				int re = stack1.pop();
				System.out.printf("取出数据%d\n",re);
				
	    	    break;
	       	case "exit":
	       		scanner.close();
	       		loop = false;
	       		break;

			default:
				break;
			}
		}
		System.out.println("程序退出了");
		
		}

	}

	class Stack{
		private int maxSize;
		private int[] stack;  //数组模拟栈，数据放在数组中
		private int top = -1; //指向栈顶，-1表示没有数据
		
		public Stack(int maxSize) {
			this.maxSize = maxSize; 
			stack = new int[this.maxSize];
			
			
			
		}
		//满
		public boolean isFull(){
			return top == maxSize-1;
			
		}
		//空
		public boolean isNull(){
			return top== -1;
			
		}
		//入栈
		public void push(int value){
			if(isFull()){
				return;
			}top++;
			stack[top] = value;
			
			
		}
		public int pop(){
			if(isNull()){
				throw new RuntimeException("没有数据");
				
			}
			int value = stack[top];
			top--;
			return value;
		
		}	
		public void list(){
			if(isNull()){
				System.out.println("空");
			}for (int i = top; i >= 0; i--) {
				System.out.printf("stack[%d]=%d",i,stack[i]);
			}
		}
		
	}