public class lianxi34 {
public static void main(String[] args) { Scanner s = new Scanner(System.in); System.out.println(\请输入3个整数:\ int a = s.nextInt(); int b = s.nextInt(); int c = s.nextInt(); if(a < b) { int t = a; a = b; b = t; }
if(a < c) { int t = a; a = c; c = t; }
if(b < c) { int t = b; b = c; c = t; }
System.out.println(\从大到小的顺序输出:\ System.out.println(a + \
} }
【程序35】
题目:输入数组,最大的与第一个元素交换,最小的与最后一个元素交换,输出数组。 import java.util.*; public class lianxi35 {
public static void main(String[] args) { int N = 8;
int[] a = new int [N];
Scanner s = new Scanner(System.in); int idx1 = 0, idx2 = 0;
System.out.println(\请输入8个整数:\ for(int i=0; i System.out.println(\你输入的数组为:\ for(int i=0; i int max =a[0], min = a[0]; for(int i=0; i } if(a[i] < min) { min = a[i]; idx2 = i; } } if(idx1 != 0) { int temp = a[0]; a[0] = a[idx1]; a[idx1] = temp; } if(idx2 != N-1) { int temp = a[N-1]; a[N-1] = a[idx2]; a[idx2] = temp; } System.out.println(\交换后的数组为:\ for(int i=0; i 【程序36】 题目:有n个整数,使其前面各数顺序向后移m个位置,最后m个数变成最前面的m个数 import java.util.Scanner; public class lianxi36 { public static void main(String[] args) { int N =10; int[] a = new int[N]; Scanner s = new Scanner(System.in); System.out.println(\请输入10个整数:\ for(int i=0; i System.out.print(\你输入的数组为:\ for(int i=0; i System.out.print(\请输入向后移动的位数:\ int m = s.nextInt(); int[] b = new int[m]; for(int i=0; i for(int i=N-1; i>=m; i--) { a[i] = a[i-m]; } for(int i=0; i a[i] = b[i]; } System.out.print(\位移后的数组是:\ for(int i=0; i 【程序37】 题目:有n个人围成一圈,顺序排号。从第一个人开始报数(从1到3报数),凡报到3的人退出圈子,问最后留下的是原来第几号的那位。 import java.util.Scanner; public class lianxi37 { public static void main(String[] args) { Scanner s = new Scanner(System.in); System.out.print(\请输入排成一圈的人数:\ int n = s.nextInt(); boolean[] arr = new boolean[n]; for(int i=0; i int leftCount = n; int countNum = 0; int index = 0;