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

Reverse Linked List

时间:2015-05-05 19:17:24      阅读:113      评论:0      收藏:0      [点我收藏+]

标签:

Reverse a singly linked list.

 

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
public class Solution {
    public ListNode reverseList(ListNode head) {
        ListNode h = new ListNode(0);
        h.next = null;
        ListNode p = null;
        while(head!=null) {
            p = head.next;//记录head的后继
            head.next = h.next;
            h.next = head;
            head = p;
            if(p!=null)
            p = p.next;
        }
        return h.next;
    }
}

 

Reverse Linked List

标签:

原文地址:http://www.cnblogs.com/mrpod2g/p/4479595.html

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