#include<iostream>
#include<string>
using namespace std;
struct elem{
int c;
int juli;
};
void main(){
elem a[256];
for (int i = 0; i < 256; i++){
a[i].c = i;
a[i].juli = -1;
}
char input[256];
gets_s(input);
char *p = input;
elem t;
while (*p != '\0'){
a[*p].juli = abs(*p - 'v');
p++;
}
for (int i = 0; i < 255; i++){
for (int j = 0; j < 255 - i; j++){
if (a[j].juli>a[j + 1].juli){
t = a[j];
a[j]=a[j+1];
a[j + 1] = t;
}
}
}
int i = 0;
for (int i = 0; i < 256; i++){
if (a[i].juli >= 0)
cout << char(a[i].c) << " ";
}
cout << endl;
system("pause");
}
按照与字母v的距离排序,距离小的在前面。(华为2016)
最新推荐文章于 2022-10-11 11:13:44 发布