FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
Leetcode-JavaScript/Missing Number.js at master · parshva45/Leetcode-JavaScript · GitHub
parshva45
/
Leetcode-JavaScript
Public
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Issues
0
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Issues
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
Leetcode-JavaScript
/
Missing Number.js
Copy path
More file actions
More file actions
Latest commit
History
History
History
22 lines (18 loc) · 422 Bytes
Breadcrumbs
Leetcode-JavaScript
/
Missing Number.js
Copy path
File metadata and controls
22 lines (18 loc) · 422 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
/*Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missing from the array.
Example 1
Input: [3,0,1]
Output: 2
Example 2
Input: [9,6,4,2,3,5,7,0,1]
Output: 8*/
/**
*
@param
{
number[]
} nums
*
@return
{
number
}
*/
var
missingNumber
=
function
(
nums
)
{
len
=
nums
.
length
total
=
len
*
(
len
+
1
)
/
2
for
(
i
=
0
;
i
<
len
;
i
++
)
total
-=
nums
[
i
]
return
total
}
;
Back
|
FazBrowse Home
|
New Git URL