合并两个排序的数组
输入两个递增排序的链表,合并这两个链表并使新链表中的节点仍然是递增排序的。
做法:双指针
/**
* 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 head = new ListNode(0);
ListNode cur = head;
while(l1 != null && l2 != null){
if(l1.val <= l2.val){
cur.next = new ListNode(l1.val);
l1 = l1.next;
}else{
cur.next = new ListNode(l2.val);
l2 = l2.next;
}
cur = cur.next;
}
//当l1为空,l2不为空
if(l1 == null && l2 != null){
cur.next = l2;
}
if(l1 != null && l2 == null){
cur.next = l1;
}
return head.next;
}
}