ListNode *findFirstCommonNode(ListNode *headA, ListNode *headB) {
auto p1 = headA, p2 = headB;
while (p1 != p2)
{
if (p1) p1 = p1->next;
else p1 = headB;
if (p2) p2 = p2->next;
else p2 = headA;
}
return p1;
}
TaoZex
访客：36391
离线：1天前
活动打卡代码
AcWing 66. 两个链表的第一个公共结点
活动打卡代码
AcWing 65. 数组中的逆序对
ListNode *findFirstCommonNode(ListNode *headA, ListNode *headB) {
auto p1 = headA, p2 = headB;
while (p1 != p2)
{
if (p1) p1 = p1->next;
else p1 = headB;
if (p2) p2 = p2->next;
else p2 = headA;
}
return p1;
}
活动打卡代码
AcWing 64. 字符流中第一个只出现一次的字符
ListNode *findFirstCommonNode(ListNode *headA, ListNode *headB) {
auto p1 = headA, p2 = headB;
while (p1 != p2)
{
if (p1) p1 = p1->next;
else p1 = headB;
if (p2) p2 = p2->next;
else p2 = headA;
}
return p1;
}
活动打卡代码
AcWing 63. 字符串中第一个只出现一次的字符
ListNode *findFirstCommonNode(ListNode *headA, ListNode *headB) {
auto p1 = headA, p2 = headB;
while (p1 != p2)
{
if (p1) p1 = p1->next;
else p1 = headB;
if (p2) p2 = p2->next;
else p2 = headA;
}
return p1;
}
活动打卡代码
AcWing 62. 丑数
ListNode *findFirstCommonNode(ListNode *headA, ListNode *headB) {
auto p1 = headA, p2 = headB;
while (p1 != p2)
{
if (p1) p1 = p1->next;
else p1 = headB;
if (p2) p2 = p2->next;
else p2 = headA;
}
return p1;
}
活动打卡代码
AcWing 61. 最长不含重复字符的子字符串
ListNode *findFirstCommonNode(ListNode *headA, ListNode *headB) {
auto p1 = headA, p2 = headB;
while (p1 != p2)
{
if (p1) p1 = p1->next;
else p1 = headB;
if (p2) p2 = p2->next;
else p2 = headA;
}
return p1;
}
活动打卡代码
AcWing 59. 把数字翻译成字符串
ListNode *findFirstCommonNode(ListNode *headA, ListNode *headB) {
auto p1 = headA, p2 = headB;
while (p1 != p2)
{
if (p1) p1 = p1->next;
else p1 = headB;
if (p2) p2 = p2->next;
else p2 = headA;
}
return p1;
}
活动打卡代码
AcWing 58. 把数组排成最小的数
ListNode *findFirstCommonNode(ListNode *headA, ListNode *headB) {
auto p1 = headA, p2 = headB;
while (p1 != p2)
{
if (p1) p1 = p1->next;
else p1 = headB;
if (p2) p2 = p2->next;
else p2 = headA;
}
return p1;
}
活动打卡代码
AcWing 57. 数字序列中某一位的数字
ListNode *findFirstCommonNode(ListNode *headA, ListNode *headB) {
auto p1 = headA, p2 = headB;
while (p1 != p2)
{
if (p1) p1 = p1->next;
else p1 = headB;
if (p2) p2 = p2->next;
else p2 = headA;
}
return p1;
}
活动打卡代码
AcWing 74. 数组中唯一只出现一次的数字
ListNode *findFirstCommonNode(ListNode *headA, ListNode *headB) {
auto p1 = headA, p2 = headB;
while (p1 != p2)
{
if (p1) p1 = p1->next;
else p1 = headB;
if (p2) p2 = p2->next;
else p2 = headA;
}
return p1;
}
