ListNode function ( ListNode arg0 , int arg1 ) { ListNode loc0 = arg0 ; ListNode loc1 = arg0 . next ; while ( loc1 . val >= arg1 && loc1 != arg0 ) { loc1 = loc1 . next ; loc0 = loc0 . next ; } ListNode loc2 = new ListNode ( arg1 ) ; loc0 . next = loc2 ; loc2 . next = loc1 ; return arg1 < arg0 . val ? loc2 : arg0 ; }
insert a number in a sorted cyclic list 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 firstCommon concode_elem_sep void interleaving 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