Exchange values of two arrays, make another array without repeats and sort from highest to lowest

Question

I know I have to do it with a while or do while loop, but I can't get it working. I also tried with a for loop, but it always gives me an error because I don't know the exact length of the vectors because they are random.

int a = (int)(Math.random() * 3 + 1);
int b = (int)(Math.random() * 3 + 1);
int c = a + b;
int[] arrA = new int[a];
int[] arrB = new int[b];
int[] arrC = new int[c];
for (int i = 0; i < a; i ++) {
    arrA[i] = (int)(Math.random() * 10 + 1);
    for (int j = 0; j < b; j ++) {
        arrB[j] = (int)(Math.random() * 10 + 1);
    }
}

Arrays.sort(arrA);
Arrays.sort(arrB);
System.out.println(Arrays.toString(arrA));
System.out.println(Arrays.toString(arrB));
System.out.println(Arrays.toString(arrC));

i know, cuz i dont know how, i tried with a for would compare A[x] with B[x] and if someone is lower it put it in arrC[x] but it doenst work — kuroky
– kuroky, Commented Jul 25, 2019 at 7:22

Prince Vegeta · Accepted Answer · 2019-07-30 12:00:36Z

1

Take values from arrays arrA and arrB, and insert to arrC

int index = arrA.length;
for (int i = 0; i < arrA.length; i++) {
    arrC[i] = arrA[i];
}
for (int i = 0; i < arrB.length; i++) {
    arrC[i + index] = arrB[i];    
}

Sort arrC

Arrays.sort(arrC);

Reverse the order and store in arrD

for(int l = 0; l < arrC.length; l++) {
    arrD[l] = arrC[arrC.length - (l+1)];
}

Remove duplicate (simplified)

Set<Integer> remove=new LinkedHashSet<Integer>();
for(int i = 0;i < arrD.length;i++){
    remove.add(arrD[i]);
}

Remove duplicate (usual)

int index2 = 0;
for (int i = 0; i < arrD.length; i++) {
    for (int k = 0; k < arrD.length; k++) {
        if (arrD[i] != arrD[k]) {
            arrE[index2] = arrD[i];
            index2++;
        }
    }
}

edited Jul 30, 2019 at 12:00

answered Jul 25, 2019 at 7:45

Prince Vegeta

7197 silver badges22 bronze badges

Sign up to request clarification or add additional context in comments.

4 Comments

Padmal Over a year ago

How about int[] arrC = ArrayUtils.addAll(arrA, arrB); instead the first block?

Prince Vegeta Over a year ago

@Blogger This doesn't work on Array, only on ArrayList.

kuroky Over a year ago

is there a way to remove the duplicate without that method? i didnt saw that in my class

Prince Vegeta Over a year ago

@kuroky You can compare each value with every other values in the array, but that will take a lot of time (writing code and performance).

Collectives™ on Stack Overflow

Exchange values of two arrays, make another array without repeats and sort from highest to lowest

1 Answer 1

4 Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

1 Answer 1

4 Comments

Your Answer

Sign up or log in

Post as a guest

Related