问:
原题链接:相交链表
答:
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) {
* val = x;
* next = null;
* }
* }
*/
public class Solution {
public ListNode getIntersectionNode(ListNode headA, ListNode headB) {
if(headA == null || headB == null)
return null;
ListNode hA = headA,hB = headB;
while(hA != hB)
{
if(hA == null)
{
hA = headB;
}
else
{
hA = hA.next;
}
if(hB == null)
{
hB = headA;
}
else
{
hB = hB.next;
}
// hA = hA == null ? headB : hA.next;
// hB = hB == null ? headA : hB.next;
}
return hA;
}
}