Improved task

Author: javadev

src/main/java/g3401_3500/s3473_sum_of_k_subarrays_with_length_at_least_m/Solution.java

@@ -23,7 +23,7 @@ public int maxSum(int[] nums, int k, int m) {
             int[] maxPrev = new int[n + 1];
             for (int i = 0; i < n + 1; i++) {
                 maxPrev[i] =
-                        (i == 0)
+                        i == 0
                                 ? dp[0][j - 1] - prefixSum[0]
                                 : Math.max(maxPrev[i - 1], dp[i][j - 1] - prefixSum[i]);
             }