c++代码：在n个数中，求两个最小的数。（第一小，第二小） 怎样在c++中实现：输入n个数，找到其中最小的数和最大的数？
C++\u4e2d\u600e\u4e48\u627e\u51fa\u4e00\u7ef4\u6570\u7ec4\u4e2d\u6700\u5c0f\u7684\u4e24\u4e2a\u6570\u3000\u3000\u53ef\u4ee5\u5148\u6392\u5e8f\u518d\u8f93\u51fa\u6700\u5c0f\u7684\u4e24\u4e2a\u6570
\u3000\u3000\u4e5f\u53ef\u4ee5\u91c7\u7528\u4e0b\u9762\u7684\u65b9\u6cd5\uff0c\u4e0d\u7528\u6392\u5e8f\u76f4\u63a5\u7ed9\u51fa\u6700\u5c0f\u7684\u4e24\u4e2a\u6570
\u3000\u3000\u601d\u8def\uff1a\u6570\u7ec4\u4e2d\u6570\u548c\u4e24\u4e2a\u6570\u4f9d\u5e8f\u6bd4\u8f83\uff0c\u6bd4\u8fd9\u4e24\u4e2a\u4e2d\u7684\u4e00\u4e2a\u5c0f\uff0c\u5219\u4e0e\u5176\u4ea4\u6362
void getmin(int array[],int arraylen,int out[],int outlen){//outlen\u5e94\u8be5\u4e3a2 int i,j; for(i=0;i<outlen;i++)out[i] = 0x7FFFFFFF;//\u8fd9\u662f\u4e00\u4e2a\u6700\u5927\u6574\u6570\u503c for(i=0;i<arraylen;i++){//\u904d\u5386\u6570\u7ec4 for(j=0;j<outlen;j++){//\u904d\u5386\u6700\u5c0f\u6570\u5217\u8868 if(array[i]<out[j]){//array\u4e2d\u7684\u6570\u66f4\u5c0f out[j] = array[i];//\u8bb0\u5f55\u8be5\u6570 break; } //\u5982\u679cout\u4e2d\u7684\u6570\u5c0f\uff0c\u5219\u770b\u770b\u4e0b\u4e00\u4e2aout\u6570\u4f1a\u4e0d\u4f1a\u6bd4\u8fd9\u4e2a\u5927 } }}\u3000\u3000\u8fd9\u4e2a\u65b9\u6cd5\u53ef\u4ee5\u9002\u7528\u4e8e\u67e5\u627e\u4e00\u7ef4\u6570\u7ec4\u4e2d\u6700\u5c0f\u7684n\u4e2a\u6570
\u3000\u53ef\u4ee5\u5148\u6392\u5e8f\uff0c\u518d\u8f93\u51fa
#include#include using namespace std;int main(){cout>N;cout>a[i];sort(a,a+N);cout<<"The biggest number is "<<a[N-1]<<endl;cout<<"The smallest number is "<<a[0]<<endl;return 0;}\u7ed3\u679c\u5982\u4e0b
\u4e0a\u9762\u662f\u4e3a\u4e86\u5927\u5bb6\u7c98\u8d34\u4ee3\u7801\u65b9\u4fbf\uff0c\u4e0b\u9762\u6211\u662f\u4ee3\u7801\u548c\u7ed3\u679c\u4e00\u8d77\uff0c\u6211\u8fd9\u8fb9\u786e\u5b9e\u662f\u53ef\u4ee5\u8fd0\u884c
#include "stdafx.h"
#include <iostream>
using namespace std;
int _tmain(int argc, _TCHAR* argv[])
{
cout<<"请输入你要比较的数的个数n："<<endl;
int n;
cin>>n;
cout<<"请输入你要比较的"<<n<<"个数："<<endl;
int *a=new int[n];
for (int i=0;i<n;i++)
{
cin>>a[i];
}
int Min_F,Min_S;
if (a[0]>a[1])
{
Min_F=a[1];
Min_S=a[0];
}
else Min_F=a[0],Min_S=a[1];
for (int j=2;j<n;j++)
{
if (a[j]<=Min_F)
{
Min_S=Min_F;
Min_F=a[j];
}
else if (Min_F<a[j]&&Min_S>=a[j])
{
Min_S=a[j];
}
}
cout<<"第一小数为："<<Min_F<<endl;
cout<<"第二小数为："<<Min_S<<endl;
delete []a;
}
#include <iostream.h>
#define N 10000
void main(){
int s[N];
int m1,m2,n,i;
cout<<"输入要输入的数字个数n>=2:";
cin>>n;
for(i=0;i<n;i++)
cin>>s[i];
if(s[0]<s[1]){
m1 = s[0];
m2 = s[1];
}else{
m2 = s[0];
m1 = s[1];
}
for(i = 2; i < n; i++){
if(s[i] <= m2){
if(s[i]<m1){
m2 = m1;
m1 = s[i];
}else{
m2=s[i];
}
}
}
cout<<"最小:"<<m1<<'\n'<<"第二小:"<<m2<<'\n';
}
#include<iostream>
using namespace std;
int main()
{
int a[] = {12,5,8,3,9,23};
int first,second,i;
first = a[0];
second = a[0];
for ( i=1;i<6;i++)
{
if (a[i] < second)
{
if (a[i] < first)
{
second = first;
first = a[i];
}
else second = a[i];
}
}
cout<<"最小的数:"<<first<<",第二小的数:"<<second<<endl;
return 0;
}
也可以用排序的，然后输出两个最小的数
#include "stdio.h"
#define N 10
void main()
{
int a[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
int min1 = 100;
int min2 = 100;
for (int i = 0; i < N; i++)
{
if (a[i] < min1)
{
min1 = a[i];
}
if (a[i] < min2 && a[i] > min1)
{
min2 = a[i];
}
}
printf("%d%d",min1,min2);
}
#include"iostream"
using namespace std;
class min
{
public:
float a[n];
void input()
{
scanf("%d",&n);
int i;
for(i=0;i<n;i++)
scanf("%f",a[i]);
for(i=0;i<n;i++)
printf("输入的数据:",a[i]);
}
private:
int i,n;
};
void min::compare()
{
int min1,min2;
int i;
if(a[0]<a[1]){
min1 =a[0];
min2 =a[1];
}else{
min2 = a[0];
min1 = a[1];
}
for(i = 2; i < n; i++){
if(a[i] <= min2){
if(a[i]<min1){
min2 = min1;
min1 = a[i];
}else
min2=a[i];
}
cout<<"第一个："<<min1<<"第二个："<<min2<<endl;
}
void main()
{
min T;
T.input();
T.compare();
}
绛旓細include<iostream> using namespace std;int max(int,int);int max(int m,int n){return(m>n)?m:n;} int main(){ cout<<"璇疯緭鍏3涓暣鏁"<<endl;int x,y,z;cin>>x>>y>>z;cout<<"杩欎笁涓暣鏁颁腑鏈澶х殑鏄細";cout<< max(max(x,y),z)<<endl;} ...
绛旓細浠ヤ笅鏄竴涓畝鍗曠殑C璇█绋嬪簭锛岀敤浜庤緭鍏N涓暣鏁骞舵眰鍜岋細鍦ㄨ繖涓▼搴忎腑锛屾垜浠鍏堝畾涔変簡涓や釜鏁村瀷鍙橀噺num鍜孨锛岀敤浜庡瓨鍌ㄧ敤鎴疯緭鍏ョ殑鏁板拰鏁扮殑涓暟銆傜劧鍚庯紝鎴戜滑浣跨敤printf鍑芥暟杈撳嚭鎻愮ず淇℃伅锛屼娇鐢╯canf鍑芥暟浠庣敤鎴峰璇诲彇鏁扮殑涓暟N銆傜劧鍚庯紝鎴戜滑浣跨敤if璇彞妫鏌鏄惁鍦ㄦ湁鏁堣寖鍥村唴锛堝ぇ浜0涓斿皬浜庢垨绛変簬100锛夈傚鏋淣涓嶅湪...
绛旓細void MIN(int *a,int N){ int min=0;for(int i=0;i<N;i++){ if(a[i]<=min)min=a[i];} printf("n涓暣鏁颁腑鐨勬渶灏忔暟鏄細%d",min);printf("\n");} void Ping_Jun_Shu(int *a,int N){ int pjs,sum=0锛宯=0,i=0;for(;i<N;i++)if(a[i] % 2==0){sum=sum+...
绛旓細鍙傝冪▼搴忓涓嬶細锛堟垜鑷繁缂栧啓鐨勶紝鍙兘鏈変笉瓒充箣澶勶紝鏈涜璋咃級include<stdio.h> int max(int x,int y){ int t;t=x>y? x:y;return t;} void main(){ int a,b,c,m;printf("please input three numbers:\n");scanf("%d,%d,%d",&a,&b,&c);m=max(max(a,b),c);printf("the ...
绛旓細include<iostream> using namespace std;int max(int,int);int max(int m,int n){return(m>n)?m:n;} int main(){ cout<<"璇疯緭鍏3涓暣鏁"<<endl;int x,y,z;cin>>x>>y>>z;cout<<"杩欎笁涓暣鏁颁腑鏈澶х殑鏄細";cout<< max(max(x,y),z)<<endl;} 鏈涢噰绾筹紒璋㈣阿锛
绛旓細fan(a,b)If(a>b) reture b;If(a
绛旓細} 2銆乮nclude<stdio.h> //閾炬帴鏍囧噯澶存枃浠 define N 5 //瀹氫箟甯搁噺N骞惰祴鍊间负5 void main() //涓诲嚱鏁板叆鍙 { //琛ㄧず涓诲嚱鏁板紑濮 int i,j; //瀹氫箟鏁村舰鍙橀噺i鍜宩 int grade[N],temp; //瀹氫箟N缁达紙N锛5锛屼篃灏辨槸浜旂淮鍟^锛夋暣褰㈡暟缁勫拰鏁村舰鍙橀噺temp printf("杈撳叆5涓暟\n"); //鍦ㄥ睆骞曚笂鏄惧紡...
绛旓細int gcd(int a, int b) //lgcd鏈澶у叕鍥犳暟 { int i = 0, g = 0;int m = 0;m = a < b? a : b;for(i = 1; i < m; i++){ if(a%i == 0 && b%i == 0){ g = i;} } return g;} int main(){ int a = 0, b = 0;int c = 0;printf("Input number...
绛旓細鍦 C 璇█涓紝鍙互閫氳繃浠ヤ笅浠ｇ爜瀹炵幇浠庨敭鐩樿緭鍏ヤ袱涓暣鏁帮紝鐒跺悗姹傝繖涓や釜鏁存暟鐨勬渶灏忓硷細include <stdio.h> int main() { int num1, num2, min;printf("璇疯緭鍏涓や釜鏁存暟锛\n");scanf("%d %d", &num1, &num2);if (num1 < num2) { min = num1;} else { min = num2;} printf("鏈...
绛旓細閿欒锛氬摢閲屽０鏄巑axc浜嗭紵浣犵殑鏄C璇█锛屽畠鏄笉鏀寔鍦浠ｇ爜鍧楃殑琛屼腑闂村０鏄庡彉閲忕殑銆傞昏緫涓婄湅涓嶆槑鐧借骞蹭粈涔堛傛彁渚涗竴涓涓嬶細//#include "stdafx.h"//vc++6.0鍔犱笂杩欎竴琛.include "stdio.h"void main(void){ int n,x,max,min,i;scanf("%d%d",&n,&x);for(max=min=x,i=1;i<n;i++){ ...
