leetcode--Merge Two Sorted Lists

时间：2014-06-11 22:56:31 收藏：0 阅读：257

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.

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

leetcode--Merge Two Sorted Lists,布布扣,bubuko.com