From 9a5def815f2cb91adbb84f09391dbaa42cd8514e Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?=E9=99=88=E4=BF=8A=E5=93=B2?= <2361967167@qq.com> Date: Mon, 19 Dec 2022 22:09:13 +0800 Subject: [PATCH] =?UTF-8?q?=E4=BD=9C=E4=B8=9A?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- .../20221219 \344\275\234\344\270\232.md" | 191 ++++++++++++++++++ .../\344\275\234\344\270\232.md" | 49 ----- 2 files changed, 191 insertions(+), 49 deletions(-) create mode 100644 "24 \351\231\210\344\277\212\345\223\262/20221219 \344\275\234\344\270\232.md" delete mode 100644 "24 \351\231\210\344\277\212\345\223\262/\344\275\234\344\270\232.md" diff --git "a/24 \351\231\210\344\277\212\345\223\262/20221219 \344\275\234\344\270\232.md" "b/24 \351\231\210\344\277\212\345\223\262/20221219 \344\275\234\344\270\232.md" new file mode 100644 index 0000000..44f7710 --- /dev/null +++ "b/24 \351\231\210\344\277\212\345\223\262/20221219 \344\275\234\344\270\232.md" @@ -0,0 +1,191 @@ +~~~java +package text.homework; + +import java.util.Scanner; + +public class zy05 { + public static void main(String[] args) { + //题目：编写函数，计算圆的面积和周长，在主函数中接受圆的半径，在自定义函数中计算并输出 + + //在主函数中接受圆的半径，在自定义函数中计算并输出 + Scanner sc = new Scanner(System.in); + System.out.println("请输入所求圆的半径"); + double r = sc.nextDouble(); + System.out.println("圆的面积为" + method01(r)); + System.out.println("圆的周长为" + method02(r)); + + } + //编写函数，计算圆的面积和周长 + public static double method01(double r){ + return r * r * 3.14; + } + + public static double method02(double r){ + return 2 * 3.14* r; + } +} +~~~ + +~~~java +package text.homework; + +import java.util.Random; +import java.util.Scanner; + +public class zy06 { + public static void main(String[] args) { + //在主函数中产生20个0-10之间的随机数，将这20个随机数存入数组 + Random r = new Random(); + int[] arr = new int[20]; + for (int i = 0; i < 20; i++) { + arr[i] = r.nextInt(11); + } + + // 并通过函数计算某个数在这些随机数中出现的次数（这“某个数”是在主函数中由用户输入的） + Scanner sc = new Scanner(System.in); + System.out.println("请输入0~10中的一个数"); + int number = sc.nextInt(); + int count = 0; + + //展示数组中的数（验证） + for (int i = 0; i < arr.length; i++) { + System.out.println(arr[i]); + } + + //计算某个数在这些随机数中出现的次数 + for (int i = 0; i < arr.length; i++) { + if(number == arr[i]){ + count++; + } + } + System.out.println("该数在这些随机数中出现了" + count + "次"); + } +} +~~~ + +~~~java +package text.homework; + +import java.util.Scanner; + +public class zy07 { + public static void main(String[] args) { + //在主函数中接收10个数存入数组， + int[] arr = new int[10]; + Scanner sc = new Scanner(System.in); + for (int i = 0; i < arr.length; i++) { + System.out.println("请输入第" + (i+1) + "个数"); + arr[i] = sc.nextInt(); + } + //在自定义函数中，将该数组中的最大值与第一个元素交换，最小值与最后一个元素交换，然后在主函数中输出交换后的数组 + Exchange(arr); + } + + //最大值 + public static int methodMax(int[] arr){ + int max = arr[0]; + int index = 0; + for (int i = 1; i < arr.length; i++) { + if (max < arr[i]){ + index = i; + } + } + return index; + } + //最小值 + public static int methodMin(int[] arr){ + int min = arr[0]; + int index = 0; + for (int i = 1; i < arr.length; i++) { + if (min > arr[i]){ + index = i; + } + } + return index; + } + //交换数组 + public static void Exchange(int[] arr){ + int temp = arr[0]; + arr[0] = arr[methodMax(arr)]; + arr[methodMax(arr)] = temp; + temp = arr[9]; + arr[9] = arr[methodMin(arr)]; + arr[methodMin(arr)] = temp; + + for (int i = 0; i < arr.length; i++) { + System.out.println(arr[i]); + } + } +} + +~~~ + +~~~java +package text.homework; + +import java.util.Scanner; + +public class zy08 { + public static void main(String[] args) { + //用自定义函数是实现求某数组元素的和（大小不固定） + Scanner sc = new Scanner(System.in); + System.out.println("请输入数组的大小"); + int len = sc.nextInt(); + //定义数组 + int[] arr = new int[len]; + + //存数据 + System.out.println("请输入数存入数组"); + for (int i = 0; i < arr.length; i++) { + System.out.println("请输入第" + (i+1) + "个数"); + arr[i] = sc.nextInt(); + } + + System.out.println("该数组的和为" + number(arr)); + } + + //求和方法 + public static int number(int[] arr){ + int sum = arr[0]; + for (int i = 1; i < arr.length; i++) { + sum += arr[i]; + } + return sum; + } +} +~~~ + +~~~java +package text.homework; + +import java.util.Scanner; + +public class zy09 { + public static void main(String[] args) { + //用户输入整数n，计算1!+(1!+2!)+(1!+2!+3!)+…..+(1!+2!+…n!) + System.out.println("请输入整数"); + int num = new Scanner(System.in).nextInt(); + int[] arr = new int[num+1]; + int result = 0; + for (int i = 1; i <= num; i++) { + result += method(i); + arr[i] = result; + } + int sum = arr[0]; + for (int i = 1; i < arr.length; i++) { + sum += arr[i]; + } + System.out.println("结果为" + sum); + } + + //阶乘 + public static int method(int num){ + int number = 1; + for (int i = 1; i <= num; i++) { + number *= i; + } + return number; + } +} +~~~ + diff --git "a/24 \351\231\210\344\277\212\345\223\262/\344\275\234\344\270\232.md" "b/24 \351\231\210\344\277\212\345\223\262/\344\275\234\344\270\232.md" deleted file mode 100644 index 83a455c..0000000 --- "a/24 \351\231\210\344\277\212\345\223\262/\344\275\234\344\270\232.md" +++ /dev/null @@ -1,49 +0,0 @@ -~~~java -package text.homework; - -import java.util.Scanner; - -public class zy03 { - public static void main(String[] args) { - //定义一函数，用于求2个数中的较大数，并将其返回，这2个数字在主函数中由用户输入 - Scanner sc = new Scanner(System.in); - System.out.println("请输入第一个数："); - int num01 = sc.nextInt(); - System.out.println("请输入第二个数："); - int num02 = sc.nextInt(); - System.out.println("较大的数是："+MaxNum(num01,num02)); - - } - public static int MaxNum(int num01,int num02) { - return num01 >num02? num01 : num02; - } -} -~~~ - -~~~java -package text.homework; - -import java.util.Scanner; - -public class zy04 { - public static void main(String[] args) { - //在主函数中从键盘接收X, Y , Z3个数，编写函数计算这3个数的立方和并返回计算结果：S=X3+Y3+Z3 - Scanner s = new Scanner(System.in); - System.out.println("请输入第一个数："); - int x = s.nextInt(); - System.out.println("请输入第二个数："); - int y = s.nextInt(); - System.out.println("请输入第三个数："); - int z = s.nextInt(); - System.out.println(h(x,y,z)+"="+sum(x)+"+"+sum(y)+"+"+sum(z)); - } - public static int sum(int a) { - return a*a*a; - } - - public static int h(int a , int b, int c) { - return (a*a*a) + (b*b*b) + (c*c*c); - } -} -~~~ - -- Gitee