-
Notifications
You must be signed in to change notification settings - Fork 2
/
MaximumSumSubarraySizeK.java
61 lines (55 loc) · 1.27 KB
/
MaximumSumSubarraySizeK.java
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
50
51
52
53
54
55
56
57
58
59
60
61
package SlidingWindow;
/**
* @author kalpak
*
* Given an array of integers Arr of size N and a number K. Return the maximum sum of a subarray of size K.
*
* Example 1:
* Input:
* K = 2
* Arr = [100, 200, 300, 400]
* Output:
* 700
* Explanation:
* Arr3 + Arr4 =700, which is maximum.
*
* Example 2:
* Input:
* K = 4
* Arr = [100, 200, 300, 400]
* Output:
* 1000
* Explanation:
* Arr1 + Arr2 + Arr3
* + Arr4 =1000, which is maximum.
*
* Expected Time Complexity: O(N)
* Expected Auxiliary Space: O(1)
*
* Constraints:
* 1<=N<=10^5
* 1<=K<=N
*
*/
public class MaximumSumSubarraySizeK {
public static int maximumSumSubarray(int[] arr, int K){
if(arr.length < K) {
System.out.println("Invalid value of K");
return -1;
}
int windowSum = 0;
int result = Integer.MIN_VALUE;
for(int i = 0; i < K; i++)
windowSum += arr[i];
result = windowSum;
for(int i = K; i < arr.length; i++) {
windowSum += arr[i] - arr[i - K];
result = Math.max(result, windowSum);
}
return result;
}
public static void main(String[] args) {
int[] arr = new int[]{100, 200, 300, 400};
System.out.println(maximumSumSubarray(arr, 2));
}
}