diff --git "a/12 \346\236\227\344\277\212\344\274\237/20221220 \347\254\254\345\215\201\344\270\200\346\254\241\344\275\234\344\270\232.md" "b/12 \346\236\227\344\277\212\344\274\237/20221220 \347\254\254\345\215\201\344\270\200\346\254\241\344\275\234\344\270\232.md" new file mode 100644 index 0000000000000000000000000000000000000000..dd050b2bb2c6c6b2afaeae0a1845c22cfabbd928 --- /dev/null +++ "b/12 \346\236\227\344\277\212\344\274\237/20221220 \347\254\254\345\215\201\344\270\200\346\254\241\344\275\234\344\270\232.md" @@ -0,0 +1,124 @@ +~~~ java +import java.util.Scanner; +//2.编写函数,计算圆的面积和周长,在主函数中接受圆的半径,在自定义函数中计算并输出// +public class zy11 { + public static void main(String[] args) { + Scanner sc = new Scanner(System.in); + System.out.println("请输入半径:"); + int bj = sc.nextInt(); + System.out.println("圆的周长是:"+zc(bj)); + System.out.println("圆的面积是:"+mj(bj)); + } + public static double zc(int bj){ + //周长公式 2Πr// + return 2 * 3.1415926 * bj; + } + public static double mj(int bj){ + //面积公式 Π*r2 + return 3.1415926 * bj * bj; + } +} +~~~ + +~~~ java +import java.util.Arrays; +import java.util.Random; +import java.util.Scanner; +//在主函数中产生20个0-10之间的随机数,将这20个随机数存入数组,并通过函数计算某个数在这些随机数中出现的次数(这“某个数”是在主函数中由用户输入的) +public class zyd { + 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 zydd { +//在主函数中存入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