forked from sbmxc/hacktoberfest
-
Notifications
You must be signed in to change notification settings - Fork 0
/
AddTwoNumbers-leetcode.cpp
27 lines (25 loc) · 995 Bytes
/
AddTwoNumbers-leetcode.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
//leetcode problem : ADD-TWO-NUMBERS
//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 contains a single digit. Add the two numbers and return the sum as a linked list.
//You may assume the two numbers do not contain any leading zero, except the number 0 itself.
class Solution {
public:
ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
ListNode* head=new ListNode();
ListNode* output=head;
int c=0; //carry
while(l1 != 0 || l2 != 0)
{
int sum=(l1 != 0 ? l1 ->val :0)+(l2 !=0? l2 ->val :0)+c;
output ->next = new ListNode(sum %10);
output=output ->next;
c=sum/10;
l1=(l1 !=NULL ? l1 ->next : NULL);
l2=(l2 !=NULL ? l2 ->next : NULL);
}
if(c==1)
{
output ->next = new ListNode(1);
}
return head ->next;
}
};