leetcode 2. add two numbers

题目

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

题解

两个指针,向后扫描,注意进位,当到了最后一个节点时,若进位等于1,则应该创建新节点,并赋值为1。 可以使用头结点,以方便while循环规则。

代码

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43

* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class {
public:
ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
int carry = 0;
int sum = 0;
ListNode * res = new ListNode(0);
ListNode * cur = res;
while(l1 || l2 || carry)
{
sum = carry;
carry = 0;
if(l1)
{
sum += l1->val;
l1 = l1->next;
}
if(l2)
{
sum += l2->val;
l2 = l2->next;
}
if(sum > 9)
{
sum -= 10;
carry = 1;
}
cur->next = new ListNode(sum);
cur = cur->next;
}
ListNode * tmp = res;
res = res->next;
delete tmp;
return res;
}
};