# LeetCode-Add Two Numbers-解题报告

108人阅读 评论(0)

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

/**
* 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) {
if (l1 == NULL)return l2;
if (l2 == NULL)return l1;
ListNode *ans, *tmp, *head;
int c = 0, flag = 0;
for (; l1 != NULL || l2 != NULL;)
{
int a = 0, b = 0;
if (l1 != NULL)a = l1->val;
if (l2 != NULL)b = l2->val;
a = a + b + c;
c = a / 10;
a = a % 10;
tmp = new ListNode(a);
if (flag == 0)ans = tmp, flag = 1, head = tmp;
if (l1 != NULL)l1 = l1->next;
if (l2 != NULL)l2 = l2->next;
}
if (c)
tmp = new ListNode(c), head->next = tmp;
return ans;
}
};

0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：14353次
• 积分：841
• 等级：
• 排名：千里之外
• 原创：72篇
• 转载：6篇
• 译文：0篇
• 评论：0条
文章分类