Merge Two Sorted Lists

Link:http://oj.leetcode.com/problems/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.

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

        result = head.next;
        return result;
    }
}

没啥好说的。就是感觉代码不够decent。。循环中也可以不开新的空间。。