#370
Medium Algorithms Range addition
Array Prefix Sum
73.0% acceptance
Mar 31, 2026
1684
86
No description available.
Solution
Rust
Time O(n)
Space O(n)
impl Solution {
pub fn get_modified_array(length: i32, updates: Vec<Vec<i32>>) -> Vec<i32> {
let n = length as usize;
let mut diff = vec![0i32; n + 1];
for u in &updates {
diff[u[0] as usize] += u[2];
diff[u[1] as usize + 1] -= u[2];
}
let mut result = Vec::with_capacity(n);
let mut sum = 0;
for i in 0..n {
sum += diff[i];
result.push(sum);
}
result
}
}