leetcode 206. Reverse Linked List

6 years ago 6 years ago

leetcode

a few seconds read (About 56 words) 24 visits

Reverse a singly linked list.

Input: 1->2->3->4->5->NULL
Output: 5->4->3->2->1->NULL

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public ListNode reverseList(ListNode head) {
        ListNode cur = head;
        ListNode prev = null;

        while(cur!=null){
            ListNode lat = cur.next;
            cur.next = prev;
            prev = cur;
            cur = lat;
        }
        return prev;

    }    
}

本文标题：leetcode 206. Reverse Linked List
本文作者：sanwanliu
本文链接：https://sanwanliu.github.io/2019/07/10/leetcode 06. Reverse Linked List/
发布时间：2019-07-10
版权声明：本博客所有文章除特别声明外，均采用 CC BY-NC-SA 4.0 许可协议。转载请注明出处！

Comments

Catalogue

Your browser is out-of-date!

微信扫一扫：分享

Comments

Catalogue

Your browser is out-of-date!