**Java Language only** **Please let it be copy pastable to netbeans** I will thu
ID: 3741807 • Letter: #
Question
**Java Language only**
**Please let it be copy pastable to netbeans**
I will thumbs up good work thank you!!
Write a java code that has 6 sections too it each section will hold int arrays that will show the first, second and third relevant single array numbers in each section. The Output should show all 6 numbers in order from relevant array numbers, too second relevant array numbers, to third realvent array numbers for all 6 sections.
EX: Array=[9],[3],[3],[4],[3],[4],[3],[4],[58],[8],[9]
EX: Array=[21],[21],[25],[25],[25],[2],[25],[2],[2],[]
EX: Array=[60],[60],[15],[5],[5],[5],[5],[60],[8],[8]
EX: Array=[90],[4],[90],[4],[25],[25],[4],[25],[4],[]
EX: Array=[50],[50],[50],[60],[60],[60],[60],[12],[12]
EX: Array=[20],[20],[5],[3],[8],[8],[8],[8],[5],[5]
OutPut Example:
First relevant number:Output:3,25,5,4,60,8
Second relevant number:Output:4,2,60,25,50,5
Third relevant number:9,21,8,90,12,20
Explanation / Answer
import java.util.Arrays;
import java.util.Comparator;
import java.util.Collections;
public class CountOccurenceOfNumbers {
public static int getOccurence(int Array1[], Integer [][] Occurence)
{
int i,k = 0,temp = 0;
int [] count = new int[100];
for(i = 0; i < Array1.length; i++){
temp = Array1[i];
count[temp]++;
}//end of for looop
for(i=1; i < count.length; i++)
{
if(count[i] > 0 && count[i] == 1){
Occurence[k][0] = i ;
Occurence[k][1] = count[i];
k++;
}
else if(count[i] >= 2){
Occurence[k][0] = i ;
Occurence[k][1] = count[i];
k++;
}
}//end of for loop
return k;
}
public static void main(String[] args) {
//Scanner input = new Scanner(System.in);
int [] num = new int[20];
Integer [][] Occurence1 = new Integer[5][2];
Integer [][] Occurence2 = new Integer[3][2];
Integer [][] Occurence3 = new Integer[4][2];
Integer [][] Occurence4 = new Integer[3][2];
Integer [][] Occurence5 = new Integer[3][2];
Integer [][] Occurence6 = new Integer[4][2];
int i, k = 0;
int Array1[] = {9,3,3,4,3,4,3,4,58,8,9};
int Array2[] = {21,21,25,25,25,2,25,2,2};
int Array3[] ={60,60,15,5,5,5,5,60,8,8};
int Array4[] = {90,4,90,4,25,25,4,25,4};
int Array5[] ={50,50,50,60,60,60,60,12,12};
int Array6[] ={20,20,5,3,8,8,8,8,5,5};
k = getOccurence(Array1, Occurence1);
k = getOccurence(Array2, Occurence2);
k = getOccurence(Array3, Occurence3);
k = getOccurence(Array4, Occurence4);
k = getOccurence(Array5, Occurence5);
k = getOccurence(Array6, Occurence6);
Arrays.sort(Occurence1, new Comparator<Integer[]>() {
@Override
public int compare(Integer[] o1, Integer[] o2) {
Integer quantityOne = o1[1];
Integer quantityTwo = o2[1];
// reverse sort on quantity
return quantityOne.compareTo(quantityTwo);
}
});
Arrays.sort(Occurence2, new Comparator<Integer[]>() {
@Override
public int compare(Integer[] o1, Integer[] o2) {
Integer quantityOne = o1[1];
Integer quantityTwo = o2[1];
// reverse sort on quantity
return quantityOne.compareTo(quantityTwo);
}
});
Arrays.sort(Occurence3, new Comparator<Integer[]>() {
@Override
public int compare(Integer[] o1, Integer[] o2) {
Integer quantityOne = o1[1];
Integer quantityTwo = o2[1];
// reverse sort on quantity
return quantityOne.compareTo(quantityTwo);
}
});
Arrays.sort(Occurence4, new Comparator<Integer[]>() {
@Override
public int compare(Integer[] o1, Integer[] o2) {
Integer quantityOne = o1[1];
Integer quantityTwo = o2[1];
// reverse sort on quantity
return quantityOne.compareTo(quantityTwo);
}
});
Arrays.sort(Occurence5, new Comparator<Integer[]>() {
@Override
public int compare(Integer[] o1, Integer[] o2) {
Integer quantityOne = o1[1];
Integer quantityTwo = o2[1];
// reverse sort on quantity
return quantityOne.compareTo(quantityTwo);
}
});
Arrays.sort(Occurence6, new Comparator<Integer[]>() {
@Override
public int compare(Integer[] o1, Integer[] o2) {
Integer quantityOne = o1[1];
Integer quantityTwo = o2[1];
// reverse sort on quantity
return quantityOne.compareTo(quantityTwo);
}
});
//Collections.reverse(Occurence6);
/*for(i =0 ;i<4;i++)
{
System.out.printf("%d occur %d time ", Occurence6[i][0], Occurence6[i][1]);
}*/
for(i=1; i <= 3; i++)
{
System.out.printf("%d, %d, %d, %d, %d, %d ",Occurence1[Occurence1.length-i][0], Occurence2[Occurence2.length-i][0], Occurence3[Occurence3.length-i][0] ,
Occurence4[Occurence4.length-i][0], Occurence5[Occurence5.length-i][0], Occurence6[Occurence6.length-i][0]);
}//end of for loop*/
}//end of main
}//end of CountOccurrenceOfNumbers
import java.util.Arrays;
import java.util.Comparator;
import java.util.Collections;
public class CountOccurenceOfNumbers {
public static int getOccurence(int Array1[], Integer [][] Occurence)
{
int i,k = 0,temp = 0;
int [] count = new int[100];
for(i = 0; i < Array1.length; i++){
temp = Array1[i];
count[temp]++;
}//end of for looop
for(i=1; i < count.length; i++)
{
if(count[i] > 0 && count[i] == 1){
Occurence[k][0] = i ;
Occurence[k][1] = count[i];
k++;
}
else if(count[i] >= 2){
Occurence[k][0] = i ;
Occurence[k][1] = count[i];
k++;
}
}//end of for loop
return k;
}
public static void main(String[] args) {
//Scanner input = new Scanner(System.in);
int [] num = new int[20];
Integer [][] Occurence1 = new Integer[5][2];
Integer [][] Occurence2 = new Integer[3][2];
Integer [][] Occurence3 = new Integer[4][2];
Integer [][] Occurence4 = new Integer[3][2];
Integer [][] Occurence5 = new Integer[3][2];
Integer [][] Occurence6 = new Integer[4][2];
int i, k = 0;
int Array1[] = {9,3,3,4,3,4,3,4,58,8,9};
int Array2[] = {21,21,25,25,25,2,25,2,2};
int Array3[] ={60,60,15,5,5,5,5,60,8,8};
int Array4[] = {90,4,90,4,25,25,4,25,4};
int Array5[] ={50,50,50,60,60,60,60,12,12};
int Array6[] ={20,20,5,3,8,8,8,8,5,5};
k = getOccurence(Array1, Occurence1);
k = getOccurence(Array2, Occurence2);
k = getOccurence(Array3, Occurence3);
k = getOccurence(Array4, Occurence4);
k = getOccurence(Array5, Occurence5);
k = getOccurence(Array6, Occurence6);
Arrays.sort(Occurence1, new Comparator<Integer[]>() {
@Override
public int compare(Integer[] o1, Integer[] o2) {
Integer quantityOne = o1[1];
Integer quantityTwo = o2[1];
// reverse sort on quantity
return quantityOne.compareTo(quantityTwo);
}
});
Arrays.sort(Occurence2, new Comparator<Integer[]>() {
@Override
public int compare(Integer[] o1, Integer[] o2) {
Integer quantityOne = o1[1];
Integer quantityTwo = o2[1];
// reverse sort on quantity
return quantityOne.compareTo(quantityTwo);
}
});
Arrays.sort(Occurence3, new Comparator<Integer[]>() {
@Override
public int compare(Integer[] o1, Integer[] o2) {
Integer quantityOne = o1[1];
Integer quantityTwo = o2[1];
// reverse sort on quantity
return quantityOne.compareTo(quantityTwo);
}
});
Arrays.sort(Occurence4, new Comparator<Integer[]>() {
@Override
public int compare(Integer[] o1, Integer[] o2) {
Integer quantityOne = o1[1];
Integer quantityTwo = o2[1];
// reverse sort on quantity
return quantityOne.compareTo(quantityTwo);
}
});
Arrays.sort(Occurence5, new Comparator<Integer[]>() {
@Override
public int compare(Integer[] o1, Integer[] o2) {
Integer quantityOne = o1[1];
Integer quantityTwo = o2[1];
// reverse sort on quantity
return quantityOne.compareTo(quantityTwo);
}
});
Arrays.sort(Occurence6, new Comparator<Integer[]>() {
@Override
public int compare(Integer[] o1, Integer[] o2) {
Integer quantityOne = o1[1];
Integer quantityTwo = o2[1];
// reverse sort on quantity
return quantityOne.compareTo(quantityTwo);
}
});
//Collections.reverse(Occurence6);
/*for(i =0 ;i<4;i++)
{
System.out.printf("%d occur %d time ", Occurence6[i][0], Occurence6[i][1]);
}*/
for(i=1; i <= 3; i++)
{
System.out.printf("%d, %d, %d, %d, %d, %d ",Occurence1[Occurence1.length-i][0], Occurence2[Occurence2.length-i][0], Occurence3[Occurence3.length-i][0] ,
Occurence4[Occurence4.length-i][0], Occurence5[Occurence5.length-i][0], Occurence6[Occurence6.length-i][0]);
}//end of for loop*/
}//end of main
import java.util.Arrays;
import java.util.Comparator;
import java.util.Collections;
public class CountOccurenceOfNumbers {
public static int getOccurence(int Array1[], Integer [][] Occurence)
{
int i,k = 0,temp = 0;
int [] count = new int[100];
for(i = 0; i < Array1.length; i++){
temp = Array1[i];
count[temp]++;
}//end of for looop
for(i=1; i < count.length; i++)
{
if(count[i] > 0 && count[i] == 1){
Occurence[k][0] = i ;
Occurence[k][1] = count[i];
k++;
}
else if(count[i] >= 2){
Occurence[k][0] = i ;
Occurence[k][1] = count[i];
k++;
}
}//end of for loop
return k;
}
public static void main(String[] args) {
//Scanner input = new Scanner(System.in);
int [] num = new int[20];
Integer [][] Occurence1 = new Integer[5][2];
Integer [][] Occurence2 = new Integer[3][2];
Integer [][] Occurence3 = new Integer[4][2];
Integer [][] Occurence4 = new Integer[3][2];
Integer [][] Occurence5 = new Integer[3][2];
Integer [][] Occurence6 = new Integer[4][2];
int i, k = 0;
int Array1[] = {9,3,3,4,3,4,3,4,58,8,9};
int Array2[] = {21,21,25,25,25,2,25,2,2};
int Array3[] ={60,60,15,5,5,5,5,60,8,8};
int Array4[] = {90,4,90,4,25,25,4,25,4};
int Array5[] ={50,50,50,60,60,60,60,12,12};
int Array6[] ={20,20,5,3,8,8,8,8,5,5};
k = getOccurence(Array1, Occurence1);
k = getOccurence(Array2, Occurence2);
k = getOccurence(Array3, Occurence3);
k = getOccurence(Array4, Occurence4);
k = getOccurence(Array5, Occurence5);
k = getOccurence(Array6, Occurence6);
Arrays.sort(Occurence1, new Comparator<Integer[]>() {
@Override
public int compare(Integer[] o1, Integer[] o2) {
Integer quantityOne = o1[1];
Integer quantityTwo = o2[1];
// reverse sort on quantity
return quantityOne.compareTo(quantityTwo);
}
});
Arrays.sort(Occurence2, new Comparator<Integer[]>() {
@Override
public int compare(Integer[] o1, Integer[] o2) {
Integer quantityOne = o1[1];
Integer quantityTwo = o2[1];
// reverse sort on quantity
return quantityOne.compareTo(quantityTwo);
}
});
Arrays.sort(Occurence3, new Comparator<Integer[]>() {
@Override
public int compare(Integer[] o1, Integer[] o2) {
Integer quantityOne = o1[1];
Integer quantityTwo = o2[1];
// reverse sort on quantity
return quantityOne.compareTo(quantityTwo);
}
});
Arrays.sort(Occurence4, new Comparator<Integer[]>() {
@Override
public int compare(Integer[] o1, Integer[] o2) {
Integer quantityOne = o1[1];
Integer quantityTwo = o2[1];
// reverse sort on quantity
return quantityOne.compareTo(quantityTwo);
}
});
Arrays.sort(Occurence5, new Comparator<Integer[]>() {
@Override
public int compare(Integer[] o1, Integer[] o2) {
Integer quantityOne = o1[1];
Integer quantityTwo = o2[1];
// reverse sort on quantity
return quantityOne.compareTo(quantityTwo);
}
});
Arrays.sort(Occurence6, new Comparator<Integer[]>() {
@Override
public int compare(Integer[] o1, Integer[] o2) {
Integer quantityOne = o1[1];
Integer quantityTwo = o2[1];
// reverse sort on quantity
return quantityOne.compareTo(quantityTwo);
}
});
//Collections.reverse(Occurence6);
/*for(i =0 ;i<4;i++)
{
System.out.printf("%d occur %d time ", Occurence6[i][0], Occurence6[i][1]);
}*/
for(i=1; i <= 3; i++)
{
System.out.printf("%d, %d, %d, %d, %d, %d ",Occurence1[Occurence1.length-i][0], Occurence2[Occurence2.length-i][0], Occurence3[Occurence3.length-i][0] ,
Occurence4[Occurence4.length-i][0], Occurence5[Occurence5.length-i][0], Occurence6[Occurence6.length-i][0]);
}//end of for loop*/
}//end of main
}//end of CountOccurrenceOfNumbers
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.