-
Notifications
You must be signed in to change notification settings - Fork 8
Expand file tree
/
Copy pathAddTwoNumbersAsList.java
More file actions
53 lines (45 loc) · 1.36 KB
/
AddTwoNumbersAsList.java
File metadata and controls
53 lines (45 loc) · 1.36 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
42
43
44
45
46
47
48
49
50
51
52
53
/**
* Definition for singly-linked list.
* class ListNode {
* public int val;
* public ListNode next;
* ListNode(int x) { val = x; next = null; }
* }
*/
/**
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
**/
public class Solution {
public ListNode addTwoNumbers(ListNode A, ListNode B) {
ListNode node = new ListNode(0);
ListNode current = node;
int sum, carry = 0;
while(A != null || B != null) {
sum = carry;
if(A != null)
{
sum= sum + A.val;
A = A.next;
}
if(B != null)
{
sum+= B.val;
B = B.next;
}
current.next = new ListNode(sum%10);
carry = sum / 10;
current = current.next;
sum = sum / 10;
}
if(carry > 0)
{
current.next = new ListNode(carry);
}
return node.next;
}
}