首页 > 其他 > 详细

[Leetcode]-- Merge Two Sorted Lists

时间:2014-01-25 19:22:07      阅读:385      评论:0      收藏:0      [点我收藏+]
bubuko.com,布布扣
/**
 * 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(-1);
        ListNode p = head;
        while(l1 != null && l2 != null){
            if(l1.val <= l2.val){
                p.next = l1;
                l1 =l1.next;
            }else{
                p.next = l2;
                l2 = l2.next;
            }
            p = p.next;
        }
        
        if(l1 != null){
            p.next = l1;
            p = p.next;
        }
        
        if(l2 != null){
            p.next = l2;
            p = p.next;
        }
        
        return head.next;
    }
}
bubuko.com,布布扣

[Leetcode]-- Merge Two Sorted Lists

原文:http://www.cnblogs.com/RazerLu/p/3533259.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!