diff --git "a/26 \351\231\210\344\275\263\347\202\234/20221221 \344\275\263\347\202\234.md" "b/26 \351\231\210\344\275\263\347\202\234/20221221 \344\275\263\347\202\234.md" new file mode 100644 index 0000000000000000000000000000000000000000..dd7149e82c0931a62f7b25261a28ae2a0c640877 --- /dev/null +++ "b/26 \351\231\210\344\275\263\347\202\234/20221221 \344\275\263\347\202\234.md" @@ -0,0 +1,138 @@ +# 作业 + +```java +import java.util.Scanner; + +public class five { + public static void main(String[] args) { + System.out.println("请输入园的半径"); + Scanner sc = new Scanner(System.in); + int bj= sc.nextInt(); + radius(bj); + } + public static void radius(int bj){ + double mj = bj*bj*3.14; + double zc = bj*3.14*2; + System.out.println("园的面积为"+mj); + System.out.println("园的周长为"+zc); + } +} +``` + +```java +import java.util.Arrays; +import java.util.Random; +import java.util.Scanner; +public class six { + public static void main(String[] args) { + int[] n=new int[20]; + for (int i=0;i max) { + max = n[i]; + a = i; + } + } + int t = n[a]; + n[a] = n[0]; + n[0] = t; + for (int j = 0; j < 10; j++) { + if (n[j] < min) { + min = n[j]; + b = j; + } + } + int tt = n[b]; + n[b] = n[9]; + n[9] = tt; + return n; + } + } +``` + +```java +import java.util.Scanner; +public class eight { + public static void main(String[] args) { + System.out.println("输入数组元素个数"); + Scanner n=new Scanner(System.in); + int[] a=new int[n.nextInt()]; + System.out.println("请输入"+a.length+"个元素"); + for (int i=0;i