-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMain.java
More file actions
83 lines (68 loc) · 1.92 KB
/
Main.java
File metadata and controls
83 lines (68 loc) · 1.92 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
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
// LeetCode Problem: https://leetcode.com/problems/add-two-numbers/
class ListNode {
int val;
ListNode next;
ListNode() {
}
ListNode(int val) {
this.val = val;
}
ListNode(int val, ListNode next) {
this.val = val;
this.next = next;
}
}
class Solution {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
ListNode sum = new ListNode(0);
ListNode temp = sum;
int carry = 0;
while(l1 != null && l2 != null){
int add = l1.val + l2.val + carry;
carry = add / 10;
add = add % 10;
temp.next = new ListNode(add);
temp = temp.next;
l1 = l1.next;
l2 = l2.next;
}
while(l1 != null){
int add = l1.val + carry;
carry = add/10;
add = add % 10;
temp.next = new ListNode(add);
temp = temp.next;
l1 = l1.next;
}
while(l2 != null){
int add = l2.val + carry;
carry = add/10;
add = add % 10;
temp.next = new ListNode(add);
temp = temp.next;
l2 = l2.next;
}
if(carry > 0)
temp.next = new ListNode(carry);
return sum.next;
}
}
public class Main {
public static void main(String[] args) {
// Create two linked lists: 342 (2 -> 4 -> 3) and 465 (5 -> 6 -> 4)
ListNode l1 = new ListNode(2);
l1.next = new ListNode(4);
l1.next.next = new ListNode(3);
ListNode l2 = new ListNode(5);
l2.next = new ListNode(6);
l2.next.next = new ListNode(4);
// Add the two numbers
Solution solution = new Solution();
ListNode sum = solution.addTwoNumbers(l1, l2);
// Print the result
while (sum != null) {
System.out.print(sum.val + " ");
sum = sum.next;
}
}
}