FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
LeetCode-Solutions/C++/smallest-range-ii.cpp at master · tehsints/LeetCode-Solutions · GitHub
tehsints
/
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++
/
smallest-range-ii.cpp
Copy path
More file actions
More file actions
Latest commit
History
History
History
16 lines (15 loc) · 426 Bytes
Breadcrumbs
LeetCode-Solutions
/
C++
/
smallest-range-ii.cpp
Copy path
File metadata and controls
16 lines (15 loc) · 426 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
//
Time: O(nlogn)
//
Space: O(1)
class
Solution
{
public:
int
smallestRangeII
(vector<
int
>& A,
int
K) {
sort
(A.
begin
(), A.
end
());
int
result = A.
back
() - A.
front
();
for
(
int
i =
0
; i < A.
size
() -
1
; ++i) {
result =
min
(result,
max
(A.
back
() - K, A[i] + K) -
min
(A.
front
() + K, A[i +
1
] - K));
}
return
result;
}
};
Back
|
FazBrowse Home
|
New Git URL