Count Subarrays With Score Less Than K LeetCode solution in Rust

1
impl Solution {
2
  pub fn count_subarrays(nums: Vec<i32>, k: i64) -> i64 {
3
    let mut sum = 0;
4
    let mut count = 0;
5
    let mut left = 0;
6
    for (right, &num) in nums.iter().enumerate() {
7
      sum += num as i64;
8

9
      while sum * (right - left + 1) as i64 >= k {
10
        sum -= nums[left] as i64;
11
        left += 1;
12
      }
13

14
      count += right - left + 1;
15
    }
16

17
    count as i64
18
  }
19
}