leetcode/AddTwoNumbers.java at master · Susheng/leetcode · GitHub

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


/**
 * 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.
 *
 * Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
 *
 * Output: 7 -> 0 -> 8
 */

publicclassAddTwoNumbers {
publicListNodeaddTwoNumbers(ListNodel1, ListNodel2) {
if (l1 == null)
returnl2;
if (l2 == null)
returnl1;
ListNodehead = newListNode(0);
ListNodecur = head;
intplus = 0;
while (l1 != null && l2 != null) {
intsum = l1.val + l2.val + plus;
plus = sum / 10;
sum = sum % 10;
cur.next = newListNode(sum);
cur = cur.next;
l1 = l1.next;
l2 = l2.next;
 }
if (l1 != null) {
if (plus != 0) {
cur.next = addTwoNumbers(l1, newListNode(plus));
 } else {
cur.next = l1;
 }
 } elseif (l2 != null) {
if (plus != 0) {
cur.next = addTwoNumbers(l2, newListNode(plus));
 } else {
cur.next = l2;
 }
 } elseif (plus != 0) {
cur.next = newListNode(plus);
 }

returnhead.next;
	}
}
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


/**
 * 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.
 *
 * Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
 *
 * Output: 7 -> 0 -> 8
 */

publicclassAddTwoNumbers {
publicListNodeaddTwoNumbers(ListNodel1, ListNodel2) {
if (l1 == null)
returnl2;
if (l2 == null)
returnl1;
ListNodehead = newListNode(0);
ListNodecur = head;
intplus = 0;
while (l1 != null && l2 != null) {
intsum = l1.val + l2.val + plus;
plus = sum / 10;
sum = sum % 10;
cur.next = newListNode(sum);
cur = cur.next;
l1 = l1.next;
l2 = l2.next;
 }
if (l1 != null) {
if (plus != 0) {
cur.next = addTwoNumbers(l1, newListNode(plus));
 } else {
cur.next = l1;
 }
 } elseif (l2 != null) {
if (plus != 0) {
cur.next = addTwoNumbers(l2, newListNode(plus));
 } else {
cur.next = l2;
 }
 } elseif (plus != 0) {
cur.next = newListNode(plus);
 }

returnhead.next;
	}
}
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


/**
 * 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.
 *
 * Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
 *
 * Output: 7 -> 0 -> 8
 */

publicclassAddTwoNumbers {
publicListNodeaddTwoNumbers(ListNodel1, ListNodel2) {
if (l1 == null)
returnl2;
if (l2 == null)
returnl1;
ListNodehead = newListNode(0);
ListNodecur = head;
intplus = 0;
while (l1 != null && l2 != null) {
intsum = l1.val + l2.val + plus;
plus = sum / 10;
sum = sum % 10;
cur.next = newListNode(sum);
cur = cur.next;
l1 = l1.next;
l2 = l2.next;
 }
if (l1 != null) {
if (plus != 0) {
cur.next = addTwoNumbers(l1, newListNode(plus));
 } else {
cur.next = l1;
 }
 } elseif (l2 != null) {
if (plus != 0) {
cur.next = addTwoNumbers(l2, newListNode(plus));
 } else {
cur.next = l2;
 }
 } elseif (plus != 0) {
cur.next = newListNode(plus);
 }

returnhead.next;
	}
}
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


/**
 * 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.
 *
 * Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
 *
 * Output: 7 -> 0 -> 8
 */

publicclassAddTwoNumbers {
publicListNodeaddTwoNumbers(ListNodel1, ListNodel2) {
if (l1 == null)
returnl2;
if (l2 == null)
returnl1;
ListNodehead = newListNode(0);
ListNodecur = head;
intplus = 0;
while (l1 != null && l2 != null) {
intsum = l1.val + l2.val + plus;
plus = sum / 10;
sum = sum % 10;
cur.next = newListNode(sum);
cur = cur.next;
l1 = l1.next;
l2 = l2.next;
 }
if (l1 != null) {
if (plus != 0) {
cur.next = addTwoNumbers(l1, newListNode(plus));
 } else {
cur.next = l1;
 }
 } elseif (l2 != null) {
if (plus != 0) {
cur.next = addTwoNumbers(l2, newListNode(plus));
 } else {
cur.next = l2;
 }
 } elseif (plus != 0) {
cur.next = newListNode(plus);
 }

returnhead.next;
	}
}
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


