给定一个长度为100的整型数组。其中存储的数据不超过20个，并升序排列，其余的元素均为0。要求如下 定义一个有100元素的数组，输入100个数，按照升序排列,用...
\u5b9a\u4e49\u4e00\u4e2a\u957f\u5ea6\u4e3a100\u7684\u6574\u578b\u6570\u7ec4\uff0c\u6309\u5347\u5e8f\u7684\u65b9\u5f0f\u521d\u59cb\u5316\u90e8\u5206\u6570\u636e\uff0c\u4f8b\u5982int a[100]={23,45,60,67,88}\u3002#include int main(){ int a[100] = {23, 45, 60, 67, 88}, len = 5; int value; int i, type, j; while (scanf ("%d", &value)){ if (value value){ type = 2; break; } } if (i >= len){ a[len++] = value; } else { if (type == 1){ for (j = i; j i; --j){ a[j] = a[j-1]; } len++; a[i] = value; } } for (i = 0; i = 100){ printf ("More than 100!\n"); break; } } /* for (i = 0; i < len; ++i){ printf ("%5d", a[i]); } printf ("\n");*/}
\u6392\u5e8f\u6709\u597d\u591a\u79cd\u554a\uff0c\u770b\u770b\u6570\u636e\u7ed3\u6784\u5427\uff0c100\u4e2a\u5143\u7d20\uff0c\u597d\u70b9\u7684\u6392\u5e8f\u7b97\u6cd5\u90fd\u53ef\u4ee5\u554a\uff0c\u6548\u7387\u4e0d\u8981\u592a\u4f4e\u5c31\u597d\u5427~\u4e3a\u4ec0\u4e48\u8981PAD\u56fe\uff1f\u6709\u7b97\u6cd5\u4e0d\u884c\u5417\uff1f\u81ea\u5df1\u6539\u6210PAD\u56fe\u4e0d\u5c31\u597d\u4e86\u5417\uff1f
#include <stdio.h>
#define N 100
//选择排序函数
void select_sort(int *arr,int n)
{
int i,j,k,tmp;
for(i=0;i<n-1;i++)
{
k=i;
for(j=i+1;j<n;j++)
if(arr[k]>arr[j])
k=j;
if(k!=i)
{
tmp=arr[i];
arr[i]=arr[k];
arr[k]=tmp;
}
}
}
//插入一个数num
void insertNum(int *arr, int len, int n)
{
int i;
for(i=len-1; i >= 0; i--)
{
if(arr[i]>n)
arr[i+1]=arr[i];
else
break;
}
arr[i+1]=n;
}
int main()
{
int a[N]={0}; //初始化数组为0
int i,len,n;
scanf("%d",&len); //输入数组的长度
for(i=0;i<len;i++)
scanf("%d",&a[i]); //输入数组元素
select_sort(a,len); //调用排序函数
scanf("%d",&n); //输入待插入元素
insertNum(a,len,n); //调用插入函数
for(i=0;i<len+1;i++) //输出新的数组元素
printf("%d ",a[i]);
return 0;
}
示例运行结果：
5 //要输入的数组元素个数
1 4 6 3 8 //输入数组元素
5 //待插入的元素
1 3 4 5 6 8 //输出插入后的数组，并按升序输出
绛旓細1 4 6 3 8 //杈撳叆鏁扮粍鍏冪礌 5 //寰呮彃鍏ョ殑鍏冪礌 1 3 4 5 6 8 //杈撳嚭鎻掑叆鍚庣殑鏁扮粍锛屽苟鎸夊崌搴忚緭鍑
绛旓細include <stdio.h>int main(){ int a[100] = {23, 45, 60, 67, 88}, len = 5; int value; int i, type, j; while (scanf ("%d", &value)){ if (value < 0)break; for (i = 0; i < len; ++i){ if (value == a[i]){ type = 1; ...
绛旓細{ int a[100],i,n=0,x=1;//x鐨勫垵鍊间繚璇佽兘杩涘叆寰幆 while(x)//鍙互鏃犻檺杈撳叆鏁版嵁 { scanf("%d",&x);//璇诲彇涓涓鏁存暟 if(x)a[n++]=x;//濡傛灉涓嶆槸0灏卞瓨鍏鏁扮粍 } for (i=0; i<n; i++)//姝ｅ簭杈撳嚭褰曞叆鐨勬暟鎹 printf("%d ",a[i]);return 0;} ...
绛旓細17 int tmp[100]={0};18 int i;19 for(i=0;i<100;i++)20 { 21 tmp[i]=i; //鍥犱负鍘熸潵鏁扮粍娌℃湁璧嬪硷紝杩欓噷灏卞伔鎳掗殢渚胯祴鍊间簡 22 } 23 cout<<sum(tmp)<<endl;24 return 0;25 }
绛旓細濡傛灉鎷彿閲岄潰鏄 int a[]閭ｄ箞 public static int[] rN(int[] a){ int[] s= a;//灏唖浣滀负涓浆 int[] result = new int[10];//缁撴灉鏁扮粍 int lenth = 100;//鎬闀垮害100 Random rd = new Random();for (int j=0; j<10; j++){ result[j] = s[rd.nextInt(lenth)];//浜х敓涓涓...
绛旓細1銆佸畾涔涓涓澶у皬鏄100鐨鏁扮粍 int arr[]=new int[100];//瀹氫竴涓100澶у皬鐨勬暣鍨嬫暟缁2銆佸惊鐜祴鍊1-100鐨勬暟 for(int i=1;i<=100;i++){ arr[i-1] = i;//璧嬪1-100鐨勬暟}3銆侀亶鍘嗘暟缁 for(int i=0;i<arr.length;i++){//鏁扮粍鏈澶у兼槸arr.length锛屽惊鐜亶鍘嗘暟缁 System.out.println...
绛旓細int num = rnd.Next(1, 101); //闅忔満鐢熸垚1鍒100鐨鏁 if (!myList.Contains(num)) //鍒ゆ柇闆嗗悎涓槸鍚﹀凡缁忓瓨鍦 myList.Add(num); //娣诲姞鍒伴泦鍚堜腑 } for (int i = 0; i < 100; i++) //閬嶅巻涓缁鏁扮粍 intArr[i] = (int)myList[i]; //涓轰竴缁存暟缁勮祴鍊 for (int ...
绛旓細public class Test { public static void main(String[] args) { int[] ary = new int[100];for(int i = 0, j= 100; i < ary.length; i++){ ary[i] = j++;} } }
绛旓細import java.util.Scanner;public class Main { public static void main(String[] args) { Scanner scanner = new Scanner(System.in);int[] nums = new int[100]; // 瀹氫箟涓涓暱搴︿负100鐨勬暣鍨嬫暟缁 int sum = 0; // 瀹氫箟涓涓彉閲忕敤浜庣疮鍔犳暟缁勪腑鐨勫厓绱犲 int count = 0; // 瀹氫箟涓涓...
绛旓細include<stdio.h> void main(){ float k;int a[100],i;for ( i=0,k=0;i<100;i++ ) scanf("%d",&a[i]);k/=100;printf("骞冲潎鍊=%.2f",k);printf("浠ヤ笅杩欎簺鏁版嵁澶т簬骞冲潎鍊硷細\n");for ( i=0;i<100,i++ ) if ( a[i]>k ) printf("%d ",a[i]); printf("\n");...
