https://leetcode.com/problems/add-two-numbers/
You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse orderand 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.
Example:
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4) Output: 7 -> 0 -> 8 Explanation: 342 + 465 = 807.
leetcode上每次submit的runtime都不太一样
方案1:
/**
* Definition for singly-linked list.
* type ListNode struct {
* Val int
* Next *ListNode
* }
*/
func addTwoNumbers(l1 *ListNode, l2 *ListNode) *ListNode {
p1 := l1
p2 := l2
ret := &ListNode{}
rp := ret
carry := 0
for {
sum := carry
if nil != p1 {
sum += p1.Val
p1 = p1.Next
}
if nil != p2 {
sum += p2.Val
p2 = p2.Next
}
rp.Val = sum % 10
carry = sum / 10
if nil == p1 && nil == p2 && 0 == carry {
break
}
rp.Next = &ListNode{}
rp = rp.Next
}
return ret
}