FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
JavaScript/Sliding-Windows/MaxSumSubarrayFixed.js at master · TheAlgorithms/JavaScript · GitHub
Uh oh!
There was an error while loading.
Please reload this page
.
TheAlgorithms
/
JavaScript
Public
Uh oh!
There was an error while loading.
Please reload this page
.
Notifications
You must be signed in to change notification settings
Fork
5.8k
Star
34.2k
Code
Issues
21
Pull requests
192
Actions
Projects
Wiki
Security and quality
0
Insights
Additional navigation options
Code
Issues
Pull requests
Actions
Projects
Wiki
Security and quality
Insights
Expand file tree
Breadcrumbs
JavaScript
/
Sliding-Windows
/
MaxSumSubarrayFixed.js
Copy path
More file actions
More file actions
Latest commit
History
History
History
26 lines (26 loc) · 777 Bytes
Breadcrumbs
JavaScript
/
Sliding-Windows
/
MaxSumSubarrayFixed.js
Copy path
File metadata and controls
26 lines (26 loc) · 777 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
/**
* Function to find the maximum sum of a subarray of fixed size k.
*
*
@param
{
number[]
} arr - The input array of numbers.
*
@param
{
number
} k - The fixed size of the subarray.
*
@returns
{
number
} - The maximum sum of any subarray of size k.
*
@throws
{
RangeError
} - If k is larger than the array length or less than 1.
*/
export
function
maxSumSubarrayFixed
(
arr
,
k
)
{
if
(
k
>
arr
.
length
||
k
<
1
)
{
throw
new
RangeError
(
'Subarray size k must be between 1 and the length of the array'
)
}
let
maxSum
=
0
let
windowSum
=
0
for
(
let
i
=
0
;
i
<
k
;
i
++
)
{
windowSum
+=
arr
[
i
]
}
maxSum
=
windowSum
for
(
let
i
=
k
;
i
<
arr
.
length
;
i
++
)
{
windowSum
+=
arr
[
i
]
-
arr
[
i
-
k
]
maxSum
=
Math
.
max
(
maxSum
,
windowSum
)
}
return
maxSum
}
Back
|
FazBrowse Home
|
New Git URL