定义一个长度为100的整型数组，按升序的方式初始化部分数据，例如int a[100]={23,45,60,67,88}。 给定一个长度为100的整型数组。其中存储的数据不超过20个，...
\u521d\u59cb\u5316\u4e00\u4e2a\u957f\u5ea6\u4e3a100\u7684int\u6570\u7ec4\uff0c\u6570\u7ec4\u4e2d\u7684\u5143\u7d20\u4f9d\u6b21\u4e3a100-1\u3002\u5e76\u5c06\u6570\u7ec4\u7684\u5143\u7d20\u6253\u5370\u51fa\u6765\u3002public class Test {
public static void main(String[] args){
//\u5b9a\u4e49\u6570\u7ec4
int[] datas=new int[100];
//\u6570\u7ec4\u521d\u59cb\u5316
for(int i=100 ; i>0 ; i--){
datas[100-i]= i ;
}
//\u8f93\u51fa\u6570\u7ec4\u5143\u7d20
for(int i=0 ; i>100 ; i++){
System.out.println(datas[i]);
}
}
}
#include #define N 100//\u9009\u62e9\u6392\u5e8f\u51fd\u6570void select_sort(int *arr,int n){ int i,j,k,tmp; for(i=0;iarr[j]) k=j; if(k!=i) { tmp=arr[i]; arr[i]=arr[k]; arr[k]=tmp; } }}//\u63d2\u5165\u4e00\u4e2a\u6570numvoid 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}; //\u521d\u59cb\u5316\u6570\u7ec4\u4e3a0 int i,len,n;scanf("%d",&len); //\u8f93\u5165\u6570\u7ec4\u7684\u957f\u5ea6 for(i=0;i<len;i++) scanf("%d",&a[i]); //\u8f93\u5165\u6570\u7ec4\u5143\u7d20 select_sort(a,len); //\u8c03\u7528\u6392\u5e8f\u51fd\u6570 scanf("%d",&n); //\u8f93\u5165\u5f85\u63d2\u5165\u5143\u7d20 insertNum(a,len,n); //\u8c03\u7528\u63d2\u5165\u51fd\u6570 for(i=0;i<len+1;i++) //\u8f93\u51fa\u65b0\u7684\u6570\u7ec4\u5143\u7d20 printf("%d ",a[i]); return 0;}\u793a\u4f8b\u8fd0\u884c\u7ed3\u679c\uff1a
5 //\u8981\u8f93\u5165\u7684\u6570\u7ec4\u5143\u7d20\u4e2a\u6570
1 4 6 3 8 //\u8f93\u5165\u6570\u7ec4\u5143\u7d20
5 //\u5f85\u63d2\u5165\u7684\u5143\u7d20
1 3 4 5 6 8 //\u8f93\u51fa\u63d2\u5165\u540e\u7684\u6570\u7ec4\uff0c\u5e76\u6309\u5347\u5e8f\u8f93\u51fa
#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;
break;
}
else if (a[i] > value){
type = 2;
break;
}
}
if (i >= len){
a[len++] = value;
}
else {
if (type == 1){
for (j = i; j < len-1; ++j){
a[j] = a[j+1];
}
len--;
}
else if (type == 2){
for (j = len; j > i; --j){
a[j] = a[j-1];
}
len++;
a[i] = value;
}
}
for (i = 0; i < len; ++i){
printf ("%5d", a[i]);
}
printf ("
");
if (len >= 100){
printf ("More than 100!
");
break;
}
}
/*
for (i = 0; i < len; ++i){
printf ("%5d", a[i]);
}
printf ("
");*/
}
绛旓細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");...
绛旓細JavaScript涓０鏄涓涓暱搴100鍏冪礌閮戒负0鐨勬暟缁鏈夊緢澶氭柟娉曪紝鏈绠鍗曠殑鍙互浣跨敤寰幆鐨勬柟娉曞拰鍏朵粬鐨勬柟娉曘傚伐鍏峰師鏂欙細缂栬緫鍣ㄣ佹祻瑙堝櫒 鏂规硶涓锛氬彲浠ヤ娇鐢╳hile寰幆鐨勬柟娉曡繘琛屽惊鐜祴鍊硷紝浠ｇ爜濡備笅锛歷ar arr = new Array(100), i=arr.length;while(i--){arr[i] = 0;}鏂规硶浜岋細浣跨敤apply鏂规硶鍜宮ap鏂规硶鏉ュ疄鐜帮紝...
绛旓細include <stdio.h> define M 100 void main(void){ int i;char ch;int num;int point;int array[M];int count = 20;for (i=0; i<count; i++)//鍒濆鍖栧墠20涓厓绱 { array[i] = i;} do { printf("璇疯緭鍏ユ彃鍏ユ暟瀛:");scanf("%d", &num);printf("\n");printf("璇疯緭鍏ユ彃鍏...
绛旓細include <stdio.h>int main(){int a[100];int i;for( i=0;i<100;i++ ){scanf("%d", &a[i] );if ( getchar()=='\n')break;}printf("input num:%d\n", i+1 );for( ;i>=0;i-- ) printf("%d ", a[i] );printf("\n");return 0;} ...
绛旓細if (Array.IndexOf(arr, temp) == -1){ arr[i] = temp;break;} else { temp = r.Next(1, 100);} } System.Console.WriteLine(arr[i]);} System.Console.Read();杩欎釜绠楁硶鏁堢巼浼氭湁鐐逛綆锛屼负浜嗛槻姝㈤噸澶嶏紝寰幆瓒婂埌鍚庨潰灏濊瘯鐨勯殢鏈烘暟浼氳秺鏉ヨ秺澶氥傚彲浠ユ敼涓哄鍒涘缓涓涓鍊间负1~100鐨勬暟缁锛岄殢鏈...
绛旓細for(int i=0;i<=array.length;i++){ Collections.addAll(list, i);} Collections.reverse(list);System.out.println("鍙嶈浆鍚庯細"+list);} } 杩愯缁撴灉濡備笅锛氬弽杞悗锛歔100, 99, 98, 97, 96, 95, 94, 93, 92, 91, 90, 89, 88, 87, 86, 85, 84, 83, 82, 81, 80, 79, 78...
绛旓細濡傛灉鎷彿閲岄潰鏄 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)];//浜х敓涓涓...
绛旓細include #include <stdio.h>#include <stdlib.h>int main(){ int i = 0, j,k,t; srand((unsigned int)time(NULL)); int a[100]; for(i=0;i<=99;i++) //浜х敓闅忔満鏁扮粍1鍒100 {a[i]=rand() % 100;a[i]++;} { for(i=0;i<99-1;i++) //鏈灏忓 { ...
绛旓細1 #include <iostream> 2 using namespace std;3 4 int sum(int* p)5 { 6 int i;7 int sum = 0; //鐢ㄤ簬瀛樺偍鏁扮粍涔嬪拰 8 for(i=0;i<100;i++) //绱姞鏁扮粍鐨勫 9 { 10 sum += *(p+i);11 } 12 return sum;13 } 14 15 int main()16 { 17 ...
绛旓細for(int i=0;i<100;++i){ scanf("%d",&a[i]);if(getchar()=='\n')break;} 杩欐牱浣犲氨鍙互鎶婅緭鍏ョ殑鏁版寜椤哄簭涓涓涓瓨鍒鏁扮粍閲岄潰浜,鍦ㄤ綘鎵撳叆鍥炶溅绗n鍚庡氨鎰忓懗鐫杈撳叆缁撴潫(浣犱篃鍙互鎶婂畠鏀规垚鍒殑),缁撴潫鍚巌+1鐨勫煎氨鏄浣犺緭鍏ョ殑涓暟浜 ...
