2. Add Two Numbers
来源:互联网 发布:东莞好玩的地方知乎 编辑:程序博客网 时间:2024/06/05 11:51
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
# Definition for singly-linked list.# class ListNode(object):# def __init__(self, x):# self.val = x# self.next = Noneclass Solution(object): def addTwoNumbers(self, l1, l2): """ :type l1: ListNode :type l2: ListNode :rtype: ListNode """ dummy = ListNode(0) node = dummy carry = 0 while l1 or l2 or carry: sum, carry = carry, 0 if l1: sum += l1.val l1 = l1.next if l2: sum += l2.val l2 = l2.next if sum > 9: carry = 1 sum -= 10 node.next = ListNode(sum) node = node.next return dummy.next
0 0
- 2.Add Two Numbers
- 2.Add Two Numbers
- 2.Add Two Numbers
- 2.Add Two Numbers
- 2. Add Two Numbers
- 2. Add Two Numbers
- 2.Add Two Numbers
- 2. Add Two Numbers
- 2. Add Two Numbers
- 2. Add Two Numbers
- 2. Add Two Numbers
- 2. Add Two Numbers
- 2. Add Two Numbers
- 2. Add Two Numbers
- 2. Add Two Numbers
- 2.Add Two Numbers
- 2. Add Two Numbers
- 2. Add Two Numbers
- 在Ubuntu下搭建SublimeText3
- 关于笔记本的一些问题
- MySQL学习笔记2——MySQL基础操作
- JNI函数的注册方法
- c#中的代理模式
- 2. Add Two Numbers
- apple pay开发支付流程及绑卡流程
- E
- Android手机判断网络是否可用
- Makefile简介1
- 深度理解链式前向星
- nyoj93 汉诺塔(三)
- js面向对象之构造函数、封装与继承
- SpringJDBC 学习笔记