You are given two linked lists representing two non-negative numbers. 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.
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
就是用链表模拟加法,用C++写过大数运算的人应该很熟悉,这个题已经把数据逆转存储了相对就更简单了,只需模拟小学做加法的方法即可。注意处理好进位。
/**
* 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) {
int c = 0, first = 1;
ListNode *res = NULL, *cur = NULL;
ListNode *p = l1, *q = l2;
while (p || q) {
if (p && q) {
int sum = p->val + q->val + c;
q = q->next;
p = p->next;
if (first) {
res = new ListNode(sum%10);
cur = res;
first = 0;
}
else{
cur->next = new ListNode(sum%10);
cur = cur->next;
}
c = sum/10;
}
else if (p){
int sum = p->val + c;
p = p->next;
if (first) {
res = new ListNode(sum%10);
cur = res;
first = 0;
}
else{
cur->next = new ListNode(sum%10);
cur = cur->next;
}
c = sum/10;
}
else if (q){
int sum = q->val + c;
q = q->next;
if (first) {
res = new ListNode(sum%10);
cur = res;
first = 0;
}
else{
cur->next = new ListNode(sum%10);
cur = cur->next;
}
c = sum/10;
}
}
if (c) {
cur->next = new ListNode(c);
}
return res;
}
};