LeetCode刷题---合并两个有序链表

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode() {}
 *     ListNode(int val) { this.val = val; }
 *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
 * }
 */
class Solution {
    public ListNode mergeTwoLists(ListNode list1, ListNode list2) {

        //创建头结点
        ListNode head=new ListNode();
        //创建辅助指针
        ListNode last=head;

        while(list1!=null && list2!=null)
        {
            if(list1.val<list2.val)
            {
                last.next=list1;
                list1=list1.next;
            }else
            {
                last.next=list2;
                list2=list2.next;
            }
            last=last.next;
        }

        //当list1和list2有一个为空的时候
        if(list1!=null)
        {
            last.next=list1;
        }
        else
        {
            last.next=list2;
        }

        return head.next;

    }
}