Commit39fd963

authored

Improved task 2610

1 parent6f08d34 commit39fd963Copy full SHA for 39fd963

File tree

-9

lines changed

src/main/java/g2601_2700/s2610_convert_an_array_into_a_2d_array_with_conditions
- Solution.java

-9

lines changed

Lines changed: 6 additions & 9 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,23 +1,20 @@`
`1`	`1`	`packageg2601_2700.s2610_convert_an_array_into_a_2d_array_with_conditions;`
`2`	`2`
`3`		`-// #Medium #Array #Hash_Table #2023_08_30_Time_2_ms_(97.24%)_Space_43.9_MB_(80.58%)`
	`3`	`+// #Medium #Array #Hash_Table #2025_02_25_Time_1_ms_(100.00%)_Space_45.01_MB_(53.07%)`
`4`	`4`
`5`	`5`	`importjava.util.ArrayList;`
`6`		`-importjava.util.HashMap;`
`7`	`6`	`importjava.util.List;`
`8`		`-importjava.util.Map;`
`9`	`7`
`10`	`8`	`publicclassSolution {`
`11`	`9`	`publicList<List<Integer>>findMatrix(int[]nums) {`
`12`	`10`	`List<List<Integer>>res =newArrayList<>();`
`13`		`-Map<Integer,Integer>map =newHashMap<>();`
`14`		`-for (intx :nums) {`
`15`		`-map.put(x,map.getOrDefault(x,0) +1);`
`16`		`-intidx =map.get(x);`
`17`		`-if (res.size() <idx) {`
	`11`	`+intn =nums.length;`
	`12`	`+int[]freq =newint[n +1];`
	`13`	`+for (intnum :nums) {`
	`14`	`+if (res.size() < ++freq[num]) {`
`18`	`15`	`res.add(newArrayList<>());`
`19`	`16`	`}`
`20`		`-res.get(idx -1).add(x);`
	`17`	`+res.get(freq[num] -1).add(num);`
`21`	`18`	`}`
`22`	`19`	`returnres;`
`23`	`20`	`}`

Comments

(0)