LeetCode每日一题——T2. 两数相加(中):链表
2019-06-25 19:58
387 查看
版权声明:本文为博主原创文章,遵循 CC 4.0 by-sa 版权协议,转载请附上原文出处链接和本声明。
本文链接:https://blog.csdn.net/qq_41514090/article/details/93649074
要点:链表用法、添加链表节点、地板除法
# Definition for singly-linked list. # class ListNode: # def __init__(self, x): # self.val = x # self.next = None class Solution: def addTwoNumbers(self, l1: ListNode, l2: ListNode) -> ListNode: carry = 0 out = p = ListNode(0) while l1 is not None and l2 is not None: temp = l1.val + l2.val + carry l1 = l1.next l2 = l2.next p.next = ListNode(temp % 10) carry = temp // 10 '''注意要用地板除法''' p = p.next while l1 is not None: temp = l1.val + carry l1 = l1.next p.next = ListNode(temp % 10) carry = temp // 10 '''注意要用地板除法''' p = p.next while l2 is not None: temp = l2.val + carry l2 = l2.next p.next = ListNode(temp % 10) carry = temp // 10 '''注意要用地板除法''' p = p.next if carry: p.next = ListNode(1) out = out.next return out
相关文章推荐
- Leetcode002--单链表两数相加
- LeetCode每日一题 009 两数相加
- leetcode 链表里的两数相加 C++实现
- 链表存储的两数相加(LeetCode 2)
- 【LeetCode-2】 两数相加 (链表)
- LeetCode 02. 两数相加(链表) 03.最大不重复的字符串
- Leetcode 第二题,两数链表相加
- 链表:链表两数相加( LeetCode 2. Add Two Numbers(两数相加))
- Leetcode每日一道 -- 两数相加
- Leetcode 2 两数相加【链表】
- LeetCode 2 两数相加(链表)
- LeetCode 2 : Add Two Numbers ---- 单链表相加
- LeetCode - 66/67 - 两数相加加法模拟
- leetcode 2、两数相加
- leetcode2:两数相加
- Add Two Numbers Leetcode 链表相加
- Leetcode每日一道 -- 两数之和
- leetcodes-2 :两数相加(数组解决方案)(链表解决方案) ★★★
- leetcode 2. 两数相加
- leetcode 两数相加