题解 | #牛牛的替换#
牛牛的替换
https://www.nowcoder.com/practice/f2a107dbb99243798d3048a672e8f747
#include <stdio.h>
#include <stdio.h>
int main()
{
int n,i1,i2;
char zu[1000] = { 0 };
char a, a1, b, b1;
scanf("%d %c %c %c %c", &n, &a, &a1, &b, &b1);
getchar();
scanf("%s", zu);
for (i1 = 0; i1 < n; i1++)
{
if (zu[i1] == a)
{
zu[i1] = a1;
}
if (zu[i1] == b)
{
zu[i1] = b1;
}
}
printf("%s", zu);
return 0;
}
MDPI公司福利 122人发布