-
Notifications
You must be signed in to change notification settings - Fork 43
Expand file tree
/
Copy pathArrayUtility.java
More file actions
92 lines (84 loc) · 2.94 KB
/
ArrayUtility.java
File metadata and controls
92 lines (84 loc) · 2.94 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
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
package com.zipcodewilmington.arrayutility;
import java.util.*;
/**
* Created by leon on 3/6/18.
*/
public class ArrayUtility <SomeType extends Object> {
SomeType[] array;
public ArrayUtility(SomeType[] inputArray) {
array = inputArray;
}
public SomeType[] removeValue(SomeType valueToRemove) {
List<SomeType> arrayAsList = new ArrayList<>();
for (SomeType element : array) {
if (!element.equals(valueToRemove)) {
arrayAsList.add(element);
}
}
SomeType[] newArray = Arrays.copyOf(array, arrayAsList.size());
for (int i = 0, j = 0; i < newArray.length; i++, j++) {
if (array[i].equals(valueToRemove)) {
newArray[i] = array[j + 1];
j++;
}
else if (array[j].equals(valueToRemove)) {
newArray[i] = array[j + 1];
}
else {
newArray[i] = array[j];
}
}
return newArray;
}
public Integer getNumberOfOccurrences(SomeType valueToEvaluate) {
int numberOfOccurences = 0;
for (SomeType element : array) {
if (element.equals(valueToEvaluate)) {
numberOfOccurences++;
}
}
return numberOfOccurences;
}
public SomeType getMostCommonFromMerge(SomeType[] arrayToMerge) {
//List<SomeType> listOfCommonElements = new ArrayList<>();
List<SomeType> arrayAsList = new ArrayList<>(Arrays.asList(array));
for (SomeType element : arrayToMerge) {
arrayAsList.add(element);
}
// int outerBound = 0;
// if (arrayToMerge.length < array.length) {
// outerBound = arrayToMerge.length;
// }
// else {
// outerBound = array.length;
// }
// for (int i = 0; i < outerBound; i++) {
// if (array[i].equals(arrayToMerge[i])) {
// listOfCommonElements.add(array[i]);
// }
// }
int numberOfMostCommonElement = 0;
SomeType mostCommonElement = null;
for (SomeType eachElement : arrayAsList) {
int numberOfOccurences = getNumberOfOccurrences(eachElement);
if (numberOfOccurences > numberOfMostCommonElement) {
mostCommonElement = eachElement;
numberOfMostCommonElement = numberOfOccurences;
}
}
return mostCommonElement;
}
public Integer countDuplicatesInMerge(SomeType[] arrayToMerge, SomeType valueToEvaluate) {
List<SomeType> arrayAsList = new ArrayList<>(Arrays.asList(array));
for (SomeType element : arrayToMerge) {
arrayAsList.add(element);
}
int numberOfOccurences = 0;
for (SomeType eachElement : arrayAsList) {
if (eachElement.equals(valueToEvaluate)) {
numberOfOccurences++;
}
}
return numberOfOccurences;
}
}