Merge Two Sorted Lists_Leetcode_#21

最新推荐文章于 2024-02-04 15:23:14 发布

LittleBob180

最新推荐文章于 2024-02-04 15:23:14 发布

阅读量203

点赞数

分类专栏： Leetcode刷题笔记

本文链接：https://blog.csdn.net/LittleBob180/article/details/52214154

版权

Leetcode刷题笔记专栏收录该内容

63 篇文章 0 订阅

订阅专栏

1.题目
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.

2.解法

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

        return pHead;
    }
}