Commit1341e85

authored

Improved tasks 2597, 2600, 2601

1 parentde73d15 commit1341e85Copy full SHA for 1341e85

File tree

+15

-8

lines changed

+15

-8

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -1,2 +1,2 @@`
`1`	`1`	`sonar.coverage.jacoco.xmlReportPaths=build/jacoco/test/jacocoTestReport.xml`
`2`		`-org.gradle.jvmargs=-Xms256m -Xmx1024m`
	`2`	`+org.gradle.jvmargs=-Xms512m -Xmx2048m`

Lines changed: 6 additions & 6 deletions

Original file line number	Diff line number	Diff line change
`@@ -15,18 +15,18 @@ public int beautifulSubsets(int[] nums, int k) {`
`15`	`15`	`map.put(n,map.getOrDefault(n,0) +1);`
`16`	`16`	`}`
`17`	`17`	`intres =1;`
`18`		`-for (intkey :map.keySet()) {`
`19`		`-if (!map.containsKey(key -k)) {`
`20`		`-if (!map.containsKey(key +k)) {`
`21`		`-res *=1 <<map.get(key);`
`22`		`- }else {`
	`18`	`+for (Map.Entry<Integer,Integer>entry :map.entrySet()) {`
	`19`	`+if (!map.containsKey(entry.getKey() -k)) {`
	`20`	`+if (map.containsKey(entry.getKey() +k)) {`
`23`	`21`	`List<Integer>freq =newArrayList<>();`
`24`		`-intlocalKey =key;`
	`22`	`+intlocalKey =entry.getKey();`
`25`	`23`	`while (map.containsKey(localKey)) {`
`26`	`24`	`freq.add(map.get(localKey));`
`27`	`25`	`localKey +=k;`
`28`	`26`	`}`
`29`	`27`	`res *=helper(freq);`
	`28`	`+ }else {`
	`29`	`+res *=1 <<entry.getValue();`
`30`	`30`	`}`
`31`	`31`	`}`
`32`	`32`	`}`

Lines changed: 1 addition & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -2,6 +2,7 @@`
`2`	`2`
`3`	`3`	`// #Easy #Math #Greedy #2023_08_29_Time_1_ms_(100.00%)_Space_40.3_MB_(19.10%)`
`4`	`4`
	`5`	`+@SuppressWarnings("java:S1172")`
`5`	`6`	`publicclassSolution {`
`6`	`7`	`publicintkItemsWithMaximumSum(intnumOnes,intnumZeros,intnumNegOnes,intk) {`
`7`	`8`	`if (k <=numOnes) {`

Lines changed: 7 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -43,7 +43,13 @@ public boolean primeSubOperation(int[] nums) {`
`43`	`43`	`if (pos == -1 &&n <=prev) {`
`44`	`44`	`returnfalse;`
`45`	`45`	`}`
`46`		`-prev =n - (pos == -1 ?0 : (pos <0 ?primes[-pos -2] :primes[pos]));`
	`46`	`+finalintindex;`
	`47`	`+if (pos == -1) {`
	`48`	`+index =0;`
	`49`	`+ }else {`
	`50`	`+index =pos <0 ?primes[-pos -2] :primes[pos];`
	`51`	`+ }`
	`52`	`+prev =n -index;`
`47`	`53`	`}`
`48`	`54`	`returntrue;`
`49`	`55`	`}`

Comments

(0)