leetcode笔记 21. Merge Two Sorted Lists

最新推荐文章于 2024-09-14 00:15:00 发布

Estelle-vc

最新推荐文章于 2024-09-14 00:15:00 发布

阅读量73

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/qq_29868413/article/details/88864152

版权

leetcode 专栏收录该内容

25 篇文章 0 订阅

订阅专栏

leetcode刷题第六天！
21. 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.

Example:

Input: 1->2->4, 1->3->4
Output: 1->1->2->3->4->4

class Solution {
    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
      	ListNode head = new ListNode(0);
    	ListNode cur = head;
    	while(l1!=null&&l2!=null) {
        		if(l1.val>=l2.val) {
        			cur.next = l2;
        			cur = cur.next;
        			l2 = l2.next;
       
        		}
        		else {
           			cur.next = l1;
        			cur = cur.next;
        			l1 = l1.next;
        		
        		}    			
    	
    	}
    	if(l2!=null) {
    		cur.next = l2;
    	}
    	if(l1!=null) {
    		cur.next =  l1;
    	}
    	return head.next;
    }
}