LeetCode 206. Reverse Linked List

    xiaoxiao2021-03-25  121

    题目: 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* newHead = NULL; while (head) {//当head不为NULL时 ListNode* nextNode = head->next;//nextNode为head的下一个 head->next = newHead;//head指向newHead,初始为NULL,因为要作为新链表的尾节点 newHead = head;//newHead为原来head的位置 head = nextNode;//新head为nextNode的位置,此时链表其实是两个 } return newHead; } };
    转载请注明原文地址: https://ju.6miu.com/read-8497.html

    最新回复(0)