栈

概念

栈是一种特殊的线性表，只能在一端进行操作
往栈中添加元素的操作，一般叫做 push，入栈
从栈中移除元素的操作，一般叫做 pop，出栈
后进先出的原则，Last In First Out，LIFO

package com.czz.stack;

import com.czz.list.ArrayList;

public class Stack<E> {

	private ArrayList<E> list=new ArrayList<>();
	
	public int size() {
		return list.size();
	}

	public boolean isEmplty() {
		return list.isEmpty();
	}
	public void push(E element) {
		list.add(element);
	}
	
	public E pop() {
		
	return	list.remove(list.size()-1);
	}
	
	public E top() {
		
		return list.get(list.size()-1);
	}
}

package com.czz.stack;

public class Test {


	public static void main(String[] args) {

		Stack<Integer> stack=new Stack<>();
		
		stack.push(11);
		stack.push(22);
		stack.push(33);
		
		while(!stack.isEmplty()) {
			System.out.println(stack.pop());
		
	}
	}
	
}