Improved task 2902

Author: javadev

src/main/java/g2901_3000/s2902_count_of_sub_multisets_with_bounded_sum/Solution.java

@@ -9,14 +9,11 @@
 import java.util.List;
 
 public class Solution {
-
     private static final int MOD = (int) 1e9 + 7;
-
     private HashMap<Integer, Integer> map;
-
     private int[][] dp;
 
-    private int solve(ArrayList<Integer> al, int l, int r, int index, int sum) {
+    private int solve(List<Integer> al, int l, int r, int index, int sum) {
         if (sum > r) {
             return 0;
         }
@@ -29,7 +26,6 @@ private int solve(ArrayList<Integer> al, int l, int r, int index, int sum) {
         }
         int cur = al.get(index);
         int count = map.get(cur);
-
         for (int i = 0; i <= count; i++) {
             int curSum = sum + cur * i;
             if (curSum > r) {
@@ -47,7 +43,7 @@ private int solve(ArrayList<Integer> al, int l, int r, int index, int sum) {
 
     public int countSubMultisets(List<Integer> nums, int l, int r) {
         map = new HashMap<>();
-        ArrayList<Integer> al = new ArrayList<>();
+        List<Integer> al = new ArrayList<>();
         for (int cur : nums) {
             int count = map.getOrDefault(cur, 0) + 1;
             map.put(cur, count);
@@ -57,7 +53,6 @@ public int countSubMultisets(List<Integer> nums, int l, int r) {
         }
         int n = al.size();
         dp = new int[n][r + 1];
-
         for (int i = 0; i < dp.length; i++) {
             for (int j = 0; j < dp[0].length; j++) {
                 dp[i][j] = -1;