题目
将两个有序链表合并为一个新的有序链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
示例:
输入:1->2->4, 1->3->4
输出:1->1->2->3->4->4
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/merge-two-sorted-lists
解答
话不多说,直接看代码就懂了
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
ListNode rel = new ListNode(0);
ListNode head = rel;
while(l1 != null && l2 != null) {
ListNode temp = new ListNode(0);
if (l1.val > l2.val) {
temp.val = l2.val;
rel.next = temp;
l2 = l2.next;
}else {
temp.val = l1.val;
rel.next = temp;
l1 = l1.next;
}
rel = rel.next;
}
if (l1 != null) {
rel.next = l1;
}
if (l2 != null) {
rel.next = l2;
}
return head.next;
}
}
结果