feat: add Difference Array algorithm implementation and tests #7244
+197
−0
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Description
This PR adds the Difference Array algorithm implementation to the existing
prefixsumpackage.The Difference Array is an auxiliary data structure that enables efficient range update operations. Unlike a standard array where updating a range$[L, R]$ takes $O(N)$ time, the Difference Array allows for range updates in $O(1)$ time complexity, with the final array reconstruction taking $O(N)$ .
Key Features of Implementation:
updatemethod for constant-time operations.long[]internally to prevent integer overflow during intermediate range updates.DifferenceArrayTest.java) covering standard cases, edge cases (single element, full range), and stress tests (boundary conditions).Checklist
clang-format -i --style=file path/to/your/file.java