原题网址:https://leetcode.com/problems/merge-two-sorted-lists/
Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.
代码:
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
public class Solution {
public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
ListNode merged = new ListNode(0);
ListNode current = merged;
while (l1 != null || l2 != null) {
if (l1 == null) {
current.next = l2;
break;
} else if (l2 == null) {
current.next = l1;
break;
} else if (l1.val <= l2.val) {
current.next = l1;
l1 = l1.next;
current = current.next;
current.next = null;
} else {
current.next = l2;
l2 = l2.next;
current = current.next;
current.next = null;
}
}
return merged.next;
}
}