[LeetCode]add two numbers (완료)

[yeonghwanjeon]

• 문제링크
• 나의 풀이 : l1, l2 모두 한번씩 순회하면 될 듯 -> O(n)

  
  # Definition for singly-linked list.
  # class ListNode(object):
  #     def __init__(self, x):
  #         self.val = x
  #         self.next = None

class Solution(object): def addTwoNumbers(self, l1, l2): """ :type l1: ListNode :type l2: ListNode :rtype: ListNode """ n1 = 0 n2 = 0

    digit = 1
    now = l1
    while True :
        if now is None : break

        n = now.val
        n1 += n * digit
        digit = digit * 10
        now = now.next

    digit = 1
    now = l2
    while True :
        if now is None : break

        n = now.val
        n1 += n * digit
        digit = digit * 10
        now = now.next

    sn = n1 + n2
    ori = sn

    digit = 10
    now_num = sn % digit
    sn = sn / digit

    new_node = ListNode(now_num)
    ret = new_node
    now = new_node
    while True :
        if sn == 0 : break

        now_num = sn % digit
        sn = sn / digit

        new_node = ListNode(now_num)
        now.next = new_node
        now = now.next

    return ret