Merge two sorted linked lists
Question:
Input two monotonically increasing linked lists, and output the linked list after combining the two linked lists. Of course, we need the combined linked list to satisfy the monotonically non-decreasing rule.
Code:
package com.hlq.test;
/**
* @author helongqiang
* @date 2020/5/18 20:58
*/
/**
* 输入两个单调递增的链表，输出两个链表合成后的链表，
* 当然我们需要合成后的链表满足单调不减规则。
*/
public class Solution {
public ListNode Merge(ListNode list1,ListNode list2){
ListNode h = new ListNode(-1);
ListNode cur = h;
while (list1 != null && list2 != null){
if(list1.val <= list2.val){
cur.next = list1;
list1 = list1.next;
}else{
cur.next = list2;
list2 = list2.next;
}
cur = cur.next;
}
if (list1 != null){
cur.next = list1;
}
if(list2 != null){
cur.next = list2;
}
return h.next;
}
}