21. Merge Two Sorted Lists
Posted CodesKiller
tags:
篇首语：本文由小常识网(cha138.com)小编为大家整理，主要介绍了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.
此题考查链表的操作，比较简单，直接上代码：
/**
* 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 head = new ListNode(0);
ListNode dummy = head;
while(l1!=null&&l2!=null){
if(l1.val<l2.val){
ListNode node = new ListNode(l1.val);
l1 = l1.next;
head.next = node;
head = head.next;
}else{
ListNode node = new ListNode(l2.val);
l2 = l2.next;
head.next = node;
head = head.next;
}
}
if(l1!=null){
ListNode node = l1;
head.next = node;
}
if(l2!=null){
ListNode node = l2;
head.next = node;
}
return dummy.next;
}
}
以上是关于21. Merge Two Sorted Lists的主要内容，如果未能解决你的问题，请参考以下文章
[LeetCode] 21. Merge Two Sorted Lists_Easy tag: Linked List