• 使用泛型和内部静态类实现栈(FILO,先进后出)


    package tuple;
    /**
     * 泛型实现的栈,FILO
     * @author Youjie
     *
     * @param <T>
     */
    public class LinkedStack<T> {
    	
    	private static class Node<U> {
    		U item;
    		Node<U> next;
    		public Node(U item, Node<U> next) {
    			this.item = item;
    			this.next = next;
    		}
    		public Node() {
    			this.item = null;
    			this.next = null;
    		}
    		
    		boolean end(){return item == null && next == null;}
    	}
    	
    	private Node<T> top = new Node<T>();
    	
    	public void push(T item){
    		top = new Node<T>(item, top);
    	}
    	
    	public T pop(){
    		T result = top.item;
    		if(!top.end()){
    			top = top.next;
    		}
    		return result;
    	}
    	
    	public static void main(String[] args) {
    		LinkedStack<String> lss = new LinkedStack<String>();
    		
    		for(String s : "a,b,c,d,e".split(",")){
    			lss.push(s);
    		}
    		String s;
    		
    		while((s=lss.pop())!=null){
    			System.out.println(s);
    		}
    		
    		
    		
    	}
    }
    
    
  • 相关阅读:
    CF359B Permutation
    CF859C Pie Rules
    Contest 156
    Contest 155
    Range Module
    python-环境
    Git 使用
    Contest 154
    生命是一种长期而持续的累积过程
    Contest 153
  • 原文地址:https://www.cnblogs.com/leihuazhe/p/7900569.html
Copyright © 2020-2023  润新知