-
Notifications
You must be signed in to change notification settings - Fork 288
/
Copy pathAC_simulation_n.java
53 lines (46 loc) · 1.21 KB
/
AC_simulation_n.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
/*
* Author: illuz <iilluzen[at]gmail.com>
* File: AC_simulation_n.java
* Create Date: 2015-02-02 20:45:38
* Descripton: simulation
*/
import java.util.Scanner;
public class Solution {
// Definition for singly-linked list.
public static class ListNode {
int val;
ListNode next;
ListNode(int x) {
val = x;
next = null;
}
}
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
ListNode ret = new ListNode(0);
ListNode cur = ret;
int sum = 0;
while (true) {
if (l1 != null) {
sum += l1.val;
l1 = l1.next;
}
if (l2 != null) {
sum += l2.val;
l2 = l2.next;
}
cur.val = sum % 10;
sum /= 10;
if (l1 != null || l2 != null || sum != 0) {
cur = (cur.next = new ListNode(0));
} else {
break;
}
}
return ret;
}
public static void main(String[] args) {
Scanner cin = new Scanner(System.in);
Solution s = new Solution();
System.out.println("Not test case");
}
}