华为机试题
/* zhengshupaixu */ #include <iostream> using namespace std; #define LEN 100 void sort(int a[],int n) { int i,j,k,temp; for (i = 0;i<n-1;i++) { k = i; for (j = i+1;j<n;j++) { if(a[k]>a[j]) { k=j; } } if (k != i) { temp = a[k]; a[k] = a[i]; a[i] = temp; } } } void main() { int a[LEN] = {'\0'}; int n=0,num; char c ='\0'; int i=0; int max,min; while (c != '\n'&& n<LEN) { scanf("%d",&num); a[n] = num; n++; scanf("%c",&c); } sort(a,n); tt:max = min = a[i]; while (a[i+1]-a[i] == 1 || a[i+1]-a[i] == 0) { max = a[i+1]; i++; } if (max != min) printf("%d %d ",min,max); else printf("%d ",min); if (i<n - 1) { i++; goto tt; } }
之前准备的华为机试,都是在平台上测试通过的