描述
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.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
ListNode *res = new ListNode(-1), *tmp = res;
int c = 0;
while (l1 || l2) {
int a = l1 ? l1->val : 0;
int b = l2 ? l2->val : 0;
int sum = a + b + c;
c = sum / 10;
tmp->next = new ListNode(sum % 10);
tmp = tmp->next;
if (l1) l1 = l1->next;
if (l2) l2 = l2->next;
}
if (c) tmp->next = new ListNode(1);
return res->next;
}
};