021 Merge Two Sorted Lists

Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.

Subscribe to see which companies asked this question

这个的思路就是用两个指针走

代码如下

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
public class Solution {
    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
        ListNode head,q;
        if(l1==null&&l2==null)return null;
        if(l1==null) return l2;
        if(l2==null) return l1;
        if(l1.val>l2.val){
            head=q=l2;
            l2=l2.next;
        }else{
            head=q=l1;
            l1=l1.next;
        }
        while(l1!=null&&l2!=null){
            if(l1.val>l2.val){
                q.next=l2;
                l2=l2.next;
            }else{
                q.next=l1;
                l1=l1.next;
            }
            q=q.next;
        }
        if(l1==null){
            q.next=l2;
        }else{
            q.next=l1;
        }
        return head;
    }
}