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.
题目链接:https://leetcode-cn.com/problems/add-two-numbers/
思路
主要点在于设立记录进位的变量,以及同时遍历两个链表的方法。
/**
* 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(0);
ListNode *end = res;
int add = 0;
while(l1 || l2){
int a = (l1!=NULL)?l1->val : 0;
int b = (l2!=NULL)?l2->val : 0;
int tmp = a + b + add;
add = tmp / 10;
end->next = new ListNode(tmp % 10);
end = end->next;
if(l1!=NULL) l1 = l1->next;
if(l2!=NULL) l2 = l2->next;
}
if (add!=0) end->next = new ListNode(1);
return res->next;
}
};