[Leetcode] 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.

Solution:

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

 

posted @ 2014-10-21 01:43  Phoebe815  阅读(127)  评论(0)  编辑  收藏  举报