biu~~~

导航

统计
 

1.编写一个简单程序,要求数组长度为5,静态赋值10,20,30,40,50,在控制台输出该数组的值。

import java.util.*;
public class C {
    public static void main(String[] args) {
          // TODO Auto-generated method stub
        Scanner input=new Scanner(System.in);
        int[] arr=new int[]{10,20,30,40,50};
        for(int i=0;i<arr.length;i++){
        System.out.print(arr[i]+" ");
        }
        }
    }

2.编写一个简单程序,要求数组长度为5,动态赋值10,20,30,40,50,在控制台输出该数组的值。

import java.util.*;
public class C {
    public static void main(String[] args) {
          // TODO Auto-generated method stub
        int ass [] = new int [5];
        Scanner sc = new Scanner(System.in);
        for(int a=0;a<ass.length;a++){
            System.out.println("输入数字");
            ass[a] = sc.nextInt();
        }
        System.out.println("赋值结束");
    }
}

3.编写一个简单程序,定义整型数组,里面的元素是{23,45,22,33,56},求数组元素的和、平均值

import java.util.*;
public class C {
    public static void main(String[] args) {
          // TODO Auto-generated method stub
        Scanner sc = new Scanner(System.in);
        int a[]= {23,45,22,33,56};
        double sum=0;
        for(int i=0;i<a.length;i++) {
            sum+=a[i];
        }
        System.out.println("和为:"+sum+"平均值为:"+sum/5);
    }
}

4.在一个有8个整数(18,25,7,36,13,2,89,63)的数组中找出其中最大的数及其下标。

public class C {
    public static void main(String[] args) {
          // TODO Auto-generated method stub
        int[] aa = {18,25,7,36,13,2,89,63};
        int[] bb = new int[aa.length];  
        System.arraycopy(aa, 0, bb, 0, aa.length);  
        
        for(int y=0; y<bb.length-1; y++) {
            if(bb[y]>bb[y+1]) {
                int temp = bb[y];
                bb[y] = bb[y+1];
                bb[y+1] = temp;
            }
        }
        for(int element : bb) {
            System.out.print(element+" ");
        }
        System.out.println("-------");
        System.out.println("这个数组最大的数是:"+ bb[bb.length-1]);
        int xiabiao = 0;
        
        for(int i=0; i<aa.length; i++) {  
            if(aa[i]==bb[bb.length-1]) {
                xiabiao = i;
            }
        }
        System.out.println("下标为:"+xiabiao);
    }
}

 5. 将一个数组中的元素逆序存放(知识点:数组遍历、数组元素访问)

public class C {
    public static void main(String[] args) {
          // TODO Auto-generated method stub
        int [] a = new int [] {4,1,3,5,9,2,1};
        int b;
        for(int i = 0; i < a.length / 2; i ++) {
            b = a[i];
            a[i] = a[a.length - 1 - i];
            a[a.length - 1 - i] = b;
        }
        for(int i = 0; i < a.length; i ++) {
            System.out.print(a[i] + ",");
        }
    }
    }

 

posted on 2020-04-09 11:08  biu~~~  阅读(...)  评论(...编辑  收藏