LeetCode Reverse Linked List

Posted

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了LeetCode Reverse Linked List相关的知识,希望对你有一定的参考价值。

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) {
       if (!head || !head->next)return head;
        ListNode *mid=head->next,*last=mid->next;
        head->next = NULL;
        for (;last;)
        {
            mid->next = head;
            head = mid;
            mid = last;
            last = last->next;
        }
        mid->next = head;
        return mid;
        
    }
};

 

以上是关于LeetCode Reverse Linked List的主要内容,如果未能解决你的问题,请参考以下文章

Leetcode 206. Reverse Linked List

Leetcode92. Reverse Linked List II && 206. Reverse Linked List

LeetCode Reverse Linked List

LeetCode 92. Reverse Linked List II

#Leetcode# 92. Reverse Linked List II

Leetcode 206 Reverse Linked List 链表