leetcode刷题_合并两个有序链表

题目描述

Java解决方法

/**
 * 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 l1, ListNode l2) {
        ListNode l3 = new ListNode();
        ListNode l4 = l3;
        while(l1 != null && l2 != null)
        {
            if(l1.val > l2.val)
            {
                l4.next = l2;
                l4 = l4.next;
                l2 = l2.next;
            }
            else
            {
                l4.next = l1;
                l4 = l4.next;
                l1 = l1.next;
            }
        }
        if(l1 != null)
        {
            l4.next = l1;
        }
        else
        {
            l4.next = l2;
        }
        return l3.next;
    }
}

运行结果：