FilesExpand file tree

 master

/

IntersectionofTwoLinkedLists_160.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

41 lines (40 loc) · 1.01 KB

 master

/

IntersectionofTwoLinkedLists_160.java

Copy path

Top

File metadata and controls

• Code
• Blame

41 lines (40 loc) · 1.01 KB

Raw

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

package Lists;

/**

* 如果存在，则返回两个链表第一个汇聚的结点

*/

public class IntersectionofTwoLinkedLists_160 {

public ListNode getIntersectionNode(ListNode headA, ListNode headB) {

ListNode result=null;

if(headA==null||headB==null) return result;

int lenA=0;

int lenB=0;

int dis=0;

ListNode tempA=headA;

ListNode tempB=headB;

while(tempA!=null){

lenA++;

tempA=tempA.next;

}

while (tempB!=null){

lenB++;

tempB=tempB.next;

}

if(lenA<lenB){

dis=lenB-lenA;

ListNode temp;

temp=headB;

headB=headA;

headA=temp;

}else

dis=lenA-lenB;

for(int i=0;i<dis;i++){

headA=headA.next;

}

while (headA!=null&&headB!=null&&headA!=headB){

headA=headA.next;

headB=headB.next;

}

result=headA;

return result;

}

}