合并两个有序链表
有两张方法,一种遍历,一种递归 。遍历:其实思路很简单,只要从比较二个链表的第一个节点,谁小就先取谁,取了后就在走到该链表的下一个节点。然后再进行比较,如果有链表走完,那直接将目的链表指向剩下的链表即可。废话少说,上代码。
public class ListNode { int val; ListNode next; ListNode(int x) { val = x; } }
递归:如果有一个链表为空,直接返回另一个链表,否则,比较两个链表当前节点大小,进行递归 。public ListNode mergeTwoLists(ListNode l1, ListNode l2) { ListNode l3 = new ListNode(0); ListNode head = l3; while(l1 != null && l2 != null){ <span style="white-space:pre"> </span>if(l1.val < l2.val){ <span style="white-space:pre"> </span>l3.next = l1; <span style="white-space:pre"> </span>l1 = l1.next; <span style="white-space:pre"> </span>}else{ <span style="white-space:pre"> </span>l3.next = l2; <span style="white-space:pre"> </span>l2 = l2.next; <span style="white-space:pre"> </span>} <span style="white-space:pre"> </span>l3 = l3.next; } if(l1 == null) l3.next = l2; if(l2 == null) l3.next = l1; return head.next; }
public ListNode mergeTwoLists(ListNode l1, ListNode l2) { if(l1 == null) return l2; if(l2 == null) return l1; if(l1.val < l2.val){ <span style="white-space:pre"> </span>l1.next = mergeTwoLists(l1.next, l2); <span style="white-space:pre"> </span>return l1; }else{ <span style="white-space:pre"> </span>l2.next = mergeTwoLists(l1, l2.next); <span style="white-space:pre"> </span>return l2; } }