From 93333c7c952974a385a3ae83bbc331d8acda3262 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?=E8=AE=B8=E6=81=A9=E6=B0=91?= <3256972080@qq.com> Date: Tue, 20 Dec 2022 07:59:35 +0800 Subject: [PATCH] =?UTF-8?q?=E7=AC=AC=E5=8D=81=E4=B8=80=E6=AC=A1=E4=BD=9C?= =?UTF-8?q?=E4=B8=9A?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- ...01\344\270\200\346\254\241\350\257\276.md" | 107 ++++++++++++++++++ 1 file changed, 107 insertions(+) create mode 100644 "30 \350\256\270\346\201\251\346\260\221/20221216java\347\254\254\345\215\201\344\270\200\346\254\241\350\257\276.md" diff --git "a/30 \350\256\270\346\201\251\346\260\221/20221216java\347\254\254\345\215\201\344\270\200\346\254\241\350\257\276.md" "b/30 \350\256\270\346\201\251\346\260\221/20221216java\347\254\254\345\215\201\344\270\200\346\254\241\350\257\276.md" new file mode 100644 index 0000000..dc33886 --- /dev/null +++ "b/30 \350\256\270\346\201\251\346\260\221/20221216java\347\254\254\345\215\201\344\270\200\346\254\241\350\257\276.md" @@ -0,0 +1,107 @@ +```java +import java.util.Scanner; +//.编写函数,计算圆的面积和周长,在主函数中接受圆的半径,在自定义函数中计算并输出 +public class D1 { + public static void main(String[] args) { + Scanner sc =new Scanner(System.in); + System.out.println("请输入 圆的半径"); + double radius= sc.nextDouble(); + System.out.println("圆的周长:"+ perimeter(radius)); + System.out.println("圆的面积:"+area(radius)); + } + public static double perimeter(double radius){ + return 2*3.1415926*radius; //计算圆的周长 + + } + public static double area(double radius){ + return 3.1415926*radius*radius;//计算圆的面积 + } +} +``` + +```java +import java.util.Arrays; +import java.util.Random; +import java.util.Scanner; + +//在主函数中产生20个0-10之间的随机数,将这20个随机数存入数组,并通过函数计算某个数在这些随机数中出现的次数(这“某个数”是在主函数中由用户输入的) +public class D2 { + public static void main(String[] args) { + Random ra = new Random(); + int num = ra.nextInt(10); + long[] numberm = new long[20]; + for(int i = 0; i < 20; i++) { + numberm[i]=num; + Scanner sc=new Scanner(System.in); + System.out.println("请输入某个数"); + long nums= sc.nextLong(); + + } + + } + public static void seach(long[] numberm,long nums){ + int count=0; + for (int i=0; i