FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
leetcode-algorithms/src/AddTwoNumbers.java at master · anishLearnsToCode/leetcode-algorithms · GitHub
anishLearnsToCode
/
leetcode-algorithms
Public
Notifications
You must be signed in to change notification settings
Fork
17
Star
98
Code
Issues
0
Pull requests
0
Discussions
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Issues
Pull requests
Discussions
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
leetcode-algorithms
/
src
/
AddTwoNumbers.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
36 lines (31 loc) · 933 Bytes
Breadcrumbs
leetcode-algorithms
/
src
/
AddTwoNumbers.java
Copy path
File metadata and controls
36 lines (31 loc) · 933 Bytes
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
// https://leetcode.com/problems/add-two-numbers
// T: O(max(|l1|, |l2|))
// S: O(max(|l1|, |l2|))
public
class
AddTwoNumbers
{
public
ListNode
addTwoNumbers
(
ListNode
l1
,
ListNode
l2
) {
ListNode
result
=
new
ListNode
();
ListNode
current
=
result
;
int
carry
=
0
;
while
(
l1
!=
null
||
l2
!=
null
) {
current
.
next
=
new
ListNode
();
current
=
current
.
next
;
int
sum
=
get
(
l1
) +
get
(
l2
) +
carry
;
current
.
val
=
sum
%
10
;
carry
=
sum
/
10
;
l1
=
next
(
l1
);
l2
=
next
(
l2
);
}
if
(
carry
>
0
) {
current
.
next
=
new
ListNode
(
carry
);
}
return
result
.
next
;
}
private
ListNode
next
(
ListNode
node
) {
if
(
node
==
null
)
return
null
;
return
node
.
next
;
}
private
int
get
(
ListNode
node
) {
if
(
node
==
null
)
return
0
;
return
node
.
val
;
}
}
Back
|
FazBrowse Home
|
New Git URL