Merge Two Sorted Lists
Merge two sorted (ascending) linked lists and return it as a new sorted list. The new sorted list should be made by splicing together the nodes of the two lists and sorted in ascending order.
Example
设定dummyNode
Given 1->3->8->11->15->null
, 2->null
, return 1->2->3->8->11->15->null
.
/**
* Definition for ListNode.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int val) {
* this.val = val;
* this.next = null;
* }
* }
*/
public class Solution {
/**
* @param ListNode l1 is the head of the linked list
* @param ListNode l2 is the head of the linked list
* @return: ListNode head of linked list
*/
public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
// write your code here
if (l1 == null) {
return l2;
}
if (l2 ==null) {
return l1;
}
ListNode dummyNode = new ListNode(0);
ListNode tmp = dummyNode;
while(l1 != null && l2 != null) {
if (l1.val < l2.val) {
dummyNode.next = l1;
dummyNode = dummyNode.next;
l1 = l1.next;
} else {
dummyNode.next = l2;
dummyNode = dummyNode.next;
l2 = l2.next;
}
}
if (l1!= null) {
dummyNode.next = l1; //能if绝对不while
}
if (l2 != null) {
dummyNode.next = l2;
}
return tmp.next;
}
}
设定dummyNode