diff options
author | Jack Sangdahl <[email protected]> | 2025-03-10 00:36:13 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-03-10 00:36:13 -0600 |
commit | 7c60dee83b436e8e8a667bf9f191beced8de4fc3 (patch) | |
tree | eb7a24ee2067f92245c57bb118e85a1baf15df50 /other/min_avg_diff.cpp | |
parent | 5d7cdc215e4ba1ec4cbb24c084cccb5e5e641468 (diff) | |
download | leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.tar.gz leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.zip |
chore: move cpp and rust code to directory
Diffstat (limited to 'other/min_avg_diff.cpp')
-rw-r--r-- | other/min_avg_diff.cpp | 27 |
1 files changed, 27 insertions, 0 deletions
diff --git a/other/min_avg_diff.cpp b/other/min_avg_diff.cpp new file mode 100644 index 0000000..4bbc2b1 --- /dev/null +++ b/other/min_avg_diff.cpp @@ -0,0 +1,27 @@ +#include "leetcode.h" + +class Solution { +public: + int minimumAverageDifference(vector<int> &nums) { + long i = 0, j = 0, m = LONG_MAX, k, d; + long pfx = 0, sfx = accumulate(nums.begin(), nums.end(), 0L); + for (int n : nums) { + pfx += n; + sfx -= n; + j += 1; + k = nums.size() - j; + d = abs(pfx / j - sfx / (k ? k : 1)); + if (d < m) { + m = d; + i = j - 1; + } + } + return i; + } +}; + +int main() { + Solution obj; + vector<int> nums = {2, 5, 3, 9, 5, 3}; + cout << obj.minimumAverageDifference(nums); +} |