我已经使用stack (stl)来寻找两个链表的交点，但是我得到了分段错误，下面是我的函数，

#include <iostream>
#include <stack>
using namespace std;

struct ListNode {
    int val;
    ListNode* next;
    ListNode(int x) : val(x), next(NULL) {}
};

ListNode* getIntersectionNode(ListNode* headA, ListNode* headB) {
    stack<ListNode*> stackA;
    stack<ListNode*> stackB;

    ListNode* currA = headA;
    ListNode* currB = headB;

    while (currA != NULL) {
        stackA.push(currA);
        currA = currA->next;
    }

    while (currB != NULL) {
        stackB.push(currB);
        currB = currB->next;
    }

    ListNode* intersectionNode = NULL;

    while (!stackA.empty() && !stackB.empty() && stackA.top() == stackB.top()) {
        intersectionNode = stackA.top();
        stackA.pop();
        stackB.pop();
    }

    return intersectionNode;
}

int main() {
    // Test case
    ListNode* headA = new ListNode(1);
    headA->next = new ListNode(2);
    headA->next->next = new ListNode(3);
    headA->next->next->next = new ListNode(4);
    headA->next->next->next->next = new ListNode(5);

    ListNode* headB = new ListNode(6);
    headB->next = new ListNode(7);
    headB->next->next = headA->next->next;

    ListNode* intersection = getIntersectionNode(headA, headB);

    if (intersection != NULL) {
        cout << "Intersection found at node with value: " << intersection->val << endl;
    } else {
        cout << "No intersection found." << endl;
    }

    return 0;
}

ListNode* getIntersectionNode(ListNode* headA, ListNode* headB) {
    ListNode* pA = headA;
    ListNode* pB = headB;

    while (pA != pB) {
        pA = (pA == NULL) ? headB : pA->next;
        pB = (pB == NULL) ? headA : pB->next;
    }

    return pA;
}