Skip to content

refactor: MaximumSumOfDistinctSubarraysWithLengthK #5433

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 5 commits into from
Aug 30, 2024
Merged

refactor: MaximumSumOfDistinctSubarraysWithLengthK #5433

Changes from 1 commit
Commits
Show all changes
5 commits
Select commit Hold shift + click to select a range
ef14267
refactor: MaximumSumOfDistinctSubarraysWithLengthK
Aug 29, 2024
10e5791
checkstyle: fix formatting
Aug 29, 2024
d21ac23
checkstyle: fix formatting
Aug 29, 2024
e4123aa
checkstyle: fix formatting
Aug 29, 2024
b1f4568
Merge branch 'master' into refactor/MaximumSumOfDistinctSubarraysWith…
alxkm Aug 30, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Next Next commit
checkstyle: fix formatting
  • Loading branch information
alxkm committed Aug 29, 2024
commit d21ac232a3667af937911bda5877c24da70cbc5d
2 changes: 1 addition & 1 deletion src/main/java/com/thealgorithms/others/MaximumSumOfDistinctSubarraysWithLengthK.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -29,7 +29,7 @@ public static long maximumSubarraySum(int k, int... nums) {
}
long masSum = 0; // Variable to store the maximum sum of distinct subarrays
long currentSum = 0; // Variable to store the sum of the current subarray
Set<Integer> currentSet = new HashSet<>();// Set to track distinct elements in the current subarray
Set<Integer> currentSet = new HashSet<>(); // Set to track distinct elements in the current subarray

// Initialize the first window
for (int i = 0; i < k; i++) {
Expand Down