利用栈来反转链表和排序（Java实现）

栈是一个特殊的数据结构，特点是先进后出(First In Last Out 简称FILO)，这种特殊的数据结构，可以用在对链表做反转中，或者字符串逆序，因为要把头变成尾，尾变成头，栈这种结构最合适不过了，下面来看看如何用栈来做链表的反转。

package com.xxx.algorithm.sort;
import java.util.Stack;
public class LinkedListReverse {
	
	public static Node reverseLinkedList(Node head){
		Stack<Node> stack = new Stack<Node>();
		while(head!=null){
			stack.push(head);
			head = head.next;
		}
		if(!stack.isEmpty())
			head = stack.pop();
		Node cur = head;
		while(!stack.isEmpty()){
			Node node = stack.pop();
			node.next = null;
			cur.next = node;
			cur = node;
		}
		return head;
	}
	
	public static void display(Node head){
		System.out.print("list:");
		Node cur = head;
		while(cur!=null){
			System.out.print(cur+"->");
			cur = cur.next;
		}
		System.out.println();
	}
	
	public static void main(String[] args) {
		Node a = new Node("a");
		Node b = new Node("b");
		Node c = new Node("c");
		Node d = new Node("d");
		Node e = new Node("e");