/
AddTwoNumber.java
59 lines (54 loc) · 1.22 KB
/
AddTwoNumber.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
/**
* @author Harry Tran on 6/25/18.
* @project Leetcode
* @email trunghieu.tran@utdallas.edu
* @organization UTDallas
*/
public class AddTwoNumber {
public class ListNode {
int val;
ListNode next;
ListNode(int x) { val = x; }
}
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
ListNode result = new ListNode(0);
ListNode curr = result;
int carry = 0;
while (true) {
int tmp = l1.val + l2.val + carry;
carry = tmp / 10;
curr.val = tmp % 10;
if (l1.next == null || l2.next == null) break;
l1 = l1.next;
l2 = l2.next;
ListNode newNode = new ListNode(0);
curr.next = newNode;
curr = newNode;
}
while (l1.next != null) {
l1 = l1.next;
int tmp = l1.val + carry;
carry = tmp / 10;
ListNode newNode = new ListNode(tmp % 10);
curr.next = newNode;
curr = newNode;
}
while (l2.next != null) {
l2 = l2.next;
int tmp = l2.val + carry;
carry = tmp / 10;
ListNode newNode = new ListNode(tmp % 10);
curr.next = newNode;
curr = newNode;
}
if (carry > 0) {
ListNode newNode = new ListNode(carry);
curr.next = newNode;
}
return result;
}
public static void main(String[] args) {
int c = 97;
System.out.println((char) c);
}
}