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
- 本题为两个单向链表相加,头节点为个位,以后以此递推。
- 输出为一个链表,为两个链表相加的和。
从头节点开始相加,满十取余为本位结果,除十为进位结果,具体代码思路如下注释。
class Solution {
public:
ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
ListNode *head = new ListNode(0);
ListNode *p = head;
int carry = 0;
while (1) {
if (l1 != NULL) {
carry += l1->val;
l1 = l1->next;
}
if (l2 != NULL) {
carry += l2->val;
l2 = l2->next;
}
head->val = carry % 10;
carry /= 10;
if (l1 != NULL || l2 != NULL || carry != 0) {
head = (head->next = new ListNode(0));
} else break;
}
return p;
}
};