-
Notifications
You must be signed in to change notification settings - Fork 64
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
1 parent
de63451
commit cd312d0
Showing
1 changed file
with
34 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,34 @@ | ||
// Leetcode Problem No-2 : Add Two Numbers | ||
// https://leetcode.com/problems/add-two-numbers/ | ||
|
||
/** | ||
* Definition for singly-linked list. | ||
* struct ListNode { | ||
* int val; | ||
* ListNode *next; | ||
* ListNode() : val(0), next(nullptr) {} | ||
* ListNode(int x) : val(x), next(nullptr) {} | ||
* ListNode(int x, ListNode *next) : val(x), next(next) {} | ||
* }; | ||
*/ | ||
class Solution | ||
{ | ||
public: | ||
ListNode *addTwoNumbers(ListNode *l1, ListNode *l2) | ||
{ | ||
ListNode *result_ans = new ListNode(0); | ||
ListNode *head = result_ans; | ||
int carry = 0; | ||
while (l1 != NULL || l2 != NULL || carry > 0) | ||
{ | ||
int result = carry + (l1 != NULL ? l1->val : 0) + (l2 != NULL ? l2->val : 0); | ||
ListNode *new_result = new ListNode(result % 10); | ||
carry = result / 10; | ||
l1 = (l1 == NULL ? l1 : l1->next); | ||
l2 = (l2 == NULL ? l2 : l2->next); | ||
result_ans->next = new_result; | ||
result_ans = result_ans->next; | ||
} | ||
return head->next; | ||
} | ||
}; |