【程序17】题目:输入数组,最大的与第一个元素交换,最小的与最后一个元素交换,输出数组。
public class Java17 {
public static void main(String[] args) {
int[] arr = { 49, 38, 65, 97, 76, 13, 27 };
System.out.print("初始序列:");
for (int i = 0; i < arr.length; i++) {
System.out.print(arr[i] + " ");
}
System.out.println();
solution(arr);
}
public static void solution(int[] arr) {
int max = 0;
int min = 0;
int temp = 0;
for (int i = 0; i < arr.length; i++) {
if (arr[i] > arr[max]) {
max = i;
}
if (arr[i] < arr[min]) {
min = i;
}
}
temp = arr[0];
arr[0] = arr[max];
arr[max] = temp;
temp = arr[arr.length - 1];
arr[arr.length - 1] = arr[min];
arr[min] = temp;
System.out.print("交换之后:");
for (int i = 0; i < arr.length; i++) {
System.out.print(arr[i] + " ");
}
}
}
输出结果
【程序18】题目:输入两个正整数m和n,求其最大公约数和最小公倍数。
import java.util.Scanner;
public class Java18 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("请依次输入两个整数:");
int m = sc.nextInt();
int n = sc.nextInt();
System.out.println(m+"和"+n+"的最大公约数是:"+gcd(m,n));
System.out.println(m+"和"+n+"的最小公倍数是:"+lcm(m,n));
}
public static int gcd(int m, int n) {
int temp = 0;
temp = m % n; // 求最大公约数的时候,采用了辗转相除法,也叫欧几里德算法。
return temp == 0 ? n : gcd(n, temp);
}
public static int lcm(int m, int n) {
// 两个数的最小公倍数等于两个数的积除以最大公约数
return (m * n / gcd(m, n));
}
}
输出结果
【程序19】题目:打印出如下图案(菱形)
*
***
******
********
******
***
*
import java.util.Scanner;
public class Java19 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("请输入要打印的层数:");
int layer = sc.nextInt();
System.out.println("菱形图案:");
solutionY(layer);
System.out.println("非菱形图案:");
solutionN(layer);
}
public static void solutionY(int layer) {
int mid = (layer - 1) / 2 + 1;
for (int i = 1; i <= mid; i++) {
for (int j = 1; j <= mid - i; j++) {
System.out.print(" ");
}
for (int j = 1; j <= 2 * i - 1; j++) {
System.out.print("*");
}
System.out.println("");
}
for (int i = (mid + 1); i <= layer; i++) {
for (int j = 1; j <= i - mid; j++) {
System.out.print(" ");
}
for (int j = 1; j <= 4 * mid - 2 * i - 1; j++) {
System.out.print("*");
}
System.out.println("");
}
}
/**
* 把solutionY方法中打印空格的for语句去除后和solutionN的效果是一样的。
* */
public static void solutionN(int layer) {
int mid = (layer - 1) / 2 + 1;
for (int i = 1; i <= mid; i++) {
for (int j = 1; j <= 2 * i - 1; j++) {
System.out.print("*");
}
System.out.println("");
}
for (int i = mid; i > 1; i--) {
for (int j = 1; j <= 2 * i - 3; j++) {
System.out.print("*");
}
System.out.println("");
}
}
}
输出结果