codeing

链表

单链表反转

  1.   public static Node reverselinkdlist(Node head){
  2.         Node pre = null;
  3.         Node next = null;
  4.         if(head!=null){
  5.             while (head!=null){
  6.                 next = head.next;
  7.                 head.next = pre;
  8.                 pre = head;
  9.                 head = next;
  10.             }
  11.         }
  12.         return pre;
  14.     }

双向链表翻转

  1. public static Node reverselinkdlist(Node head){
  2.     Node pre = null;
  3.     Node next = null;
  4.     if(head!=null){
  5.         while (head!=null){
  6.             next = head.next;
  7.             head.next = pre;
  8.             head.pre = next;
  9.             pre =head;
  10.             head = next;
  11.         }
  12.     }
  13.     return pre;
  14. }

链表删除某一个相同值的节点