首页 > 代码库 > Leetcode---21. Merge Two Sorted Lists
Leetcode---21. Merge Two Sorted Lists
Description:
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.
Solution:
https://leetcode.com/submissions/detail/109508058/
/** * Definition for singly-linked list. * function ListNode(val) { * this.val = val; * this.next = null; * } *//** * @param {ListNode} l1 * @param {ListNode} l2 * @return {ListNode} */var mergeTwoLists = function(l1, l2) { if(l1 == null) return l2; if(l2 == null) return l1; if(l1.val >l2.val) { l2.next =mergeTwoLists(l1,l2.next); return l2; }else { l1.next = mergeTwoLists(l1.next, l2); return l1; }};
Leetcode---21. Merge Two Sorted Lists
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。