(java)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.

解题思路：
就是拿两个链表组合成一个，这个还是比较简单的直接上代码。

[java] view plain copy

print ?

1. /** 
2.  * Definition for singly-linked list. 
3.  * public class ListNode { 
4.  *     int val; 
5.  *     ListNode next; 
6.  *     ListNode(int x) { val = x; } 
7.  * } 
8.  */  
9. public class Solution {  
10.     public ListNode mergeTwoLists(ListNode l1, ListNode l2) {  
11.         ListNode result = new ListNode(0);  
12.         ListNode p = result;  
13.         while(l1 != null || l2 != null)  
14.         {  
15.             if(l1 == null)  
16.             {  
17.                 p.next = l2;  
18.                 break;  
19.             }  
20.             if(l2 == null)  
21.             {  
22.                 p.next = l1;  
23.                 break;  
24.             }  
25.             if(l1.val < l2.val)  
26.             {  
27.                 p.next = l1;  
28.                 l1 = l1.next;  
29.             }  
30.             else  
31.             {  
32.                 p.next = l2;  
33.                 l2 = l2.next;  
34.             }  
35.             p = p.next;       
36.         }  
37.         return result.next;  
38.     }  
39. }  

/**
 * 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 result = new ListNode(0);
		ListNode p = result;
		while(l1 != null || l2 != null)
		{
			if(l1 == null)
			{
				p.next = l2;
				break;
			}
			if(l2 == null)
			{
				p.next = l1;
				break;
			}
			if(l1.val < l2.val)
			{
				p.next = l1;
				l1 = l1.next;
			}
			else
			{
				p.next = l2;
				l2 = l2.next;
			}
			p = p.next;		
		}
		return result.next;
    }
}