|
@@ -1,10 +1,7 @@
|
1
|
1
|
package com.zipcodewilmington.arrayutility;
|
2
|
2
|
|
3
|
3
|
import java.lang.reflect.Array;
|
4
|
|
-import java.util.Arrays;
|
5
|
|
-import java.util.HashSet;
|
6
|
|
-import java.util.Map;
|
7
|
|
-import java.util.Set;
|
|
4
|
+import java.util.*;
|
8
|
5
|
import java.util.stream.Collectors;
|
9
|
6
|
import java.util.stream.Stream;
|
10
|
7
|
|
|
@@ -33,9 +30,17 @@ public class ArrayUtility<T> {
|
33
|
30
|
}
|
34
|
31
|
|
35
|
32
|
public T[] removeValue(T valueToRemove) {
|
36
|
|
- return null;
|
|
33
|
+ ArrayList<T> arr = new ArrayList<>();
|
|
34
|
+ for (T e: element){
|
|
35
|
+ if (!e.equals(valueToRemove)){
|
|
36
|
+ arr.add(e);
|
|
37
|
+ }
|
|
38
|
+ }
|
|
39
|
+ return arr.toArray((T[]) Array.newInstance(element.getClass().getComponentType(), arr.size()));
|
37
|
40
|
}
|
38
|
41
|
|
|
42
|
+
|
|
43
|
+
|
39
|
44
|
public T getMostCommonFromMerge(T[] arrayToMerge) {
|
40
|
45
|
return null;
|
41
|
46
|
}
|