Verification says that removeAllNumbersGreaterThan10 should work for sets of any size. Doesn't this solution do that?
package com.codegym.task.task08.task0814;
import java.util.HashSet;
import java.util.Set;
import java.util.Iterator;
/*
Greater than 10? You're not a good fit for us
*/
public class Solution {
public static HashSet<Integer> createSet() {
// write your code here
HashSet<Integer> set = new HashSet<Integer>(20);
set.add(new Integer(671));
set.add(new Integer(451));
set.add(new Integer(41));
set.add(new Integer(15613));
set.add(new Integer(3));
set.add(new Integer(1581));
set.add(new Integer(111));
set.add(new Integer(91));
set.add(new Integer(19));
set.add(new Integer(14));
set.add(new Integer(1));
set.add(new Integer(189));
set.add(new Integer(167));
set.add(new Integer(15));
set.add(new Integer(16));
set.add(new Integer(11));
set.add(new Integer(9));
set.add(new Integer(12));
set.add(new Integer(51));
set.add(new Integer(31));
return set;
}
public static HashSet<Integer> removeAllNumbersGreaterThan10(HashSet<Integer> set) {
// write your code here
for (Iterator i = set.iterator(); i.hasNext();) {
Integer integer = (Integer) i.next();
if((Integer) i.next() > 10)
{
set.remove((Integer) i.next());
}
}
return set;
}
public static void main(String[] args) {
}
}