题解 | #图片整理#
图片整理
https://www.nowcoder.com/practice/2de4127fda5e46858aa85d254af43941
#include <stdio.h>
#include <string.h>
// 试了下字典法
int main() {
char str[1001]={0};
char str1[1001]={0};
char map[]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z','a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};
scanf("%s",str);
int l=strlen(str);
int k=0;
for(int i=0;i<62;i++)
{
for(int j=0;j<l;j++)
{
if(map[i]==str[j])
{
str1[k]=map[i];
k++;
}
}
}
printf("%s",str1);
}
查看21道真题和解析