void function ( ListNode arg0 , ListNode arg1 ) { while ( arg0 != null && arg1 != null ) { ListNode loc0 = arg0 . next ; ListNode loc1 = arg1 . next ; arg0 . next = arg1 ; if ( loc0 == null ) return ; arg1 . next = loc0 ; arg0 = loc0 ; arg1 = loc1 ; } }
create temp node for both next concode_field_sep PlaceHolder placeHolder concode_field_sep ListNode interleavingMerge concode_elem_sep ListNode deleteDuplicatesOnce concode_elem_sep ListNode getMiddle concode_elem_sep int length concode_elem_sep ListNode insert concode_elem_sep ListNode firstCommon concode_elem_sep ListNode detectCycle concode_elem_sep void reorderList concode_elem_sep boolean hasCycle concode_elem_sep ListNode deleteDuplicates concode_elem_sep ListNode partition concode_elem_sep ListNode getMiddlePre concode_elem_sep boolean detectIntersection