diff options
author | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
commit | a96b65cbfad7f62f3db6b2eab105e4e25c0414c5 (patch) | |
tree | e2a2b3f49f9fb741be81415266ac93e74cff42ec /other/min_avg_diff.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/min_avg_diff.cpp')
-rw-r--r-- | other/min_avg_diff.cpp | 27 |
1 files changed, 0 insertions, 27 deletions
diff --git a/other/min_avg_diff.cpp b/other/min_avg_diff.cpp deleted file mode 100644 index 4bbc2b1..0000000 --- a/other/min_avg_diff.cpp +++ /dev/null @@ -1,27 +0,0 @@ -#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); -} |