LeetCode解题报告--Merge Two Sorted Lists

**题目：**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.

分析：题意要求将两个排好序List链表整合为一个List链表。
1)定义两个ListNode对象p,q(C/C++指针)分别指向给定两链表l1,l2,同时定义一个新的listnode对象newHead，用于存储整合后的链表
2)p,q分别进行比较，元素小的先放入head,直至l1,l2其中一个遍历结束，剩下未遍历完的list直接attach到head。至此所有元素都整合完毕

Java Accepted 代码：

/**
 * 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 p1 = l1;
        ListNode p2 = l2;

        ListNode head = new ListNode(0);
        ListNode p = head;

        while(p1 != null && p2 != null){
            if(p1.val <= p2.val){
                p.next = p1;
                p1 = p1.next;
            }else{
                p.next = p2;
                p2 = p2.next;
            }
            p = p.next;
        }

        if(p1 == null){
            p.next = p2;
        }else if(p2 == null){
            p.next = p1;
        }

        return head.next;
    }
}

相关代码放在个人github:https://github.com/gannyee/LeetCode/