leetcode Reverse Linked List

最新推荐文章于 2020-07-17 10:54:46 发布

GadyPu

最新推荐文章于 2020-07-17 10:54:46 发布

阅读量221

点赞数

分类专栏： leetcode题解

本文链接：https://blog.csdn.net/u012077152/article/details/50214645

版权

leetcode题解专栏收录该内容

83 篇文章 0 订阅

订阅专栏

原题链接：https://leetcode.com/problems/reverse-linked-list/

Description

Reverse a singly linked list.

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* reverseList(ListNode *head) {
        ListNode *A = head, *B = NULL;
        while (head) {
            ListNode *ret = head;
            head = head->next;
            A->next = B;
            B = ret;
            A = head;
        }
        return B;
    }
};