done, dammit

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

@@ -1,53 +1,75 @@
 package com.zipcodewilmington.arrayutility;
-import java.util.Arrays;
-import java.util.HashMap;
-import java.util.stream.Stream;
+import java.util.*;
 
 public class ArrayUtility <T> {
     private T[] inputArray;
+    private T[] mergeArray;
+    private Object valueToRemove;
 
     public ArrayUtility(){}
     public ArrayUtility(T[] inputArray) {
-        this.inputArray = (T[]) inputArray;
+        this.inputArray =  inputArray;
     }
 
     public T getMostCommonFromMerge(T[] arrayToMerge) {
-        T[] mergeArray = Arrays.copyOf(inputArray, inputArray.length + arrayToMerge.length);
-        for(int i = 0; i<mergeArray.length; i++){
-            mergeArray[i+ inputArray.length] = arrayToMerge[i];
+        mergeArray = (T[]) new Object[inputArray.length + arrayToMerge.length];
+       System.arraycopy(inputArray, 0,mergeArray, 0, inputArray.length);
+       System.arraycopy(arrayToMerge, 0, mergeArray, inputArray.length, arrayToMerge.length);
+       // System.out.println(mergeArray);
+
+        int numberOfOccurences = 0;
+        T mostCommon = mergeArray[0];
+        for (T element : mergeArray)
+        {
+            if (getNumberOfOccurrences(element) > numberOfOccurences)
+            {
+                mostCommon = element;
+                numberOfOccurences = getNumberOfOccurrences(element);
+            }
+
         }
+        return mostCommon;
+    }
 
-        HashMap<T, Integer> repeats = new HashMap<>();
-        Integer mostCommon = 0;
-        for (int i = 0; i < mergeArray.length; i++) {
-            int count = 0;
-            for (int j = 0; j < mergeArray.length; j++) {
-                if (mergeArray[i] == mergeArray[j]) {
-                    count++;
+
+        public T[] removeValue (T valueToRemove){
+        Integer appearances = getNumberOfOccurrences(valueToRemove);
+            int i = 0;
+            //mergeArray = (T[]) new Object[inputArray.length-appearances];
+             mergeArray = Arrays.copyOf(inputArray, inputArray.length-appearances);
+            for (T element : inputArray) {
+                if (!element.equals(valueToRemove)) {
+                    mergeArray[i] = element;
+                    i++;
+                }
                 }
+                return mergeArray;
             }
 
-            if (count > 1) {
-                if (!repeats.containsKey(mergeArray[i])) {
-                    repeats.put(mergeArray[i], count);
-                    mostCommon += count;
+
+        public Integer countDuplicatesInMerge (T[]arrayToMerge, T valueToEvaluate){
+            mergeArray = (T[]) new Object[inputArray.length + arrayToMerge.length];
+            System.arraycopy(inputArray, 0,mergeArray, 0, inputArray.length);
+            System.arraycopy(arrayToMerge, 0, mergeArray, inputArray.length, arrayToMerge.length);
+            Integer appearances = 0;
+            for (T element : mergeArray) {
+                if (element == valueToEvaluate) {
+                    appearances++;
                 }
             }
+            return appearances;
         }
-        T dupe = (T) repeats.get(0);
-        return dupe;
-    }
 
 
-    public T[] removeValue(T valueToRemove) {
-        return (T[]) inputArray;
-    }
-
-    public Integer countDuplicatesInMerge(T[] arrayToMerge, T valueToEvaluate) {
-        return null;
-    }
-
     public Integer getNumberOfOccurrences(T valueToEvaluate) {
-        return null;
+       // mergeArray = Arrays.copyOf(inputArray, inputArray.length);
+        Integer appearances = 0;
+        for (T element : inputArray) {
+            if (element == valueToEvaluate) {
+                appearances++;
+            }
+        }
+        return appearances;
     }
-}
+
+    }//end of Class