leetcode

0 class Solution {

1 public:

2 ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) {

3 if (!headA || !headB) return nullptr;

4

5 ListNode *res = nullptr;

6

7 for (ListNode *p = headA; p; p = p->next)

8 p->val = -p->val;

9

10 for (ListNode *p = headB; p; p = p->next)

11 if (p->val < 0) {

12 res = p;

13 break;

14 }

15

16 for (ListNode *p = headA; p; p = p->next)

17 p->val = -p->val;

18

19 return res;

20 }

21 };