clueless coding // TODO: be smarter

LeetCode Intersection of Two Linked Lists: Java Solution

TL;DR Code Solution

    public ListNode getIntersectionNode(ListNode headA, ListNode headB) {

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

    ListNode a = headA;
    ListNode b = headB;

    //if a & b have different len, then we will stop the loop after second iteration
    while( a != b){
    	//for the end of first iteration, we just reset the pointer to the head of another linkedlist
        a = a == null? headB :;
        b = b == null? headA :;    

    return a;