输入N个整数，找出最大数所在位置，并将它与第一个数对调位置。这利用c++程序的数组和循环要如何实现 c++输入N个整数,找出最大数所在位置,并将它与第一个数对调...
\u6709\u4e00\u4e2a2\u00d73\u7684\u6570\u7ec4,\u7f16\u5199\u7a0b\u5e8f\u627e\u51fa\u5176\u4e2d\u6700\u5927\u6570\u53ca\u5176\u5728\u8be5\u6570\u7ec4\u4e2d\u7684\u4f4d\u7f6e1 \u521b\u5efa10\u4e2a\u6570\u7684\u6570\u7ec4\uff1b
2 \u8f93\u516510\u4e2a\u6570\uff1b
3 \u4ee5\u7b2c\u4e00\u4e2a\u6570\u4e3a\u6700\u5927\u503c\uff0c\u5e76\u904d\u5386\u5269\u4f599\u4e2a\u6570\uff0c\u4e0e\u6700\u5927\u503c\u6bd4\u8f83\uff0c\u5f97\u5230\u6700\u5927\u503c\u4e0b\u6807\u3002
4 \u8f93\u51fa\u6700\u5927\u503c\u53ca\u4e0b\u6807\u3002
\u4ee3\u7801\uff1a
int main()
{
int a[10];
int i,max;
for(i = 0; i < 10; i ++)
scanf("%d",a+i);
for(max = 0, i=1; i<10; i++)
if(a[max]<a[i])max = i;
printf("%d,%d\n",a[max],max);
}
\u4f60\u8fd9\u6837\u590d\u6742\u5316\u4e86\u5427\u3002\u3002\u3002
\u4e0d\u662f\u8bf4\uff0c\u53ea\u8981\u628a\u6700\u5927\u6570\u548c\u7b2c\u4e00\u4e2a\u6570\u4ea4\u6362\u5c31\u53ef\u4ee5\u4e86\uff0c\u4f60\u8fd9\u6837\u662f\u5168\u90e8\u5f80\u540e\u79fb\u52a8\u4e86\u3002
\u4f60\u53ea\u8981 \u627e\u51fa\u6700\u5927\u6570\uff0c\u7136\u540e\u8ddfx[0]\u4ea4\u6362\u5c31\u53ef\u4ee5\u4e86\u3002
\u9700\u8981\u4ee3\u7801\uff0c\u53ef\u4ee5\u8ffd\u95ee\u6211\u3002
void part_1(int *p,int len)
{
int i=0,r=len-1,t;
while(i<r)
{
if(p[i]>p[r])
r--;
else
i++;
}
t=p[0];
p[0]=p[i];
p[i]=t;
}
#include<iostream>
using namespace std;
#define N 10
void main()
{ int a[N],maxi,i,k;
for ( i=0;i<N;i++ ) cin>>a[i];
maxi=0; for ( i=1;i<N;i++ ) if ( a[maxi]<a[i] ) maxi=i;
k=a[0]; a[0]=a[maxi]; a[maxi]=k;
for ( i=0;i<N;i++ ) cout<<a[i]<<' ';
cout<<endl;
}
绛旓細,&number);max=number;min=number;for(i=1;i<n;i++){scanf("%d",&number);if (number>max) max=number;if (number<min) min=number;}printf("Max=%d\nMin=%d\n",max,min); //杈撳嚭n涓暟涓殑鏈澶鍊煎拰鏈灏忓笺倉鏍蜂緥杈撳叆锛5 10 -1 0 12 -5 鏍蜂緥杈撳嚭锛歁ax=12 Min=-5 ...
绛旓細鍒╃敤C璇█鍦ㄤ竴鎵规暟涓鎵炬渶澶ф暟鐨勪竴鑸柟娉曞涓嬶細锛1锛夊皢鏁版嵁瀛樺叆涓涓竴缁存暟缁勪腑锛屼緥濡傚瓨鍏鏁扮粍涓傦紙2锛夊湪鏁扮粍涓壘鏈澶у硷紙鍋囪鐢ㄥ彉閲弇ax瀛樻斁鏈澶у硷級銆傞鍏堝皢a[0]瑙嗕负鏈澶鏁帮紝鍗抽鍏堜娇max=a[0]銆傚皢闄[0]涔嬪鐨勫叾浠栨墍鏈夊厓绱狅紙鐢╝[i]琛ㄧず锛夐愪釜涓巑ax姣旇緝锛岃嫢a[i]>max,鍒檃[i]涓虹洰鍓嶇殑...
绛旓細鏄殑,max=0鏄湁闂鐨,濡傛灉杈撳叆鐨勬暟閮藉皬浜0,0灏辨垚涓鏈澶鍊间簡,鑰岃緭鍏ョ殑鏁颁腑娌℃湁0,杩欐牱鏄剧劧涓嶅.姝ｇ‘鐨勫仛娉曟槸鎶婄涓涓暟璧嬬粰max,鍚庨潰鐨勬暟鍜宮ax姣旇緝.瀹屾暣鐨凜璇█绋嬪簭濡備笅(瑙佸浘)
绛旓細include<stdio.h> define N 10 void main(){ int i,a[N],max,min;for ( i=0;i<N;i++ ) scanf("%d",&a[i]);for ( i=1,max=min=a[0],i<N;i++ ){ if ( a[i]>max ) max=a[i];if ( a[i]<min ) min=a[i];} printf("鏈澶鍊=%d,鏈灏忓=%d\n",max,min)...
绛旓細include intmain(){ intn,a,i,t;scanf("%d",&n);if(n<=0){ printf("杈撳叆n鐨勫奸敊璇");return0;} scanf("%d",&t);//鍏堣鐨勭涓涓暟瑕侀粯璁ゆ垚鏈澶鐨勶紝涓嶇劧锛宼鐨勫垵鍊兼槸涓嶅畾鐨 for(i=1;i{ scanf("%d",&a);if(t} printf("%d",t);return0;// } ...
绛旓細include<stdio.h>int main(){int n,a,i,t;scanf("%d",&n);scanf("%d",&t); //鍏堣鐨勭涓涓暟瑕侀粯璁ゆ垚鏈澶鐨勶紝涓嶇劧锛宼鐨勫垵鍊兼槸涓嶅畾鐨刦or(i=1;i<n;i++) //寰幆涓啀璇籲-1涓暟{scanf("%d",&a);if(t
绛旓細鏁扮粍閮芥槸瀹氶暱鐨勩傜敱缂栫▼浜哄憳鏍规嵁闂鐨勫疄闄呮儏鍐靛拰璁＄畻鏈虹殑鑳藉姏鍚堢悊纭畾銆n涓嶈秴杩100锛屾湰绋嬪簭澶辨晥銆俢璇█鏈夊姩鎬佸唴瀛樼敵璇峰姛鑳
绛旓細鎶杈撳叆鐨勬暟杞寲涓哄瓧绗︿覆鏁扮粍锛屾牴鎹瓧绗︿覆鐨勯暱搴︼紙浣嶆暟锛夌‘瀹氬惊鐜鏁帮紝鐢ㄤ袱涓彉閲忓瓨鏈澶ф暟鍜屾渶灏忔暟锛屾瘡娆″彇鍑轰竴浣嶅拰鍓嶉潰杩涜姣旇緝锛屽嵆鍙眰鍑 浣跨敤鐨勫嚱鏁 itoa 鎶鏁村瀷鏁板瓧杞寲涓哄瓧绗︿覆 atoi 鎶婂瓧绗︿覆杞寲涓烘暣鍨嬫暟瀛
绛旓細scanf("%d",n);for(int i=0;i<n;i++)//for寰幆杈撳叆鏁存暟 scanf("%d",a[i]);MAX(a,n);MIN(a,n);Ping_Jun_Shu(a,n);} void MAX(int *a,int N){ int max=0,i=0,t;for(;i<n;i++)if(max<=a[i])max=a[i];printf("n涓暣鏁涓殑鏈澶ф暟鏄細%d",max);printf("\n...
绛旓細涓嬮潰鏄竴涓娇鐢ㄥ惊鐜鍙ユ眰瑙n涓暣鏁鐨鏈澶鍊肩殑C璇█绋嬪簭锛歩nclude <stdio.h> int main() { int n, i, num, max;printf("璇杈撳叆n锛");scanf("%d", &n);printf("璇疯緭鍏%d涓暣鏁帮細", n);scanf("%d", &num);max = num;for (i = 2; i <= n; i++) { scanf("%d", &num);...