/**
 * 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.
 *
 * Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
 *
 * Output: 7 -> 0 -> 8
 */

publicclassAddTwoNumbers {
publicListNodeaddTwoNumbers(ListNodel1, ListNodel2) {
if (l1 == null)
returnl2;
if (l2 == null)
returnl1;
ListNodehead = newListNode(0);
ListNodecur = head;
intplus = 0;
while (l1 != null && l2 != null) {
intsum = l1.val + l2.val + plus;
plus = sum / 10;
sum = sum % 10;
cur.next = newListNode(sum);
cur = cur.next;
l1 = l1.next;
l2 = l2.next;
 }
if (l1 != null) {
if (plus != 0) {
cur.next = addTwoNumbers(l1, newListNode(plus));
 } else {
cur.next = l1;
 }
 } elseif (l2 != null) {
if (plus != 0) {
cur.next = addTwoNumbers(l2, newListNode(plus));
 } else {
cur.next = l2;
 }
 } elseif (plus != 0) {
cur.next = newListNode(plus);
 }

returnhead.next;
	}
}
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


/**
 * 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.
 *
 * Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
 *
 * Output: 7 -> 0 -> 8
 */

publicclassAddTwoNumbers {
publicListNodeaddTwoNumbers(ListNodel1, ListNodel2) {
if (l1 == null)
returnl2;
if (l2 == null)
returnl1;
ListNodehead = newListNode(0);
ListNodecur = head;
intplus = 0;
while (l1 != null && l2 != null) {
intsum = l1.val + l2.val + plus;
plus = sum / 10;
sum = sum % 10;
cur.next = newListNode(sum);
cur = cur.next;
l1 = l1.next;
l2 = l2.next;
 }
if (l1 != null) {
if (plus != 0) {
cur.next = addTwoNumbers(l1, newListNode(plus));
 } else {
cur.next = l1;
 }
 } elseif (l2 != null) {
if (plus != 0) {
cur.next = addTwoNumbers(l2, newListNode(plus));
 } else {
cur.next = l2;
 }
 } elseif (plus != 0) {
cur.next = newListNode(plus);
 }

returnhead.next;
	}
}
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


/**
 * 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.
 *
 * Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
 *
 * Output: 7 -> 0 -> 8
 */

publicclassAddTwoNumbers {
publicListNodeaddTwoNumbers(ListNodel1, ListNodel2) {
if (l1 == null)
returnl2;
if (l2 == null)
returnl1;
ListNodehead = newListNode(0);
ListNodecur = head;
intplus = 0;
while (l1 != null && l2 != null) {
intsum = l1.val + l2.val + plus;
plus = sum / 10;
sum = sum % 10;
cur.next = newListNode(sum);
cur = cur.next;
l1 = l1.next;
l2 = l2.next;
 }
if (l1 != null) {
if (plus != 0) {
cur.next = addTwoNumbers(l1, newListNode(plus));
 } else {
cur.next = l1;
 }
 } elseif (l2 != null) {
if (plus != 0) {
cur.next = addTwoNumbers(l2, newListNode(plus));
 } else {
cur.next = l2;
 }
 } elseif (plus != 0) {
cur.next = newListNode(plus);
 }

returnhead.next;
	}
}
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


/**
 * 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.
 *
 * Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
 *
 * Output: 7 -> 0 -> 8
 */

publicclassAddTwoNumbers {
publicListNodeaddTwoNumbers(ListNodel1, ListNodel2) {
if (l1 == null)
returnl2;
if (l2 == null)
returnl1;
ListNodehead = newListNode(0);
ListNodecur = head;
intplus = 0;
while (l1 != null && l2 != null) {
intsum = l1.val + l2.val + plus;
plus = sum / 10;
sum = sum % 10;
cur.next = newListNode(sum);
cur = cur.next;
l1 = l1.next;
l2 = l2.next;
 }
if (l1 != null) {
if (plus != 0) {
cur.next = addTwoNumbers(l1, newListNode(plus));
 } else {
cur.next = l1;
 }
 } elseif (l2 != null) {
if (plus != 0) {
cur.next = addTwoNumbers(l2, newListNode(plus));
 } else {
cur.next = l2;
 }
 } elseif (plus != 0) {
cur.next = newListNode(plus);
 }

returnhead.next;
	}
}