• 题目描述:输入两个非空单链表,链表的每个结点的值是一个1位数整数,两个链表都是一个大整数每一位的逆序排序,求这两个链表代表的整数的和的链表值;

  • 思路:

  1. 分别遍历两个链表,转化成相应的整数,求和后把结果每一位转化成单链表即可;
class Solution(object):
    def addTwoNumbers(self, l1, l2):
        """
        :type l1: ListNode
        :type l2: ListNode
        :rtype: ListNode
        """
        a = b = 0
        carry = 0
        while l1:
            a += l1.val * 10 ** carry
            carry += 1
            l1 = l1.next
        carry = 0
        while l2:
            b += l2.val * 10 ** carry
            carry += 1
            l2 = l2.next
        ret = a + b
        h = m = ListNode(0)
        if not ret:
            return h
        while ret:
            m.next = ListNode(ret % 10)
            ret /= 10
            m = m.next
        return h.next 

相关文章:

  • 2021-09-08
  • 2021-12-22
  • 2021-08-26
  • 2021-07-13
  • 2021-10-05
  • 2022-01-23
  • 2021-11-26
猜你喜欢
  • 2021-12-10
  • 2022-01-11
  • 2021-10-15
  • 2021-06-22
  • 2021-07-10
  • 2021-12-26
  • 2021-09-27
相关资源
相似解决方案