Java实现栈的顺序存储

Posted 2022-03-07 肥学

import java.util.*;

public class Main 
	public static Stack InitStack() 
		Stack stack=new Stack(new int[10],-1);//构建长度为10的stack
		
		return stack;
	
	public static Stack Push(Stack stack,int num) 
		if(stack.top==stack.data.length-1)
			System.out.println("栈已满！！！");
		else 
			stack.data[++stack.top]=num;
			System.out.println("入栈成功！");
		
		return stack;
	
	public static Stack Pop(Stack stack) 
		if(stack.top==-1)System.out.println("该栈以空！！！");
		else 
			stack.top--;
			System.out.println("栈顶元素"+stack.data[stack.top+1]+"以成功pop");
		
		return stack;
	
	public static int GetTop(Stack stack) 
		if(stack.top==-1) 
			System.out.println("该栈为空栈！");
			return -1;
		
		return stack.data[stack.top];
	
	public static void main(String[] args) 
		Stack stack=InitStack();
		Push(stack,5);
		Push(stack,2);
		Push(stack,1);
		System.out.println("栈顶元素为："+GetTop(stack));
		Pop(stack);
		System.out.println("栈顶元素为："+GetTop(stack));
		Push(stack,999);
		System.out.println("栈顶元素为："+GetTop(stack));
		
		
	


class Stack
	int data[];
	int top;
	public Stack() 
		
	
	public Stack(int[] data,int top) 
		this.data=data;
		this.top=top;
		
	

样例：

入栈成功！
入栈成功！
入栈成功！
栈顶元素为：1
栈顶元素1以成功pop
栈顶元素为：2
入栈成功！
栈顶元素为：999