LeetCode.21: 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.

Example:

Input: 1->2->4, 1->3->4
Output: 1->1->2->3->4->4

思路：两个有序表合并，两两比较表中的元素，每比较一次将较小的元素插入新链表。当一个链表比较结束后，将另一个链表的剩余元素插入到新链表后面即可。最坏的情况是两个链表中的元素一一比较，所以时间复杂度O（max(m,n)）

package com.Easy.Ryan;

public class MergeTwoSortedLists {
	public static class ListNode {
		int val;
		ListNode next;

		ListNode(int x) {
			val = x;
		}
	}

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		MergeTwoSortedLists mergeTwoSortedLists=new MergeTwoSortedLists();
		ListNode l1=new ListNode(1);
		ListNode l2=new ListNode(1);
		l1.next=new ListNode(1);
		l1.next.next=new ListNode(2);
		l1.next.next.next=new ListNode(3);
		l2.next=new ListNode(3);
		l2.next.next=new ListNode(4);
		ListNode l3=mergeTwoSortedLists.mergeTwoLists(l1, l2);
		for (; l3 != null; l3 = l3.next) {
			System.out.println(l3.val);
		}
	}

	public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
	
		ListNode l3 = new ListNode(0);
		ListNode temp = l3;
		while(l1!=null&&l2!=null) {
			if (l1.val<l2.val) {
				l3.next=l1;
				l3=l3.next;
				l1 = l1.next;
			}else {
				l3.next=l2;
				l3=l3.next;
				l2 = l2.next;
			}
			
		}
		if(l1 == null) {
	        l3.next = l2;
	    } else {
	        l3.next = l1;
	    }
		return temp.next;

	}
}