Leetcode刷题笔记206反转链表

最新推荐文章于 2024-04-26 10:51:35 发布

moxi_baba

最新推荐文章于 2024-04-26 10:51:35 发布

阅读量203

点赞数

分类专栏： leetcode算法刷题文章标签： leetcode算法刷题

本文链接：https://blog.csdn.net/weixin_43111538/article/details/83215301

版权

leetcode算法刷题专栏收录该内容

1 篇文章 0 订阅

订阅专栏

第一次超出时间限制

/**
 * 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* pNew = head->next;
        ListNode* pHead = head;
        ListNode* pTemp = pNew->next;
        while(pNew != NULL)
        {
            pHead->next = pNew->next;
            pNew->next = head;
            head = pNew;
            pNew = pTemp;
            if(pTemp->next != NULL){
                pTemp = pTemp->next;
            }
        }
        return head;
    }
};

8ms通过结果

/**
 * 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* new_head = NULL;
        ListNode* next = NULL;
        while(head){
            next = head->next;
            head->next = new_head;
            new_head = head;
            head = next;
        }
        return new_head;
    }
};