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 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.
 * type ListNode struct {
 *     Val int
 *     Next *ListNode
 * }
 */
func addTwoNumbers(l1 *ListNode, l2 *ListNode) *ListNode {
    var return_node *ListNode
    var current_node *ListNode
    var next_to_end_of_node *ListNode
    var end_of_node *ListNode
    
    current_node = new(ListNode)
    return_node = current_node
    
    var length_of_l1 int
    var length_of_l2 int
    var max_length int
    var flag int
    
    length_of_l1 = 0
    length_of_l2 = 0
    flag = 0
    
    current_l1 := l1
    current_l2 := l2
    
    for current_l1 != nil{
        length_of_l1++
        current_l1 = current_l1.Next
    }
    
    for current_l2 != nil{
        length_of_l2++
        current_l2 = current_l2.Next
    }
    
    if length_of_l1 > length_of_l2{
        max_length = length_of_l1
    }else{
        max_length = length_of_l2
    }
    
    for i := 1; i < max_length + 1; i++{
        current_node.Next = new(ListNode)
        current_node.Next.Val = 0
        current_node.Next.Next = nil
        current_node = current_node.Next
    }
    
    end_of_node = current_node
    
    current_l1 = l1
    current_l2 = l2
    current_node = return_node
    
    for current_l1 != nil{
        current_node.Val = current_node.Val + current_l1.Val
        current_node = current_node.Next
        current_l1 = current_l1.Next
    }
    
    current_node = return_node
    for current_l2 != nil{
        if current_node.Val + current_l2.Val + flag >= 10{
            current_node.Val = current_node.Val + current_l2.Val + flag - 10
            flag = 1
        }else{
            current_node.Val = current_node.Val + current_l2.Val + flag
            flag = 0
        }
        current_l2 = current_l2.Next
        current_node = current_node.Next
    }
    
    if flag != 0{
        for current_node != nil{
            if current_node.Val + flag >= 10{
                current_node.Val = current_node.Val + flag -10
                flag = 1
            }else{
                current_node.Val = current_node.Val + flag
                flag = 0
            }
            current_node = current_node.Next
        }
    }
    
    current_node = return_node
    
    for current_node.Next != end_of_node{
        current_node = current_node.Next
    }
    
    next_to_end_of_node = current_node
    
    if end_of_node.Val == 0{
        next_to_end_of_node.Next = nil
    }
    
    return return_node
}