单链表反转

zhdan~

于 2019-12-23 18:12:40 发布

阅读量136

点赞数

分类专栏：数据结构与算法

本文链接：https://blog.youkuaiyun.com/zhangdongan1991/article/details/103671026

版权

数据结构与算法专栏收录该内容

2 篇文章

订阅专栏

class Node{
  int value;
  Node next;
  public Node(int value){
    this.value = value;
  }
}
public class LinkReverse {

  /**
   * 原地反转法
  */
  public static Node reverseV1(Node head){
    if(head == null || head.next == null) {
      return head;
    }
    Node pre = null;
    Node next = null;
    while(head != null) {
      next = head.next;
      head.next = pre;
      pre = head;
      head = next;
    }
    return pre;
  }
  
  /**
   * 递归法
  */
  public static Node reverseV2(Node head){
    if(head == null || head.next == null) {
      return head;
    }
    Node reverseNode = reverseV2(head.next);
    head.next.next = head;
    head.next = null;
    return reverseNode;
  }

}