合并两个排序的链表

思路:

• 比较两个链表的首结点，哪个小的的结点则合并到第三个链表尾结点，并向前移动一个结点。
• 步骤一结果会有一个链表先遍历结束，或者没有
• 第三个链表尾结点指向剩余未遍历结束的链表
• 返回第三个链表首结点

  # -*- coding:utf-8 -*-
  # class ListNode:
  #     def __init__(self, x):
  #         self.val = x
  #         self.next = None
  class Solution:
      # 返回合并后列表
      def Merge(self, pHead1, pHead2):
          # write code here
          res = head = ListNode(0)
          while pHead1 and pHead2:
              if pHead1.val < pHead2.val:
                  head.next = pHead1
                  pHead1 = pHead1.next
              elif pHead1.val >= pHead2.val:
                  head.next = pHead2
                  pHead2 = pHead2.next
              head = head.next
          head.next = pHead1 or pHead2
          return res.next