java array check duplicates
duplicates = false;
for(i = 0; i < zipcodeList.length; i++) {
for(j = i + 1; k < zipcodeList.length; j++) {
if(j != i && zipcodeList[j] == zipcodeList[i]) {
duplicates = true;
}
}
}java array check duplicates
duplicates = false;
for(i = 0; i < zipcodeList.length; i++) {
for(j = i + 1; k < zipcodeList.length; j++) {
if(j != i && zipcodeList[j] == zipcodeList[i]) {
duplicates = true;
}
}
}find duplicate elements in array in java
/*This method is all in one
*you can find following things:
*finding Duplicate elements in array
*array without duplicate elements
*number of duplicate elements
*numbers of pair of dulicate with repeatation
*/
//let given array = [2,3,2,5,3]
public static void findDuplicateArray(int [] array)
{
int size = array.length;
//creating array to hold count frequency of array elements
int [] countFrequency = new int[size];
// filling countFrequency with -1 value on every index
for(int i = 0; i < size; i++)
{
countFrequency[i] = -1;//[-1,-1,-1,-1,-1...]
}
int count = 1;
for(int i = 0; i < size; i++)
{
//check countFrequency[i] != 0 because 0 means it already counted
if(countFrequency[i] != 0)
{
for(int j = i+1; j < size; j++)
{
//if array[i] == array[j] then increase count value
if(array[i] == array[j])
{
count++;
/*only at first occurence of an element count value
*will be increased else everywhere it will be 0
*/
countFrequency[j]= 0;
}
}
countFrequency[i] = count;
}
count = 1;
}
// array = [2,3,2,5,3]
//countFrequency = [2,2,0,1,0]
System.out.println("array without duplicate elements");
for(int i = 0; i < array.length; i++)
{
if(countFrequency[i] >= 1)
System.out.print(array[i] + " ");
}
System.out.println();
System.out.println("duplicate elements in array");
for(int i = 0; i < array.length; i++)
{
if(countFrequency[i]/2 >= 1)
System.out.print(array[i] + " ");
}
System.out.println();
System.out.println("number of duplicate elements");
count = 0;
for(int i = 0; i < array.length; i++)
{
if(countFrequency[i]/2 >= 1)
count++;
}
System.out.print(count);
System.out.println();
System.out.println("numbers of pair of dulicate with repeatation");
count = 0;
for(int i = 0; i < array.length; i++)
{
if(countFrequency[i] >= 2)
{
int div = countFrequency[i]/2;
count+=div;
}
}
System.out.println(count);
int [] array3 = new int [array.length];
for(int i = 0; i < array.length; i++)
{
for(int j = 0; j < countFrequency[i]; j++)
{
array3[i]= array[i];
}
}
}Copyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us
