【卡雷尔杯】等差数列

import java.util.Arrays;
import java.util.Scanner;

//等差数列–1
public class Test01 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.print(“请输入N个整数的N值：”);
int N = sc.nextInt();
int[] arr = new int[N];
//遍历数组，用来存储N个值
for (int i = 0; i < arr.length; i++) {
System.out.print(“第” + (i + 1) + “个数的值为”);
arr[i] = sc.nextInt();
}
//给数组进行排序
Arrays.sort(arr);
int[] arrReduce = new int[N - 1]; //用来记录两相邻数之差
//取相邻两数的差值，记录到arrReduce数组中
for (int i = 0; i < arr.length; i++) {
if (arr.length - 1 <= i) {//防止索引越界异常
break;
}
arrReduce[i] = arr[i + 1] - arr[i];
}
//获取差值最小的那个数，即为等差数列的d
Arrays.sort(arrReduce);
int d = arrReduce[0]; //用来存储d
int minNum = arr[0]; //用来存储数组的最小值
int maxNum = arr[arr.length - 1]; //用来存储数组的最大值
int[] minArr = new int[(maxNum - minNum) / d + 1]; //等差数列最小的数组
for (int i = 0; i < minArr.length; i++) {
//对这个最小的等差数列数组进行赋值
minArr[i] = minNum + i * d;
}
//遍历打印这个最小的等差数列
for (int i = 0; i < minArr.length; i++) {
System.out.print(minArr[i] + " ");
}
}
}