-
Notifications
You must be signed in to change notification settings - Fork 43
Expand file tree
/
Copy pathArrayUtility.java
More file actions
54 lines (44 loc) · 1.56 KB
/
ArrayUtility.java
File metadata and controls
54 lines (44 loc) · 1.56 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
package com.zipcodewilmington.arrayutility;
import java.util.*;
import java.util.stream.Stream;
/**
* Created by leon on 3/6/18.
*/
public class ArrayUtility<T> {
T[] input;
public ArrayUtility(T[] inputArray){
this.input = inputArray;
}
public Integer countDuplicatesInMerge(T[] arrayToMerge, T valueToEvaluate) {
ArrayList<T> aList = new ArrayList<>(Arrays.asList(input));
ArrayList<T> bList = new ArrayList<>(Arrays.asList(arrayToMerge));
aList.addAll(bList);
return Collections.frequency(aList, valueToEvaluate);
}
public T getMostCommonFromMerge(T[] arrayToMerge) {
ArrayList<T> aList = new ArrayList<>(Arrays.asList(input));
ArrayList<T> bList = new ArrayList<>(Arrays.asList(arrayToMerge));
aList.addAll(bList);
Integer amt = 0;
T mostcommon = null;
for(T element : aList){
if (getNumberOfOccurrences(element) > amt) {
amt = getNumberOfOccurrences(element);
mostcommon = element;
}
}
return mostcommon;
}
public T[] removeValue(T valueToRemove) {
ArrayList<T> list = new ArrayList<>(Arrays.asList(input));
while (list.contains(valueToRemove)){
list.remove(valueToRemove);
}
T[] arr = (T[])list.toArray(new Object[0]);
return arr;
}
public Integer getNumberOfOccurrences(T valueToEvaluate) {
ArrayList<T> aList = new ArrayList<>(Arrays.asList(input));
return Collections.frequency(aList, valueToEvaluate);
}
}