题目描述
输入两个单调递增的链表,输出两个链表合成后的链表,当然我们需要合成后的链表满足单调不减规则。
思路:先创建一个头结点 head ,head.val为-1,然后创建一个指向该头结点的指针pre,然后用if判断用pre去链接接下的结点
代码如下:
/*
public class ListNode {
int val;
ListNode next = null;
ListNode(int val) {
this.val = val;
}
}*/
public class Solution {
public ListNode Merge(ListNode list1,ListNode list2) {
ListNode pre =new ListNode(-1);
ListNode head =null;
head =pre;
while(list1 != null && list2 != null){
if(list1.val < list2.val){
head.next =list1;
head = head.next;
list1 = list1.next;
}else if(list1.val > list2.val){
head.next =list2;
head = head.next;
list2= list2.next;
}else{
head.next =list1;
head =head.next;
list1 =list1.next;
head.next =list2;
head = head.next;
list2= list2.next;
}
}
while(list1 != null){
head.next =list1;
head = head.next;
list1= list1.next;
}
while(list2 != null){
head.next =list2;
head = head.next;
list2= list2.next;
}
return pre.next;
}
}