package husf; import java.util.Scanner; public class dsczy { public static void main(String[] args) { // TODO Auto-generated method stub Scanner sc = new Scanner(System.in); int sum=0; int[] arr = new int[10]; for(int i =0;i<arr.length;i++) { System.out.println("请输入第"+(i+1)+"个分"); arr[i] = sc.nextInt(); sum+=arr[i]; } int max = arr[0]; for(int i =1;i<arr.length;i++) { if(arr[i]>max) { max = arr[i]; } } int min = arr[0]; for(int i =1;i<arr.length;i++) { if(arr[i]<min) { min = arr[i]; } } float total = (sum-max-min)/8; System.out.println("平均分为"+total); } }
package husf; import java.util.Random; public class dsczy { public static void main(String[] args) { // TODO Auto-generated method stub int[] arr = new int[10]; Random random = new Random(); for(int i =0;i<arr.length;i++) { arr[i] = random.nextInt(100)-1; } for(int i=0;i<arr.length-1;i++) { for(int j=0;j<arr.length-1-i;j++) { if(arr[j]>arr[j+1]) { int temp=arr[j]; arr[j]=arr[j+1]; arr[j+1]=temp; } } }System.out.println("从小到大排序后的结果是:"); for(int i=0;i<arr.length;i++) System.out.print(arr[i]+" "); } }
package husf; import java.util.Random; public class dsczy { public static void main(String[] args) { // TODO Auto-generated method stub Random random = new Random(); int a=0; int[] arr = new int[7]; arr[0] = random.nextInt(35); for(int i=1;i<arr.length;i++) { arr[i] = random.nextInt(35); if(arr[i]==arr[i-1]) { a=1; i--; continue; } } System.out.println("七个数:"); for(int i =0;i<arr.length;i++) { System.out.print(arr[i]+" "); } } }
package husf; import java.util.Random; public class dsczy { public static void main(String[] args) { // TODO Auto-generated method stub int[] arr= new int[10]; int ji=0; int ou=0; Random random = new Random(); for(int i =0;i<arr.length;i++) { arr[i] = random.nextInt(50)+1; System.out.print(" "+arr[i]); }System.out.println(); int max = arr[0]; for(int i =1;i<arr.length;i++) { if(arr[i]>max) { max = arr[i]; } } int min = arr[0]; for(int i =1;i<arr.length;i++) { if(arr[i]<min) { min = arr[i]; } } for(int i =0;i<arr.length;i++) { if(arr[i]%2==0) { ou+=1; }if(arr[i]%2!=0) { ji+=1; } } System.out.println(" 最大值 "+max+" 最小值 "+min+" 奇数个数 "+ji+" 偶数个数 "+ou); } }