C语言刷题——Leetcode面试题02.07.链表相交

chen_clc

已于 2024-06-17 21:48:02 修改

阅读量88

点赞数 2

文章标签： c语言 leetcode 链表

于 2024-06-16 22:41:35 首次发布

本文链接：https://blog.csdn.net/qq_44784852/article/details/139727850

版权

遍历完A链表后，将链表指向B链表；
遍历完B链表后，将链表指向A链表；

先判断A、B链表是否有空链表，如果有，直接返回空
注意判断节点相等是curA == curB，而不是curA->val == curB->val && curA->next == curB->next

struct ListNode *getIntersectionNode(struct ListNode *headA, struct ListNode *headB) {
    struct ListNode* curA = headA;
    struct ListNode* curB = headB;
    int headAreturn = 0;
    int headBreturn = 0;
    if (curA == NULL || curB == NULL) {
        return NULL;
    }
    while (curA || curB) {
        if (curA == curB) {
            return curA;
        }
        if (curA->next != NULL) {
            curA = curA->next;
        } else if (curA->next == NULL && !headAreturn) {
            headAreturn = 1;
            curA = headB;
        } else if (curA->next == NULL && headAreturn){
            break;
        }

        if (curB->next != NULL) {
            curB = curB->next;
        } else if (curB->next == NULL && !headBreturn) {
            headBreturn = 1;
            curB = headA;
        } else if (curB->next == NULL && headBreturn){
            break;
        }
    }
    return NULL;
}