栈的两种实现（数组--链式）

数组实现

package com.stack;

public class Stack_array {
	private int[] s;//栈数组
	private int len;
	
	public Stack_array()
	{
		s = new int[10];//初始化大小 10
	}
	
	public Stack_array(int num)
	{
		s = new int[num];//初始化大小 num
	}
	
	/*
	 * 压入栈
	 */
	public void push(int val){
		if(len >= s.length)//栈满
		{
			//扩展栈空间
			int[] ns = s.clone();
			s = new int[ns.length+10];//一次拓展10个
			for(int i = 0;i<ns.length;i++)
			{
				s[i] = ns[i];
			}
			
			s[len++] = val;//新值入栈
		}else
		{
			s[len++] = val;
		}
	}
	
	/*
	 *弹出栈顶元素 
	 */
    public int pop(){
    	if(len != 0)
    		return s[--len];
    	else
    	{
    		System.out.print("栈空");
    		return 0;
    	}
    }
    
    /*
     * 查看栈顶元素
     */
    public int peak(){
    	if(len != 0)
    		return s[len-1];
    	else
    	{
    		System.out.print("栈空");
    		return 0;
    	}
    }
    
    /*
     * 查看栈长度
     */
    public int size(){
    	return len;
    }
    
    /*
     * 判断栈是否为空
     */
    public boolean isEmpty()
    {
    	return len==0;
    }
}

链式实现

package com.stack;

public class Stack_link {
	 class Node {
	        public int val;
	        public Node next;
	        public Node(int val)
	        {
	            this.val = val;
	        }
	        
	        public Node()
	        {
	        	
	        }
	    }
	    
	 	private Node top;
	 	private int len;
	 	
	 	public Stack_link()
	 	{
	 		
	 	}
	 	
	 	/*
	 	 * 压入栈
	 	 */
	    public void push(int val){
	    	Node node = new Node(val);
	    	node.next = top;
	    	top = node;
	    	len++;
	    }
	    
	    /*
	     * 弹出栈顶元素
	     */
	    public int pop(){
	    	if(top == null)
	    	{
	    		System.out.print("栈空");
	    		return 0;
	    	}else
	    	{
	    		int val = top.val;
	    		top = top.next;
	    		len--;
	    		return val;
	    	}
	    }
	    
	    /*
	     * 查看栈顶元素
	     */
	    public int peak(){
	    	if(top==null)
	    	{
	    		System.out.print("栈空");
	    		return 0;
	    	}else
	    	{
	    		return top.val;
	    	}
	    }
	    
	    /*
	     *查看栈长度 
	     */
	    public int size(){
	    	return len;
	    }
	    
	    /*
	     * 判断栈是否为空
	     */
	    public boolean isEmpty()
	    {
	    	return len == 0;
	    }
}