fix two answers to make them correct (100 pts.)
This commit is contained in:
parent
a5d49c0c3f
commit
e5ebc0c533
|
@ -1,5 +1,4 @@
|
||||||
// https://bbc3502.hopto.org/c2021/index.php/home-17/590-3
|
// https://bbc3502.hopto.org/c2021/index.php/home-17/590-3
|
||||||
/* ⚠*** This code is not perfect *** */
|
|
||||||
#include <stdio.h>
|
#include <stdio.h>
|
||||||
|
|
||||||
//将只包含小写字母的字符串str中的元音字母复制到字符数组vowel,并返回元音字符的个数。
|
//将只包含小写字母的字符串str中的元音字母复制到字符数组vowel,并返回元音字符的个数。
|
||||||
|
@ -23,14 +22,17 @@ int main() {
|
||||||
#include <string.h>
|
#include <string.h>
|
||||||
#pragma GCC optimize("Ofast,inline")
|
#pragma GCC optimize("Ofast,inline")
|
||||||
int getVowel(char str[], char vowel[]) {
|
int getVowel(char str[], char vowel[]) {
|
||||||
char vowelstr[] = {'a', 'e', 'i', 'o', 'u', '\0'};
|
char vowelstr[] = {'a', 'e', 'i', 'o', 'u'};
|
||||||
int len = 0;
|
int len = 0;
|
||||||
for (int i = 0, n = strlen(str); i < n; i++) {
|
for (int i = 0, n = strlen(str); i < n; i++) {
|
||||||
for (int j = 0, m = strlen(vowelstr); j < m; j++) {
|
for (int j = 0, m = sizeof(vowelstr) / sizeof(char); j < m; j++) {
|
||||||
if (vowelstr[j] == str[i]) {
|
if (vowelstr[j] == str[i]) {
|
||||||
vowel[len++] = str[i];
|
vowel[len++] = str[i];
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
// vowel[len] is a trash value, and will lead to undefined behavior in some
|
||||||
|
// cases
|
||||||
|
vowel[len] = '\0';
|
||||||
return len;
|
return len;
|
||||||
}
|
}
|
|
@ -11,9 +11,14 @@ int main(void) {
|
||||||
|
|
||||||
// Process string
|
// Process string
|
||||||
int count = 0;
|
int count = 0;
|
||||||
for (int i = 0, n = strlen(str); i < n; i++) {
|
int mismatch = 0;
|
||||||
|
for (int i = 0, n = strlen(str); i < n && !mismatch; i++) {
|
||||||
if (str[i] == '(') {
|
if (str[i] == '(') {
|
||||||
count++;
|
if (count < 0) { // )(
|
||||||
|
mismatch = 1;
|
||||||
|
} else {
|
||||||
|
count++;
|
||||||
|
}
|
||||||
} else if (str[i] == ')') {
|
} else if (str[i] == ')') {
|
||||||
count--;
|
count--;
|
||||||
}
|
}
|
||||||
|
|
Loading…
Reference in a new issue