-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy path00002-add_two_numbers.java
75 lines (59 loc) · 1.81 KB
/
00002-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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
// 2: Add Two Numbers
// https://leetcode.com/problems/add-two-numbers/
class Solution {
public static class ListNode {
int val;
ListNode next;
ListNode() {}
ListNode(int val) { this.val = val; }
ListNode(int val, ListNode next) { this.val = val; this.next = next; }
}
public static class LinkedList {
ListNode head;
LinkedList() { this.head = null; }
}
public static void llInput(LinkedList list, int[] inputs) {
for (int i=inputs.length-1; i>=0; i--) {
ListNode node = new ListNode(inputs[i], list.head);
list.head = node;
}
}
public static void llOutput(ListNode head) {
while (head != null) {
System.out.print(head.val + " -> ");
head = head.next;
}
System.out.println("NULL");
}
// SOLUTION
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
ListNode head = new ListNode();
ListNode t = head;
int c = 0;
while (c!=0 || l1!=null || l2!=null) {
c += (l1!=null ? l1.val : 0) + (l2!=null ? l2.val : 0);
ListNode temp = new ListNode();
temp.val = c%10;
temp.next = null;
t.next = temp;
t = t.next;
c /= 10;
if (l1!=null) l1 = l1.next;
if (l2!=null) l2 = l2.next;
}
return head.next;
}
public static void main(String[] args) {
Solution o = new Solution();
LinkedList ll1 = new LinkedList();
LinkedList ll2 = new LinkedList();
// INPUT
int[] li1 = {2,4,3};
int[] li2 = {5,6,4};
llInput(ll1, li1);
llInput(ll2, li2);
// OUTPUT
var result = o.addTwoNumbers(ll1.head, ll2.head);
llOutput(result);
}
}