Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Appearance settings

Expand file tree

/

Add Two Numbers.java

Copy path
More file actions
More file actions

Latest commit

 

History

History
History
executable file
·
73 lines (61 loc) · 1.68 KB
/

Add Two Numbers.java

Copy path

File metadata and controls

executable file
·
73 lines (61 loc) · 1.68 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
E
LinkedList都已经反转好了，直接做。
遍历两个l1,l2把carry-on处理好，每次生成一个新node，最后检查carry-on。
跟Add Binary的理解方式一模一样。
```
/*
You have two numbers represented by a linked list,
where each node contains a single digit.
The digits are stored in reverse order,
such that the 1's digit is at the head of the list.
Write a function that adds the two numbers and returns the sum as a linked list.
Example
Given 7->1->6 + 5->9->2. That is, 617 + 295.
Return 2->1->9. That is 912.
Given 3->1->5 and 5->9->2, return 8->0->8.
Tags Expand
Cracking The Coding Interview Linked List High Precision
*/
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) {
* val = x;
* next = null;
* }
* }
*/
public class Solution {
/**
* @param l1: the first list
* @param l2: the second list
* @return: the sum list of l1 and l2
*/
public ListNode addLists(ListNode l1, ListNode l2) {
ListNode rst = new ListNode(0);
ListNode dummy = rst;
int carrier = 0;
//while
while (l1 != null || l2 != null) {
if (l1 != null) {
carrier += l1.val;
l1 = l1.next;
}
if (l2 != null) {
carrier += l2.val;
l2 = l2.next;
}
rst.next = new ListNode(carrier % 10);
carrier = carrier / 10;
rst = rst.next;
}
//check the carrier
if (carrier == 1) {
rst.next = new ListNode(1);
}
return dummy.next;
}
}
```
Morty Proxy This is a proxified and sanitized view of the page, visit original site.