Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit01347e7

Browse files
authored
Update Minimum Deletions to Make Character Frequencies Unique.java
1 parent65f9add commit01347e7

File tree

1 file changed

+21
-21
lines changed

1 file changed

+21
-21
lines changed
Lines changed: 21 additions & 21 deletions
Original file line numberDiff line numberDiff line change
@@ -1,25 +1,25 @@
11
classSolution {
2-
publicintminDeletions(Strings) {
3-
int[]frequency =newint[26];
4-
for (charc :s.toCharArray()) {
5-
frequency[c -'a']++;
6-
}
7-
PriorityQueue<Integer>pq =newPriorityQueue<>(Collections.reverseOrder());
8-
for (intfreq :frequency) {
9-
if (freq >0) {
10-
pq.add(freq);
11-
}
12-
}
13-
intnumOfDeletions =0;
14-
while (!pq.isEmpty()) {
15-
intremovedFreq =pq.poll();
16-
if (!pq.isEmpty() &&pq.peek() ==removedFreq) {
17-
numOfDeletions++;
18-
if (removedFreq >1) {
19-
pq.add(removedFreq -1);
2+
publicintminDeletions(Strings) {
3+
int[]frequency =newint[26];
4+
for (charc :s.toCharArray()) {
5+
frequency[c -'a']++;
6+
}
7+
Arrays.sort(frequency);
8+
intnumOfDeletions =0;
9+
intexpectedFrequency =frequency[25];
10+
for (inti =25;i >=0;i--) {
11+
if (frequency[i] ==0) {
12+
break;
13+
}
14+
if (frequency[i] >expectedFrequency) {
15+
numOfDeletions +=frequency[i] -expectedFrequency;
16+
}else {
17+
expectedFrequency =frequency[i];
18+
}
19+
if (expectedFrequency >0) {
20+
expectedFrequency--;
21+
}
2022
}
21-
}
23+
returnnumOfDeletions;
2224
}
23-
returnnumOfDeletions;
24-
}
2525
}

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp