From b25fe350de05698c04aa7fc7734bc90a58cd4afe Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?=E9=A9=AC=E5=AE=8F=E8=BE=BE?= <2657224306@qq.com> Date: Tue, 20 Dec 2022 20:01:53 +0800 Subject: [PATCH] 20221220 --- .../20221220.md" | 137 ++++++++++++++++++ 1 file changed, 137 insertions(+) create mode 100644 "48 \351\251\254\345\256\217\350\276\276/20221220.md" diff --git "a/48 \351\251\254\345\256\217\350\276\276/20221220.md" "b/48 \351\251\254\345\256\217\350\276\276/20221220.md" new file mode 100644 index 0000000..7387147 --- /dev/null +++ "b/48 \351\251\254\345\256\217\350\276\276/20221220.md" @@ -0,0 +1,137 @@ +# 作业一 + +```java +import java.util.Scanner; + +public class D3 { + //计算圆的面积,在主函数中接受圆的半径,在自定义函数中计算并输出。 + public static void main(String[] args) { + while (true){ + System.out.println(radius());} + } + public static double radius(){ + Scanner sc = new Scanner(System.in); + System.out.println("请输入半径:"); + double R = sc.nextDouble(); + double area = Math.PI * Math.pow(R, 2); + return area; + } +} + +``` + +# 作业二 + +```java +import java.util.Arrays; +import java.util.Random; +import java.util.Scanner; +//在主函数中产生20个0-10之间的随机数,将这20个随机数存入数组,并通过函数计算某个数在这些随机数中出现的次数(这“某个数”是在主函数中由用户输入的) +public class D1 { + public static void main(String[] args) { + Random r = new Random(); + int arr [] = new int [10]; + int count = 0; + for (int i = 0; i < arr.length; i++) { + int Unknown = r.nextInt(10); + arr[i] = Unknown; + } + System.out.println(Arrays.toString(arr)); + System.out.println("此时你可以输入这以上数组里的一个数,并查看他在数组里存在多少次:"); + Scanner sc = new Scanner(System.in); + int num = sc.nextInt(); + for (int i = 0; i < arr.length; i++) { + if (num == arr[i]){ + count+=1; + } + } + System.out.println("存在"+count+"次"); + } +} + +``` + +# 作业三 + +```java +import com.sun.org.apache.bcel.internal.generic.SWAP; + +import java.util.Arrays; +import java.util.Collections; +import java.util.Random; + +import static java.util.Collections.swap; + +public class D2 { +//在主函数中存入10个数组,在自定义函数中,将该数组最大值与第一个元素交换位置,最小值和最后一个交换位置,然后在主函数中输出交换后的数组 + public static void main(String[] args) { + int []arr=gennerateArray(10, 100); + System.out.println("这是改变之前的数组:"+Arrays.toString(arr)); + int max1 = arr[0]; + int min = arr[0]; + for (int i = 0; i < arr.length; i++) { + if(max1arr[i]){ + min = arr[i]; + } + } + for (int j = 0; j < arr.length; j++) { + if(arr[j]==max1){ + arr[j]=arr[0]; + } + } + for (int k = 0; k < arr.length; k++) { + if(arr[k] == min){ + arr[k]=arr[arr.length-1]; + } + } + arr[0] = max1; + arr[arr.length-1] = min; + System.out.println("这是改变之的数组:"+Arrays.toString(arr)); + + } + public static int[] gennerateArray(int len,int max){ + int[] arr=new int[len]; + for(int i=0;i