Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
55 lines (44 loc) · 1.01 KB

File metadata and controls

55 lines (44 loc) · 1.01 KB
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
/**
* 剑指Offer,两个链表的第一个公共节点
*/
/*
public class ListNode {
int val;
ListNode next = null;
ListNode(int val) {
this.val = val;
}
}*/
public class LinkLisdCommonNode {
public ListNode FindFirstCommonNode(ListNode pHead1, ListNode pHead2) {
int len1 = 0, len2=0;
ListNode p1 = pHead1, p2 = pHead2;
while (p1 != null) {
len1++;
p1 = p1.next;
}
while (p2 != null) {
len2++;
p2 = p2.next;
}
p1 = pHead1;
p2 = pHead2;
if (len1 > len2) {
for (int i = 0; i < len1 - len2; i++) {
p1 = p1.next;
}
}else {
for (int i = 0; i < len2 - len1; i++) {
p2 = p2.next;
}
}
while (p1 != null) {
if (p1 == p2) {
return p1;
}
p1 = p1.next;
p2 = p2.next;
}
return null;
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.