Merge pull request Sunchit#1054 from samueldenzil/master

Java & C++ Solution of Day 20 - June Challenge | K Radius Subarray Averages

Author: Sunchit

June2023/C++/KRadiusSubarrayAverages.cpp

@@ -0,0 +1,22 @@
+class Solution {
+public:
+    vector<int> getAverages(vector<int>& nums, int k) {
+        int n = nums.size();
+        
+        vector<long> prefix(n + 1, 0);
+        for (int i = 0; i < n; ++i) {
+            prefix[i + 1] = prefix[i] + nums[i];
+        }
+
+        vector<int> ans(n, -1);
+        
+        for (int i = k; i < (n - k); ++i) {
+            int leftBound = i - k, rightBound = i + k;
+            long sum = prefix[rightBound + 1] - prefix[leftBound];
+            int avg = (int) (sum / (2 * k + 1));
+            ans[i] = avg;
+        }
+
+        return ans;
+    }
+};

June2023/Java/KRadiusSubarrayAverages.java

@@ -0,0 +1,22 @@
+class Solution {
+    public int[] getAverages(int[] nums, int k) {
+        int n = nums.length;
+        
+        long[] prefix = new long[n + 1];
+        for (int i = 0; i < n; ++i) {
+            prefix[i + 1] = prefix[i] + nums[i];
+        }
+
+        int[] ans = new int[n];
+        Arrays.fill(ans, -1);
+        
+        for (int i = k; i < (n - k); ++i) {
+            int leftBound = i - k, rightBound = i + k;
+            long sum = prefix[rightBound + 1] - prefix[leftBound];
+            int avg = (int) (sum / (2 * k + 1));
+            ans[i] = avg;
+        }
+
+        return ans;
+    }
+}