leetcode.jp 博客
本网站所有文字及图片内容均来自网络,每周定时更新,仅供个人学习与研究,请勿用于商业用途。谢谢合作。

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

Difficulty:

Easy

Lock:

Normal

Company:

Adobe Airbnb Alibaba Amazon Apple Arista Networks Atlassian Bloomberg ByteDance Cisco Facebook Google Huawei Indeed Intel LinkedIn Lyft Microsoft Oracle Tencent Uber Visa VMware Walmart Labs Yahoo Yandex

Solution(Chinese):

LEETCODE 21. Merge Two Sorted Lists 解题思路分析