关于链表的题

2 add 2 numbers

• 题目描述
  You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.
  You may assume the two numbers do not contain any leading zero, except the number 0 itself.
• 示例
  Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
  Output: 7 -> 0 -> 8
  Explanation: 342 + 465 = 807.
• 思路
  基本做法就是链表的一个遍历过程。注意进位

# Definition for singly-linked list.
# class ListNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution(object):
    def addTwoNumbers(self, l1, l2):
        """
        :type l1: ListNode
        :type l2: ListNode
        :rtype: ListNode
        """
        l = ListNode(0)
        p = l
        flag=0     
        while l1 and l2:
            summ = l1.val + l2.val + flag
            new = ListNode(summ%10)
            l.next = new
            l = l.next
            flag = summ//10
            l1, l2 = l1.next, l2.next        
        while l1 != None:
            summ = l1.val+flag
            new = ListNode(summ%10)
            flag = summ//10
            l.next = new
            l = l.next
            l1 = l1.next      
        while l2 != None:
            summ = l2.val+flag
            new = ListNode(summ%10)
            flag = summ//10
            l.next = new
            l = l.next
            l2 = l2.next     
        if flag == 1:
            new = ListNode(1)
            l.next = new       
        return p.next

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.
• 实例
  Input: 1->2->4, 1->3->4
  Output: 1->1->2->3->4->4
• 思路
  链表的遍历，遍历过程中比较值的大小即可

# Definition for singly-linked list.
# class ListNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution(object):
    def mergeTwoLists(self, l1, l2):
        """
        :type l1: ListNode
        :type l2: ListNode
        :rtype: ListNode
        """
        if not l1:
            return l2
        if not l2:
            return l1
        node = ListNode(0)
        p = node
        while l1 and l2:
            if l1.val > l2.val:
                p.next = l2
                l2 = l2.next
            else:
                p.next = l1
                l1 = l1.next
            p = p.next
        if l1:
            p.next = l1
        if l2:
            p.next = l2
        return node.next

23. Merge k Sorted Lists

• 题目描述
  Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.
• 实例
  Input:
  [
  1->4->5,
  1->3->4,
  2->6
  ]
  Output: 1->1->2->3->4->4->5->6
• 思路
  两个两个的合并

# Definition for singly-linked list.
# class ListNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution(object):
    def merge(self,p1,p2):
        if p1 == None:
            return p2
        if p2 == None:
            return p1
        new = ListNode(0)
        new.next = p1
        pre1 = new
        while p1!=None and p2!=None:
            if p1.val<p2.val:
                pre1 = p1
                p1 = p1.next
            else:
                pre1.next = p2
                pre1 = p2
                p2 = p2.next
                pre1.next = p1
        if p1==None:
            pre1.next = p2
        return new.next
    def mergeKLists(self, lists):
        """
        :type lists: List[ListNode]
        :rtype: ListNode
        """
        if lists == None or len(lists) < 1:
            return
        if len(lists) == 1:
            return lists[-1]
        for i in range(len(lists)-1):
            res = self.merge(lists[-1],lists[-2])
            lists.pop()
            lists.pop()
            lists.append(res)
        return lists[-1]