一、概述
最近在刷leetcode上的题,下面是我对Add Two Numbers这道题的解法,这道题的原网址为https://leetcode.com/problems/add-two-numbers/description/
二、题目
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* head = NULL;
ListNode* tail = NULL;
ListNode* i = l1;
ListNode* j = l2;
int carry = 0;
while (i != NULL || j != NULL) {
int sum = 0;
if (i) sum += i->val;
if (j) sum += j->val;
int value = (sum + carry) % 10;
carry = (sum + carry) / 10;
ListNode* tmp = new ListNode(value);
if (tmp == NULL) return tmp;
if (tail == NULL) head = tail = tmp;
else {
tail->next = tmp;
tail = tail->next;
}
if (i) i = i->next;
if (j) j = j->next;
}
if (carry) tail->next = new ListNode(carry);
return head;
}
};
四、难点
这道题总体来说,并不算难,但有一些需要注意的地方,比如说两个不等长的数相加,因为这里限制是用链表来逆序存储数字的,所以当对应的位相加时,
比如说A、B两个数,当A链表到结尾,而B链表没有到时,应该怎样处理,还有就是进位的问题,我是这样处理的,设置一个临时变量sum,如果链表对应的位
存在,就把它加上,如果没有,就不加,这样简单的处理就可以处理不等长的问题,进位也是如此。