Commit0f21931

authored

Improved task 2902

1 parent728e000 commit0f21931Copy full SHA for 0f21931

File tree

-7

lines changed

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

-7

lines changed

Lines changed: 2 additions & 7 deletions

Original file line number	Diff line number	Diff line change
`@@ -9,14 +9,11 @@`
`9`	`9`	`importjava.util.List;`
`10`	`10`
`11`	`11`	`publicclassSolution {`
`12`		`-`
`13`	`12`	`privatestaticfinalintMOD = (int)1e9 +7;`
`14`		`-`
`15`	`13`	`privateHashMap<Integer,Integer>map;`
`16`		`-`
`17`	`14`	`privateint[][]dp;`
`18`	`15`
`19`		`-privateintsolve(ArrayList<Integer>al,intl,intr,intindex,intsum) {`
	`16`	`+privateintsolve(List<Integer>al,intl,intr,intindex,intsum) {`
`20`	`17`	`if (sum >r) {`
`21`	`18`	`return0;`
`22`	`19`	`}`
`@@ -29,7 +26,6 @@ private int solve(ArrayList<Integer> al, int l, int r, int index, int sum) {`
`29`	`26`	`}`
`30`	`27`	`intcur =al.get(index);`
`31`	`28`	`intcount =map.get(cur);`
`32`		`-`
`33`	`29`	`for (inti =0;i <=count;i++) {`
`34`	`30`	`intcurSum =sum +cur *i;`
`35`	`31`	`if (curSum >r) {`
`@@ -47,7 +43,7 @@ private int solve(ArrayList<Integer> al, int l, int r, int index, int sum) {`
`47`	`43`
`48`	`44`	`publicintcountSubMultisets(List<Integer>nums,intl,intr) {`
`49`	`45`	`map =newHashMap<>();`
`50`		`-ArrayList<Integer>al =newArrayList<>();`
	`46`	`+List<Integer>al =newArrayList<>();`
`51`	`47`	`for (intcur :nums) {`
`52`	`48`	`intcount =map.getOrDefault(cur,0) +1;`
`53`	`49`	`map.put(cur,count);`
`@@ -57,7 +53,6 @@ public int countSubMultisets(List<Integer> nums, int l, int r) {`
`57`	`53`	`}`
`58`	`54`	`intn =al.size();`
`59`	`55`	`dp =newint[n][r +1];`
`60`		`-`
`61`	`56`	`for (inti =0;i <dp.length;i++) {`
`62`	`57`	`for (intj =0;j <dp[0].length;j++) {`
`63`	`58`	`dp[i][j] = -1;`

Comments

(0)