This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #PF-Assgn-44 | |
| def find_duplicates(list_of_numbers): | |
| #start writing your code here | |
| x=set(list_of_numbers) | |
| y=[] | |
| dup=[] | |
| count=0 | |
| for i in x: | |
| y.append(i) | |
| for i in y: | |
| for j in list_of_numbers: | |
| if(j==i): | |
| count+=1 | |
| if count>=2: | |
| dup.append(i) | |
| break | |
| count=0 | |
| return dup | |
| list_of_numbers=[1,2,3] | |
| list_of_duplicates=find_duplicates(list_of_numbers) | |
| print(list_of_duplicates) |
// Solution in JAVA
ReplyDeleteimport java.util.ArrayList;
import java.util.HashSet;
import java.util.Iterator;
import java.util.List;
public class Assgn43 {
public static void main(String[] args)
{
ArrayList arg = new ArrayList(List.of(12,54,68,759,24,15,12,68,987,758,25,69));
System.out.println("ArrayList with duplicates: "+ arg);
Assgn43 duplist = new Assgn43();
duplist.findDuplicate(arg);
//duplist.removeDuplicate(arg);
}
public void findDuplicate(ArrayList arg)
{
ArrayList arrli = new ArrayList();
arrli = arg;
int count;
Iterator Itr = arrli.iterator();
HashSet arra = new HashSet();
while(Itr.hasNext())
{
int upVal = (Integer) Itr.next();
Iterator ptr = arrli.iterator();
count = 0;
while(ptr.hasNext())
{
int downVal = (Integer) ptr.next();
if(upVal == downVal) {
count++ ;
}
}
if(count > 1)
arra.add(upVal);
}
System.out.println("The List of duplicate elemnts is: "+ arra.toString());
}