申请网站域名东营长安网站建设

哎呀，以为这道题也不用写题解的……结果还是有坑没跳出来。
最开始想法先计算总和再求出链表

func addTwoNumbers(l1 *ListNode, l2 *ListNode) *ListNode {// 先算出这个值。测试用例会int类型溢出total := 0wei := 1for l1!=nil && l2!=nil {total += (l1.Val+l2.Val)*wei // 进位也是正确的l1 = l1.Nextl2 = l2.Nextwei *= 10}for l1!=nil {total += l1.Val*weil1 = l1.Nextwei *= 10}for l2!=nil {total += l2.Val*weil2 = l2.Nextwei *= 10}fmt.Println(total)// 将total转换为链表res := &ListNode{}curr := resfor total != 0 {// fmt.Println(total)curr.Val = total%10total /= 10if total !=0 {curr.Next = &ListNode{}curr = curr.Next}}return res
}

var total int64还是会溢出得用big.Int
还是直接链表相加吧，记得保存进位就好了

func addTwoNumbers(l1 *ListNode, l2 *ListNode) *ListNode {dummy := &ListNode{}curr := dummycarry := 0for l1 != nil || l2 != nil || carry != 0 {sum := carryif l1 != nil {sum += l1.Vall1 = l1.Next}if l2 != nil {sum += l2.Vall2 = l2.Next}carry = sum / 10curr.Next = &ListNode{Val: sum % 10}curr = curr.Next}return dummy.Next
}