ArrayUtility DONE

src/main/java/com/zipcodewilmington/arrayutility/ArrayUtility.java

@@ -1,7 +1,84 @@
 package com.zipcodewilmington.arrayutility;
 
+import com.sun.tools.classfile.Instruction;
+
+import java.lang.reflect.Array;
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.HashMap;
+
 /**
  * Created by leon on 3/6/18.
  */
-public class ArrayUtility {
+public class ArrayUtility<T> {
+
+    public ArrayUtility(T[] inputArray) {
+        this.inputArray = inputArray;
+    }
+    T[] inputArray;
+
+
+
+    public Integer countDuplicatesInMerge(T[] arrayToMerge, T valueToEvaluate) {
+
+        ArrayUtility au = new ArrayUtility(merge(arrayToMerge));
+
+
+
+
+        return au.getNumberOfOccurrences(valueToEvaluate);
+    }
+
+    public Object[] merge(T[] arrayToMerge){
+        Object[] mergedArray = new Object [arrayToMerge.length + inputArray.length];
+               System.arraycopy(inputArray, 0, mergedArray, 0, inputArray.length );
+               System.arraycopy(arrayToMerge, 0, mergedArray, inputArray.length, arrayToMerge.length );
+
+    return mergedArray;
+    }
+
+    public T[] removeValue(T valueToRemove) {
+        ArrayList<T> Jae = new ArrayList<>();
+
+        for (int i = 0; i < inputArray.length; i++){
+            if (!inputArray[i].equals(valueToRemove)){
+                Jae.add(inputArray[i]);
+            }
+        }
+
+        int length = Jae.size();
+        inputArray = (T[]) Array.newInstance(inputArray.getClass().getComponentType(), length);
+
+        return Jae.toArray(inputArray);
+    }
+
+    public Integer getNumberOfOccurrences(T valueToEvaluate) {
+        Integer count = 0;
+
+        for (int i = 0; i < inputArray.length; i++){
+            if (inputArray[i].equals(valueToEvaluate)){
+                count++;
+            }
+        }
+
+        return count;
+    }
+
+    public T getMostCommonFromMerge(T[] arrayToMerge) {
+
+        ArrayUtility au = new ArrayUtility(merge(arrayToMerge));
+        Object[] merged = merge(arrayToMerge);
+//        HashMap<T, Integer> map = new HashMap<>();
+        int count = 0;
+        T popular = null;
+
+        for (Object o : merged){
+            if (getNumberOfOccurrences((T)o) > count){
+                count = getNumberOfOccurrences((T)o);
+                popular = (T) o;
+            }
+        }
+        return popular;
+
+    }
 }

src/test/java/com/zipcodewilmington/arrayutility/RemoveValueTest.java

@@ -1,6 +1,5 @@
 package com.zipcodewilmington.arrayutility;
 
-import com.zipcodewilmington.UnitTestingUtils;
 import org.junit.Test;
 
 /**