1.反轉(zhuǎn)鏈表

//1.單鏈表
public static Node reverseLinkedList(Node head){
       Node next = null;
       Node pre = null;
       while (head!=null){
           next = head.next;
           head.next = pre;
           pre = head;
           head = next;
       }
       return pre;
   }
//2.雙鏈表
public static DoubleNode reverseDoubleList(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;
   }

2.刪除單鏈表中指定值，并返回頭節(jié)點(diǎn)。

public static Node delNode(Node head, int value){
       //找到第一個(gè)不需要?jiǎng)h除的節(jié)點(diǎn)
       while(head!=null){
           if(head.value!=value)
               break;
           head= head.next;
       }
       Node pre = head;
       Node cur = head;
       while (cur!=null){
           if(cur.value==value)
               pre.next=cur.next;
           else
               pre=cur;
           cur= cur.next;
       }
       return head;
   }