码迷,mamicode.com
首页 > 其他好文 > 详细

206 Reverse Linked List

时间:2016-09-13 09:05:29      阅读:158      评论:0      收藏:0      [点我收藏+]

标签:

Reverse a singly linked list.

 

解法: linked list 最典型的题型之一。

 

public ListNode ReverseList(ListNode head) {
       var sentinel = new ListNode(0);
       
       var dummy = new ListNode(0);
       dummy.next = head;
       while(dummy.next != null)
       {
           dummy.next = head.next;
           var temp = sentinel.next;
           sentinel.next = head;
           sentinel.next.next = temp;
       }
       return sentinel.next;
    }

思路相同,也可以不用哨兵:

 public ListNode ReverseList(ListNode head) {
       if(head == null) return head;
       ListNode nextNode = null;
       ListNode newHead = null;
       while(head != null)
       {
           nextNode = head.next;
           head.next = newHead;
           newHead = head;
           head = nextNode;
       }
       return newHead;
    }

 

206 Reverse Linked List

标签:

原文地址:http://www.cnblogs.com/renyualbert/p/5867149.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!