Fixed sonar

Author: javadev

src/main/java/g3401_3500/s3500_minimum_cost_to_divide_array_into_subarrays/Solution.java

@@ -7,7 +7,7 @@
 public class Solution {
     public long minimumCost(int[] nums, int[] cost, int k) {
         int n = nums.length;
-        long kLong = (long) k;
+        long kLong = k;
         long[] preNums = new long[n + 1];
         long[] preCost = new long[n + 1];
         for (int i = 0; i < n; i++) {