链表1：反转单向链表，双向链表

反转单向链表
思想：有好几种方法：这里采用的是创建一个新的链表来存放新产生的链表，把原链表的表头节点依次接到新的链表中

代码：

public static class Node {   //定义一个Node节点类
		public int value;
		public Node next;

		public Node(int data) {
			this.value = data;
		}
	}
         //这里采用的是建立一个新的链表来存放倒序产生的链表
	public static Node reverseList(Node head) {  
		Node pre = null;   // 定义两个空节点
		Node next = null;     
		while (head != null) {  //head是每个要接在链表的开头的那个节点
			next = head.next;   //要改变的节点
			head.next = pre;
			pre = head;
			head = next;
		}
		return pre;  // 返回倒序的链表
	}

反转双向链表
思想：跟单向链表的反转相似，但是这里要注意它有一个前驱指针，大致思想跟单向的差不多，具体看代码，这里再加上测试代码等
代码：

public static class DoubleNode {
		public int value;
		public DoubleNode last;//前驱
		public DoubleNode next;//后继

		public DoubleNode(int data) {
			this.value = data;
		}
	}

	public static DoubleNode reverseList(DoubleNode head) {
		DoubleNode pre = null;
		DoubleNode next = null;
		while (head != null) {
			next = head.next;
			head.next = pre;
			head.last = next;
			pre = head;
			head = next;
		}
		return pre;
	}
	public static void printLinkedList(Node head) {
		System.out.print("Linked List: ");
		while (head != null) {
			System.out.print(head.value + " ");
			head = head.next;
		}
		System.out.println();
	}

	public static void printDoubleLinkedList(DoubleNode head) {
		System.out.print("Double Linked List: ");
		DoubleNode end = null;
		while (head != null) {
			System.out.print(head.value + " ");
			end = head;
			head = head.next;
		}
		System.out.print("| ");
		while (end != null) {
			System.out.print(end.value + " ");
			end = end.last;
		}
		System.out.println();
	}

	public static void main(String[] args) {
		Node head1 = new Node(1);
		head1.next = new Node(2);
		head1.next.next = new Node(3);
		printLinkedList(head1);//上面三行代码表示构建了一个head1链表
		head1 = reverseList(head1);
		printLinkedList(head1);

		DoubleNode head2 = new DoubleNode(1);
		head2.next = new DoubleNode(2);
		head2.next.last = head2;
		head2.next.next = new DoubleNode(3);
		head2.next.next.last = head2.next;
		head2.next.next.next = new DoubleNode(4);
		head2.next.next.next.last = head2.next.next;
		printDoubleLinkedList(head2);
		printDoubleLinkedList(reverseList(head2));

	}

还有其他的方法，可以参考一下；链接：点击