forked from sunstick/code-street
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathadd_two_numbers.cpp
More file actions
41 lines (35 loc) · 1.08 KB
/
add_two_numbers.cpp
File metadata and controls
41 lines (35 loc) · 1.08 KB
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
/*
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) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
ListNode dummy(0);
ListNode *tail = &dummy;
int carry = 0;
while (l1 || l2 || carry) {
int a = l1 ? l1 -> val : 0;
int b = l2 ? l2 -> val : 0;
int bit = a + b + carry;
carry = bit / 10;
bit = bit % 10;
tail -> next = new ListNode(bit);
tail = tail -> next;
l1 = l1 ? l1 -> next : l1;
l2 = l2 ? l2 -> next : l2;
}
return dummy.next;
}
};