LeetCode-Merge Two Sorted Lists

作者：disappearedgod

文章出处：http://blog.csdn.net/disappearedgod/article/details/24016831

时间：2014-4-18

题目

Merge Two Sorted Lists

  Total Accepted: 12680  Total Submissions: 39405 My Submissions

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;
         next = null;
     }
 }
 

解法

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) {
 *         val = x;
 *         next = null;
 *     }
 * }
 */
public class Solution {
    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
        ListNode dummy = new ListNode(0);
        ListNode p = dummy;
        ListNode p1 = l1;
        ListNode p2 = l2;
        
        while(p1!=null && p2!=null){
            if(p1.val>=p2.val){
                p.next = p2;
                p2 = p2.next;
            }
            else{
                p.next = p1;
                p1 = p1.next;
            }
            p=p.next;
        }
        for(;p1!=null;p1= p1.next,p = p.next){
            p.next =p1;
        }
       for(;p2!=null;p2= p2.next,p = p.next){
            p.next =p2;
        }
        
        return dummy.next;
        
    }
}

返回

LeetCode Solution(持续更新，java>c++)