We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
将两个升序链表合并为一个新的升序链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
示例:
输入:1->2->4, 1->3->4 输出:1->1->2->3->4->4
leetcode
The text was updated successfully, but these errors were encountered:
题解来自瓶子君
const mergeTwoLinkedList = (l1, l2) => { if (l1 === null) { return l2 } if (l2 === null) { return l1 } if (l1.val <= l2.val) { l1.next = mergeTwoLinkedList(l1.next, l2) return l1 } else { l2.next = mergeTwoLinkedList(l2.next, l1) return l2 } }
Sorry, something went wrong.
No branches or pull requests
将两个升序链表合并为一个新的升序链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
示例:
leetcode
The text was updated successfully, but these errors were encountered: