Merge Two Sorted Lists

14 篇文章 0 订阅
13 篇文章 0 订阅

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.

1. iterative implementation

Analysis: Use the list which contains the smallest element as the one "being merged" in this problem. 

/**
 * 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;
        else if(l2==null) return l1;
        
        ListNode sortedList = new ListNode(-1);
        ListNode pre = null;
        ListNode cur = null;
        ListNode cur1 = null;

        if(l1.val <= l2.val) {
            sortedList.next = l1;
            pre = l1;
            cur = l1.next;
            cur1 = l2;
        }
        else {
            sortedList.next = l2;
            pre = l2;
            cur = l2.next;
            cur1 = l1;
        }
        
        while(cur1 != null) {
            if(cur == null) {
                pre.next = cur1;
                break;
            }
            
            if(cur.val > cur1.val) {
                pre.next = cur1;
                cur1 = cur1.next;
                pre.next.next = cur;
            }
            else {
                cur = cur.next;
            }
            pre = pre.next;
        }
        
        return sortedList.next;
    }
}

2. recursive implementation

/**
 * 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;
        else if(l2==null) return l1;
        
        ListNode result = null;
        
        if(l1.val <= l2.val) {
            result = l1;
            result.next = mergeTwoLists(l1.next, l2);
        }
        else {
            result = l2;
            result.next = mergeTwoLists(l1, l2.next);
        }
        
        return result;
    }
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 1
    评论
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值