13. Hash table - the first common node of two linked lists

• Title Description
  Input ：[1,2,3,5,7,8,9] And [0,10,5,7,8,9]
  Output ：[5]

public ListNode getIntersectionNode(ListNode headA, ListNode headB) {
        Set<ListNode> visited = new HashSet<ListNode>();
        ListNode temp = headA;
        while(temp != null){
            visited.add(temp);
            temp = temp.next;
        }
        temp = headB;
        while(temp != null){
            if(visited.contains(temp)){
                return temp;
            }
           temp = temp.next; 
        }
        return null;
    }

The first thought is to use hash table , But the time complexity is slightly higher , It needs to be optimized .