Java第八次作业

1.

package mld;

public class Mld1 {

    /**
     * @param args
     */
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        int[] a = { 10, 20, 30, 40, 50 };
        for (int i = 0; i < a.length; i++) {
            System.out.println(a[i]);
        }

    }
}

 

 

2.

package mld;

public class Mld1 {

    /**
     * @param args
     */
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        char[] a = { 'n', 'e', 'u', 's', 'o', 'f', 't' };
        char[] b = new char[a.length];
        System.arraycopy(a, 0, b, 0, a.length);
        for (char i : b) {
            System.out.println(i);
        }

    }
}

 

 

3.

(1)Arrays.sort排序

package mld;

import java.util.Arrays;

public class Mld1 {

    /**
     * @param args
     */
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        int[] a = { 1, 6, 2, 3, 9, 4, 5, 7, 8 };
        Arrays.sort(a);
        for (int i : a) {
            System.out.println(i);
        }

    }
}

 

 (2)冒泡排序

package mld;

import java.util.Arrays;

public class Mld1 {

    /**
     * @param args
     */
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        int[] a = { 1, 6, 2, 3, 9, 4, 5, 7, 8 };
        for (int i = 0; i < a.length; i++) {
              for (int j = 0; j < a.length-1-i; j++) {
                  if(a[j]>a[j+1]){
                      int b=a[j];
                      a[j]=a[j+1];
                      a[j+1]=b;
                  }
                
            }
            
        }
          for(int i:a){
              System.out.println(i);
          }
         
        }

    }

 

 4.

package mld;

public class Mld2 {

    /**
     * @param args
     */
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        double a[][] = new double[5][4];
        for (int i = 0; i < a.length; i++) {
            for (int j = 0; j < a[i].length; j++) {
                a[i][j] = i;
            }
        }
        for (int i = 0; i < a.length; i++) {
            for (int j = 0; j < a[i].length; j++) {
                System.out.print(a[i][j]+" ");
            }
            System.out.println();
        }
    }


}

 

 

5.

package mld;

public class Mld2 {

    /**
     * @param args
     */
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        int a[]={18,25,7,36,13,2,89,63};
          int max=a[0];
          int subscript=0;
          for (int i = 1; i < a.length; i++) {
              if(a[i]>max){
                  max=a[i];
                  subscript=i;
              }
            
        }
          System.out.println("最大值"+max);
          System.out.println("下标"+subscript);
        }

    }

 

 

6.

package mld;

import java.util.Scanner;

public class Mld {

    /**
     * @param args
     */
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        Scanner input = new Scanner(System.in);
        System.out.println("请输入数组中元素个数:");
        int y = input.nextInt();
        int b[] = new int[y];
        System.out.println("请输入数组元素:");
        for (int i = 0; i < y; i++) {
            b[i] = input.nextInt();

        }
        System.out.println("逆序存放:");
        for (int j = y - 1; j > 0; j--) {
            System.out.println(b[j]);
        }
        System.out.println(b[0]);
    }

}

 

 

7.

package mld;

import java.util.Scanner;

public class Mld {

    /**
     * @param args
     */
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        Scanner input = new Scanner(System.in);
        System.out.println("请输入数组中元素个数:");
        int y = input.nextInt();
        int b[] = new int[y];
        System.out.println("请输入数组:");
        for (int i = 0; i < y; i++) {
            b[i] = input.nextInt();

        }
        System.out.println("整理后:");
        for (int n = 0; n < b.length; n++) {
            for (int j = n + 1; j < b.length; j++) {
                if (b[n] == b[j]) {
                    b[j] = 0;
                }

            }
            System.out.println(b[n]);

        }
    }

}

 

 

8.

package mld;

import java.util.Arrays;
import java.util.Scanner;

public class Mld {

    /**
     * @param args
     */
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        int[] a = { -10, 2, 3, 246, -100, 0, 5 };
        Arrays.sort(a);
        System.out.println("最大值" + a[a.length - 1]);
        System.out.println("最小值" + a[0]);
        double sum = 0.0;
        for (int j = 0; j < a.length; j++) {
            sum += a[j];

        }
        System.out.println("数组的平均值是" + sum / a.length);
    }

}

 

 

9.

package mld;

public class Mld2 {

    /**
     * @param args
     */
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        int a[] = new int[20];
        a[0] = 1;
        a[1] = 1;
        for (int i = 2; i < a.length; i++) {
            a[i] = a[i - 1] + a[i - 2];
        }
        for (int i = 0; i < 8; i++) {
            System.out.println(a[i]);
        }
    }

}

 

 

10.

package mld;

import java.util.Arrays;
import java.util.Random;

public class Mld2 {

    /**
     * @param args
     */
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        int a[] = new int[10];
        Random x = new Random();

        System.out.println("生成10个100以内的随机数");
        for (int i = 0; i < a.length; i++) {
            a[i] = x.nextInt(101);
        }
        for (int i = 0; i < a.length; i++) {
            System.out.println(a[i]);
        }
        System.out.println("排序后                          ");
        Arrays.sort(a);
        for (int i = 0; i < a.length; i++) {
            System.out.println(a[i]);
        }

    }
}