两数相加（go）

func addTwoNumbers(l1 *ListNode, l2 *ListNode) *ListNode {
	//遍历链表 l1 获取num1
	num1 := make([]int, 0)
	for l1 != nil {
		num1 = append(num1, l1.Val)
		l1 = l1.Next
	}

	num2 := make([]int, 0)
	for l2 != nil {
		num2 = append(num2, l2.Val)
		l2 = l2.Next
	}

	// 计算次数
	var a int = 1
	// 进位
	var carry int = 0
	num5 := make([]int, 0)
	if len(num1) > len(num2) || len(num1) == len(num2) {
		num5 = dataNumber(num1, num2, a, carry, num5)
	}
	if len(num1) < len(num2) {
		num5 = dataNumber(num2, num1, a, carry, num5)
	}

	listNode := new(ListNode)
	for k := len(num5) - 1; k >= 0; k-- {
		if k == len(num5)-1 {
			listNode.Val = num5[k]
			listNode.Next = nil
		} else {
			listNode = insert(listNode, num5[k])
		}
	}
	return listNode
}

// 封装
func dataNumber(num3 []int, num4 []int, a int, carry int, num5 []int) []int {
	//num5 := make([]int, 0)
	for i := 0; i <= len(num3)-1; i++ {
		var b int = 0
		// 计算 a执行的次数
		if a <= len(num4) {
			for j := i; j <= len(num4)-1; j++ {
				b = num4[j]
				break
			}
		}
		// 两数相加
		twoNumbers := num3[i] + b
		//fmt.Printf("第%v次 num3:%v  b:%v a:%a\n", i, num3[i], b, a)
		// 看看进位是否有值
		if carry == 1 {
			twoNumbers += 1
			carry = 0
		}
		if twoNumbers >= 10 {
			twoNumbers -= 10
			carry = 1
		}
		if i == len(num3)-1 && carry == 1 {
			num5 = append(num5, twoNumbers, 1)
		} else {
			num5 = append(num5, twoNumbers)
		}
		a = a + 1
	}
	return num5
}

// 组数据
func insert(head *ListNode, val int) *ListNode {
	newList := new(ListNode)
	newList.Val = val
	newList.Next = head
	return newList
}

type ListNode struct {
	Val  int
	Next *ListNode
}