# Leetcode 2. Add Two Numbers

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.

Example:

Input: ( 2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
Explanation: 342 + 465 = 807

AC代码，有些人喜欢写的简单点: p1 != NULL 就直接写成 p1, 不过我就是喜欢写的更直接啦。评论区里有11行的骚操作，不过本质上都是一样的。

/**
* struct ListNode {
*     int val;
*     ListNode *next;
*     ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
int flag = 0;
struct ListNode* p1, *p2, *p3, *l3;
p1 = l1; p2 = l2;
struct ListNode dummyNode(-1); //不设虚节点的话很难循环和返回，否则要判断NULL太麻烦
l3 = &dummyNode;
p3 = l3;

while(p1 != NULL && p2 != NULL){
addNumber = p1->val + p2->val + flag;
flag = 1;
}else{
flag = 0;
}
p3 = p3->next; p1 = p1->next; p2 = p2->next;
}

if(p1 == NULL && p2 != NULL){ //L2比L1短
while(p2 != NULL){
flag = 1;
}else{
flag = 0;
}
p3 = p3->next; p2 = p2->next;
}
}

if(p1 != NULL && p2 == NULL){//L1比L2短
while(p1 != NULL){
flag = 1;
}else{
flag = 0;
}
p3 = p3->next;  p1 = p1->next;
}
}

if (flag == 1){//最后有进位
p3->next = new ListNode(1);
}

return l3->next;
}
};

ListNode *addTwoNumbers(ListNode *l1, ListNode *l2) {
int extra = 0;
while (l1 || l2 || extra) {
int sum = (l1 ? l1->val : 0) + (l2 ? l2->val : 0) + extra;
extra = sum / 10;
p->next = new ListNode(sum % 10);
p = p->next;
l1 = l1 ? l1->next : l1;
l2 = l2 ? l2->next : l2;
}
}

• 广告
• 抄袭
• 版权
• 政治
• 色情
• 无意义
• 其他

120