-
Notifications
You must be signed in to change notification settings - Fork 0
/
Add Two Numbers.java
58 lines (53 loc) · 1.61 KB
/
Add Two Numbers.java
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
/*
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.
Link: https://leetcode.com/problems/add-two-numbers/
Example:
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
Solution: Use a carry, and two values in current nodes to construct next node values.
Source: None
*/
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
public class Solution {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
ListNode dummy = new ListNode(0);
ListNode pre = dummy;
boolean carry = false; // it should be only true / false
while (l1 != null || l2 != null || carry) {
int temp1 = 0, temp2 = 0, temp3 = 0;
if (l1 != null) {
temp1 = l1.val;
}
if (l2 != null) {
temp2 = l2.val;
}
if (carry) {
temp3 = 1;
}
int sum = temp1 + temp2 + temp3;
ListNode curr = new ListNode(sum % 10);
pre.next = curr;
pre = pre.next;
if (sum / 10 > 0) {
carry = true;
} else {
carry = false;
}
if (l1 != null) {
l1 = l1.next;
}
if (l2 != null) {
l2 = l2.next;
}
}
return dummy.next;
}
}