-
Notifications
You must be signed in to change notification settings - Fork 66
/
Copy pathAddTwoNumbersasLists.cpp
66 lines (56 loc) · 1.4 KB
/
AddTwoNumbersasLists.cpp
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
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
/*
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
342 + 465 = 807
Make sure there are no trailing zeros in the output list
So, 7 -> 0 -> 8 -> 0 is not a valid response even though the value is still 807.
LINK: https://www.interviewbit.com/problems/add-two-numbers-as-lists/
*/
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
ListNode* Solution::addTwoNumbers(ListNode* A, ListNode* B)
{
if(A==NULL)
return B;
if(B==NULL)
return A;
ListNode *head = new ListNode(0);
ListNode *temp = head;
int carry = 0;
while(A || B)
{
int sum = carry;
if(A)
{
sum += A->val;
A = A->next;
}
if(B)
{
sum += B->val;
B = B->next;
}
carry = sum/10;
sum %= 10;
temp->val = sum;
if(A || B)
{
temp->next = new ListNode(0);
temp = temp->next;
}
}
if(carry)
{
temp->next = new ListNode(0);
temp = temp->next;
temp->val = carry;
}
return head;
}