FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
LeetCode-Solutions/C++/patching-array.cpp at master · spotpan/LeetCode-Solutions · GitHub
spotpan
/
LeetCode-Solutions
Public
forked from
kamyu104/LeetCode-Solutions
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-Solutions
/
C++
/
patching-array.cpp
Copy path
More file actions
More file actions
Latest commit
History
History
History
18 lines (17 loc) · 500 Bytes
Breadcrumbs
LeetCode-Solutions
/
C++
/
patching-array.cpp
Copy path
File metadata and controls
18 lines (17 loc) · 500 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
//
Time: O(s + logn), s is the number of elements in the array
//
Space: O(1)
class
Solution
{
public:
int
minPatches
(vector<
int
>& nums,
int
n) {
int
patch =
0
;
for
(
uint64_t
miss =
1
, i =
0
; miss <= n;) {
if
(i < nums.
size
() && nums[i] <= miss) {
miss += nums[i++];
}
else
{
miss += miss;
//
miss may overflow, thus prefer to use uint64_t.
++patch;
}
}
return
patch;
}
};
Back
|
FazBrowse Home
|
New Git URL