leetcode
![[Leetcode] 01. Add Two Numbers (Medium)](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdna%2Fqvn2E%2FbtrtNQ8NQU2%2FAAAAAAAAAAAAAAAAAAAAAIgUkOI9qR18TBBVr5C6llKu6AbMdnfej8YvxQERDdcI%2Fimg.png%3Fcredential%3DyqXZFxpELC7KVnFOS48ylbz2pIh7yKj8%26expires%3D1759244399%26allow_ip%3D%26allow_referer%3D%26signature%3Debjpy1qWDmig%252Bb1YXq%252BTZ8TY3yw%253D)
[Leetcode] 01. Add Two Numbers (Medium)
# 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]: result = ListNode() curr_node = result while True: next_val, curr_node.val = divmod(curr_node.val+l1.val+l2.val, 10) curr_node.next = ListNode(val=ne..