stack.java

java写的一个用堆栈进行迷宫求解的算法演示

import java.util.LinkedList;


public class Stack {
	
	private LinkedList list = new LinkedList();
	
	public Stack(){
		
	}
	
	public void Clear(){
		list.clear();
	}
	
	public boolean isEmpty(){
		return list.isEmpty();
	}
	
	public Posetion GetTop(){
		return (Posetion)list.getLast();
	}
	
	public Posetion Pop(){
		return (Posetion)list.removeLast();
	}
	
	public void Push(Object el){
		list.add(el);
	}
	
	public Posetion Get(int i){
		return (Posetion)list.get(i);
	}
	
	public String toString(){
		String str="";
		for(int i = list.size()-1; i >= 0; i--){
			str += this.Get(i).toString()+"\n";
		}
		return str;
	}

}