我有一项作业,要求我创建两个数组(具有用户定义的长度),这些数组充满1-100之间的随机数,然后将两个数组合并而没有重复的交替顺序。我只需要帮助将两者合并而无需重复数字。有人可以帮忙吗?谢谢!
import java.util.Scanner;
import java.lang.Math;
class Main {
public static void main(String[] args){
Scanner scan = new Scanner (System.in);
int f=0;
int j=0;
int k=0;
//getting first array length and making array1 and array2 that length
while (f==0){
System.out.println("Enter an array length (must be 10 or greater):");
int length = scan.nextInt();
if (length < 10){
f=0;
}
else{
f=1;
}
if (f==1){
int [] array1 = new int[length];
int [] array2 = new int[length];
int [] array3 = new int[length*2];
System.out.print("First Array: ");
//creating random integers between 1 and 100 inclusive to fill array1
for (int i=0; i<=length-1; i++){
int x = (int)(Math.random()*100)+1;
array1[i] = x;
System.out.print(x+" ");
}
//creating random integers between 1 and 100 inclusive to fill array2
System.out.print("\nSecond Array: ");
for (int i=0; i<=length-1; i++){
int y = (int)(Math.random()*100)+1;
System.out.print(y+" ");
array2[i] = y;
}
//combining both arrays
System.out.print("\nMerged Array: ");
for (int i=0; i<=length*2-1; i++){
if ((i==0) || (i%2==0)){
array3[i] = array1[j];
j++;
}
else{
array3[i] = array2[k];
k++;
}
System.out.print(array3[i]+" ");
}
}
}
}
}
首先,让我们提取方法来填充数组。
static int[] fillRandomArray(int n) {
int[] arr = new int[n];
for (int i = 0; i < n; i++) {
arr[i] = (int) (Math.random() * 100) + 1;
System.out.print(arr[i] + " ");
}
System.out.println();
return arr;
}
现在您可以简化代码以使用该方法,并且合并非常接近;在每种情况下,您都不需要按j
的一半索引(偶数或奇数),就不需要k
或i
。喜欢,
Scanner scan = new Scanner(System.in);
while (true) {
System.out.println("Enter an array length (must be 10 or greater):");
int length = scan.nextInt();
if (length >= 10) {
System.out.print("First Array: ");
// creating random integers between 1 and 100 inclusive to fill array1
int[] array1 = fillRandomArray(length);
// creating random integers between 1 and 100 inclusive to fill array2
System.out.print("\nSecond Array: ");
int[] array2 = fillRandomArray(length);
// combining both arrays
System.out.print("\nMerged Array: ");
int[] array3 = new int[array1.length + array2.length];
for (int i = 0; i < array3.length; i++) {
if (i % 2 == 0) {
array3[i] = array1[i / 2];
} else {
array3[i] = array2[i / 2];
}
System.out.print(array3[i] + " ");
}
System.out.println();
}
}
如果合并时实际上需要消除array1和array2之间的重复项,则不能假设输出数组将是输入长度的两倍。我将使用Set
。喜欢,
// combining both arrays
System.out.print("\nMerged Array: ");
Set<Integer> set = new LinkedHashSet<>();
for (int i = 0; i < array1.length + array2.length; i++) {
if (i % 2 == 0) {
if (set.add(array1[i / 2])) {
System.out.print(array1[i / 2] + " ");
}
} else {
if (set.add(array2[i / 2])) {
System.out.print(array2[i] + " ");
}
}
}
// If you actually need an int[]
int[] array3 = set.stream().mapToInt(Integer::intValue).toArray();