将两个排序链表合并为一个新的排序链表
您在真实的面试中是否遇到过这个题?给出 1->3->8->11->15->null
,2->null
, 返回 1->2->3->8->11->15->null
。
相关题目 Expand
/**
* 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
ListNode left = l1;
ListNode right = l2;
ListNode resut = new ListNode(-1);
ListNode x = resut;
while (null != left && null != right) {
if (left.val <= right.val) {
x.next = left;
left = left.next;
x = x.next;
} else {
x.next = right;
right = right.next;
x = x.next;
}
}
if (null != left) {
while (left != null) {
x.next = left;
left = left.next;
x = x.next;
}
}
if (null != right) {
while (null != right) {
x.next = right;
right = right.next;
x = x.next;
}
}
return resut.next;
}
}