728x90
2. Add Two 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 contains a single digit. Add the two numbers and return the sum as a linked list.
You may assume the two numbers do not contain any leading zero, except the number 0 itself.
Examples
1:
Input: l1 = [2,4,3], l2 = [5,6,4]
Output: [7,0,8]
Explanation: 342 + 465 = 807.
2:
Input: l1 = [0], l2 = [0]
Output: [0]
3:
Input: l1 = [9,9,9,9,9,9,9], l2 = [9,9,9,9]
Output: [8,9,9,9,0,0,0,1]
Constraints:
- The number of nodes in each linked list is in the range
[1, 100]
. 0 <= Node.val <= 9
- It is guaranteed that the list represents a number that does not have leading zeros.
Python solution
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, val=0, next=None):
# self.val = val
# self.next = next
class Solution:
def addTwoNumbers(self, l1: Optional[ListNode], l2: Optional[ListNode]) -> Optional[ListNode]:
dummy = cur = ListNode(0)
carry = 0
while l1 or l2 or carry:
if l1:
carry += l1.val
l1 = l1.next
if l2:
carry += l2.val
l2 = l2.next
carry, n = divmod(carry, 10)
cur.next = ListNode(n)
cur = cur.next
return dummy.next
728x90
'알고리즘 > LeetCode' 카테고리의 다른 글
[Python] Longest Palindromic Substring - LeetCode (0) | 2021.09.23 |
---|---|
[Python] Median of Two Sorted Arrays - LeetCode (0) | 2021.09.16 |
[Python] Longest Substring Without Repeating Characters - LeetCode (0) | 2021.09.16 |
[Python] Two Sum - LeetCode (0) | 2021.09.16 |
댓글