160. Intersection of Two Linked Lists, C++

description:
https://leetcode.com/problems/intersection-of-two-linked-lists/

code.1:

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) {
        if (headA == NULL || headB == NULL) {
            return NULL;
        }
        
        int lenA=0, lenB=0;
        ListNode *tempA = headA, *tempB = headB;
        while (tempA != NULL || tempB != NULL) {
            if (tempA != NULL) {
                ++lenA;
                tempA = tempA->next;
            }
            if (tempB != NULL) {
                ++lenB;
                tempB = tempB->next;
            }
        }
        int diff = lenA - lenB;
        tempA = headA;
        tempB = headB;
        if (diff > 0) {
            while(diff--) tempA = tempA->next;
        } else if (diff < 0) {
            while(diff++) tempB = tempB->next;
        }
        while(tempA != NULL && tempA != tempB) {
            tempA = tempA->next;
            tempB = tempB->next;
        }
        if (tempA == NULL) {
            return NULL;
        } else {
            return tempA;
        }
    }
};

result.1:
在这里插入图片描述
code.2:

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) {
        if (!headA || !headB)  return NULL;
        ListNode *tempA = headA, *tempB = headB;
        while (tempA != tempB) {
            tempA = tempA ? tempA->next : headB;
            tempB = tempB ? tempB->next : headA;
        }
        return tempA;
    }
};

result.2:
在这里插入图片描述
personal opinion:
Notice that {
You may assume there are no cycles anywhere in the entire linked structure.
Your code should preferably run in O(n) time and use only O(1) memory.
}
thank the author of https://www.cnblogs.com/grandyang/p/4128461.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值