FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
Leetcode/algorithms/AddTwoNumbers.js at master · superman06/Leetcode · GitHub
superman06
/
Leetcode
Public
forked from
dnshi/Leetcode
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
Leetcode
/
algorithms
/
AddTwoNumbers.js
Copy path
More file actions
More file actions
Latest commit
History
History
History
49 lines (43 loc) · 1.23 KB
Breadcrumbs
Leetcode
/
algorithms
/
AddTwoNumbers.js
Copy path
File metadata and controls
49 lines (43 loc) · 1.23 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
// Source : https://oj.leetcode.com/problems/add-two-numbers/
// Author : Dean Shi
// Date : 2015-06-01
/**********************************************************************************
*
* 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.
* Add the two numbers and return it as a linked list.
*
* Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
* Output: 7 -> 0 -> 8
*
**********************************************************************************/
/**
* Definition for singly-linked list.
* function ListNode(val) {
* this.val = val;
* this.next = null;
* }
*/
/**
*
@param
{
ListNode
} l1
*
@param
{
ListNode
} l2
*
@return
{
ListNode
}
*/
var
addTwoNumbers
=
function
(
l1
,
l2
)
{
const
result
=
new
ListNode
(
0
)
let
curr
=
result
,
carry
=
0
while
(
l1
||
l2
)
{
if
(
l1
)
{
carry
+=
l1
.
val
l1
=
l1
.
next
}
if
(
l2
)
{
carry
+=
l2
.
val
l2
=
l2
.
next
}
curr
=
curr
.
next
=
new
ListNode
(
carry
%
10
)
carry
=
~
~
(
carry
/
10
)
}
if
(
carry
!==
0
)
curr
.
next
=
new
ListNode
(
carry
)
return
result
.
next
}
;
Back
|
FazBrowse Home
|
New Git URL