Update Solution.java

Author: ThanhNIT

src/main/java/g3001_3100/s3098_find_the_sum_of_subsequence_powers/Solution.java

@@ -7,7 +7,7 @@
 import java.util.Map;
 
 public class Solution {
-    private final int MOD = 1_000_000_007;
+    private final int mod = 1_000_000_007;
     private int len;
 
     private int dfs(int lastIdx, int k, int minDiff, Map<Long, Integer> dp, int[] nums) {
@@ -20,7 +20,7 @@ private int dfs(int lastIdx, int k, int minDiff, Map<Long, Integer> dp, int[] nu
         }
         int res = 0;
         for (int i = lastIdx + 1; i <= len - k; i++) {
-            res = (res + dfs(i, k - 1, Math.min(minDiff, nums[i] - nums[lastIdx]), dp, nums)) % MOD;
+            res = (res + dfs(i, k - 1, Math.min(minDiff, nums[i] - nums[lastIdx]), dp, nums)) % mod;
         }
         dp.put(key, res);
         return res;
@@ -32,7 +32,7 @@ public int sumOfPowers(int[] nums, int k) {
         Map<Long, Integer> dp = new HashMap<>();
         int res = 0;
         for (int i = 0; i <= len - k; i++) {
-            res = (res + dfs(i, k - 1, nums[len - 1] - nums[0], dp, nums)) % MOD;
+            res = (res + dfs(i, k - 1, nums[len - 1] - nums[0], dp, nums)) % mod;
         }
         return res;
     }