?合併兩個排序連結串列
阿新 • • 發佈:2018-12-27
public class Solution { public ListNode Merge(ListNode list1,ListNode list2) { if(list1 == null){ return list2; } if(list2 == null){ return list1; } if(list1 == null && list2 == null){ return null; } ListNode pMergeHead = null; if(list1.val < list2.val){ pMergeHead = list1; pMergeHead.next = Merge(list1.next,list2); } else{ pMergeHead = list2; pMergeHead.next = Merge(list1,list2.next); } return pMergeHead; } }
Merge()??