LeetCode 从尾到头打印链表

G1acies

于 2023-02-17 21:49:13 发布

阅读量94

点赞数

分类专栏： LeetCode刷题文章标签：链表 leetcode 数据结构

本文链接：https://blog.csdn.net/weixin_54104560/article/details/129092006

版权

LeetCode刷题专栏收录该内容

7 篇文章 0 订阅

订阅专栏

思路

先想到用头插法进行链表逆置

Line 13: Char 19: runtime error: member access within address 0x7f076e8410e0 with insufficient space for an object of type 'ListNode' (solution.cpp)
0x7f076e8410e0: note: pointer points here
 00 00 00 00  00 00 00 00 00 00 00 00  00 00 00 00 00 00 00 00  00 00 00 00 00 00 00 00  00 00 00 00
              ^
SUMMARY: UndefinedBehaviorSanitizer: undefined-behavior prog_joined.cpp:23:19

class Solution {
public:
    vector<int> reversePrint(ListNode* head) {
        ListNode* p, * q, * tempHead;
        tempHead = head;
        tempHead->next = NULL;
        q = head;
        p = head->next;
        while (p != NULL) {
            q = p;
            p = p->next;
            q->next = tempHead->next;
            tempHead->next = q;
        }
        vector<int> v;
        ListNode* a = tempHead->next;
        while (a != NULL) {
            v.push_back(a->val);
            a = a->next;
        }
        return v;

    }
};

头结点未初始化而报错

思路2

用stack来解决逆向输出的问题

class Solution {
public:
    vector<int> reversePrint(ListNode* head) {
        stack<ListNode*> sta1;
        while (head!=NULL)
        {
            sta1.push(head);
            head = head->next;
        }
        vector<int> retv;
        while (!sta1.empty()) {
            head = sta1.top();
            retv.push_back(head->val);
            sta1.pop();
        }
        return retv;
    }
};