blob: 0f77d83acf0428c9c193b8723c197b05877fc7e0 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
|
// 3223. Minimum Length of String After Operations
#include "leetcode.h"
/*
* you are given a string 's'. you can perform the following process on 's' any
* number of times: choose an index 'i' in the string such that there is at
* least one character to the left of index 'i' that is equal to 's[i]' and at
* least one character to the right that is also equal to 's[i]', delete the
* closest character to the left of index 'i' that is equal to 's[i]', delete
* the closest character to the right of index 'i' that is equal to 's[i]'.
* return the minimum length of the final string 's' that you can achieve
*/
int minimumLength(char *s) {
int *lower_cnt = (int *)calloc(26, sizeof(int)), ans = 0;
for (int i = 0; s[i] != '\0'; i++) {
assert(s[i] >= 'a' && s[i] <= 'z');
lower_cnt[s[i] - 'a']++;
}
for (int i = 0; i < 26; i++)
ans += lower_cnt[i] <= 2 ? lower_cnt[i] : (lower_cnt[i] % 2 ? 1 : 2);
free(lower_cnt);
return ans;
}
int main() {
char *s1 = "abaacbcbb", *s2 = "aa";
printf("%d\n", minimumLength(s1)); // expect: 5
printf("%d\n", minimumLength(s2)); // expect: 2
}
|