java学习Day2

for continue 求其0-20里离0.618最近的黄金分割率

package day3;

public class Huangjinfenge {
    public static void main(String[] args) {
        double minshu = 10;
        int fenzi=0 ;
        int fenmu=0 ;
        for (int i=1;i<=20;i++){
            for (int j=1;j<=20 ;j++){
                if (i%2==0 && j%2==0){
                    continue;
                }
                double huangjinshu = (double) i/(double) j;
                double data = Math.abs(huangjinshu-0.618);
                if (minshu > data){
                    minshu = data;
                    fenzi = i;
                    fenmu = j;
                }
            }
        }
        System.out.println("当前黄金分割率最接近的数为:"+(minshu+0.618)+"分子为："+fenzi+"分母为："+fenmu);
    }
}

求水仙花数

package day3;

public class Shuixianhua {
    public static void main(String[] args) {
        int i=100;
        System.out.println("水仙花数为:");
        while (i<1000){
            int a = i/100;
            int b = i/10%10;
            int c = i%10;
            if(Math.pow(a,3)+Math.pow(b,3)+Math.pow(c,3)==i){
                System.out.println(i);
            }
            i++;
        }
    }
}

求数组最小值

package day4;

import java.util.Random;

public class Shuzu {
    public static void main(String[] args) {
        int[] shuzu = new int[5];
        int min = 100;
        Random data = new Random();
        for(int i=0;i<shuzu.length;i++){
            shuzu[i] = data.nextInt(100);
            System.out.println("shuzu"+i+":   "+shuzu[i]);
        }
        for(int j = 0;j<shuzu.length;j++){
            if(min>shuzu[j]){
                min = shuzu[j];
            }
        }
        System.out.println("最小值min="+min);

    }
}

数组反转

package day4;

import java.util.Random;

public class Shuzufanzhuan {
    public static void main(String[] args) {
        Random data = new Random();
        int[] shuzu = new int [5];
        for(int i=0;i<shuzu.length;i++){
            shuzu[i] = data.nextInt(100);
        }
        for(int j=0;j<shuzu.length/2;j++){
            int a;
            a=shuzu[j];
            shuzu[j] = shuzu[shuzu.length-j-1];
            shuzu[shuzu.length-j-1] = a;
        }
        System.out.println("数组反转之后：");
        for(int k = 0;k<shuzu.length;k++){
            System.out.println("shuzu["+k+"]="+shuzu[k]);
        }
    }
}

Arrays 二维数组排序

package day5;

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

public class Paixushuzu2 {
    public static void main(String[] args) {
        Random data = new Random();
        int[][] shuzu = new int[4][8];
        for (int i=0;i<shuzu.length;i++) {
            for (int j = 0; j < shuzu[0].length; j++) {
                shuzu[i][j] = data.nextInt(100);
                System.out.print(shuzu[i][j] + " ");
            }
            System.out.println(" ");
        }
        int[] shuzu3 ;//= new int[shuzu.length];
        System.out.println("排序后");
        for (int i = 0;i<shuzu.length;i++){
            shuzu3 = Arrays.copyOfRange(shuzu[i],0,shuzu[i].length);
            Arrays.sort(shuzu3);
            shuzu[0] = Arrays.copyOfRange(shuzu3,0,shuzu3.length);
            System.out.println(Arrays.toString(shuzu[i]));
        }
    }
}

arraycopy数组赋值数组

package day5;

import java.util.Random;
import java.util.Scanner;

public class Sumshuzu {
    public static void main(String[] args) {
        Random data1 = new Random();
        Scanner data2 = new Scanner(System.in);
        System.out.println("请输入数据确认数组a的长度：");
        int n = data2.nextInt();
        System.out.println("请输入数据确认数组b的长度：");
        int m = data2.nextInt();
        int[] shuzua = new int[n];
        int[] shuzub = new int[m];
        int[] shuzuc = new int[n+m];
        //给数组赋随机数值并打印
        System.out.println("数组a");
        for (int j=0;j<shuzua.length;j++){
            shuzua[j] = data1.nextInt(5)+5;
            System.out.println(shuzua[j]);
        }
        System.out.println("数组b");
        for (int k = 0;k<shuzub.length;k++){
            shuzub[k] = data1.nextInt(5)+5;
            System.out.println(shuzub[k]);
        }
        System.arraycopy(shuzua,0,shuzuc,0,shuzua.length);
        System.arraycopy(shuzub,0,shuzuc,shuzua.length,shuzub.length);
        System.out.println("赋值过后");
        for (int i:shuzuc){
            System.out.println(i);
        }
    }
}

查找最大的那个数并打印下标

package day5;

import java.util.Random;

public class shuzu {
    public static void main(String[] args) {
        Random data = new Random();
        int[][] tooshuzu = new int[5][5];
        int a = tooshuzu[0][0];
        int x = 0;
        int y = 0;
        for (int i = 0; i < tooshuzu.length; i++) {
            for (int j = 0; j < tooshuzu[0].length; j++) {
                tooshuzu[i][j] = data.nextInt(100);
                System.out.print(tooshuzu[i][j] + " ");
                if (a < tooshuzu[i][j]) {
                    a = tooshuzu[i][j];
                    x = i;
                    y = j;
                }
            }
            System.out.println(" ");
        }
        System.out.println("最大的那个值为：" + a + "坐标为：" + x + " " + y);
    }
}