message

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

@@ -1,7 +1,84 @@
 package com.zipcodewilmington.arrayutility;
 
+import java.lang.reflect.Array;
+import java.util.*;
+
 /**
  * Created by leon on 3/6/18.
  */
-public class ArrayUtility {
+public class ArrayUtility<I> {
+
+    private I[] inputArray;
+
+    public ArrayUtility(I[] inputArray) {
+        this.inputArray = inputArray;
+    }
+
+    public I[] removeValue(I valueToRemove) {
+        List<I> arr = Arrays.asList(inputArray);
+
+        ArrayList<I> arr2 = new ArrayList(arr);
+        for (Iterator<I> it = arr.iterator(); it.hasNext(); ) {
+            I o = it.next();
+            if (o.equals(valueToRemove)) {
+                arr2.remove(o);
+
+            }
+        }
+        I[] arr3 = (I[]) Array.newInstance(inputArray.getClass().getComponentType(), arr2.size());
+        return  arr2.toArray(arr3);
+
+    }
+
+    public Integer countDuplicatesInMerge(I[] arrayToMerge, I valueToEvaluate) {
+        Object[] newArr = new Object[inputArray.length + arrayToMerge.length];
+        System.arraycopy(inputArray, 0, newArr, 0, inputArray.length);
+        System.arraycopy(arrayToMerge, 0, newArr, inputArray.length, arrayToMerge.length);
+
+        Integer count = 0;
+        for (Object i : newArr) {
+            if (i == valueToEvaluate) {
+                count++;
+            }
+        }
+        System.out.println(newArr);
+        return count;
+
+    }
+
+    public I getMostCommonFromMerge(I[] arrayToMerge) {
+        Object[] newArr = new Object[inputArray.length + arrayToMerge.length];
+        System.arraycopy(inputArray, 0, newArr, 0, inputArray.length);
+        System.arraycopy(arrayToMerge, 0, newArr, inputArray.length, arrayToMerge.length);
+
+        Integer count = 1;
+        Integer tempCount;
+        Object common = newArr[0];
+        Object temp;
+
+        for (int x = 0; x < newArr.length -1; x++) {
+            temp = newArr[x];
+            tempCount = 0;
+            for (int i = 1; i < newArr.length; i++) {
+                if (temp == newArr[i])
+                    tempCount++;
+                if (count < tempCount) {
+                    common = temp;
+                    count = tempCount;
+                }
+            }
+        }
+        return (I) common;
+    }
+
+    public Integer getNumberOfOccurrences(I valueToEvaluate) {
+        Integer count = 0;
+        for (Object i : inputArray){
+            if ( i == valueToEvaluate){
+                count++;
+            }
+        }
+
+        return count;
+    }
 }

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

@@ -32,7 +32,7 @@ public class GetMostCommonFromMergeTest {
         ArrayUtility<Long> arrayUtility = new ArrayUtility<Long>(inputArray);
 
         // When
-        Long actual = arrayUtility.getMostCommonFromMerge(arrayToMerge);
+        Long actual = Long.valueOf(arrayUtility.getMostCommonFromMerge(arrayToMerge));
 
         // Then
         Assert.assertEquals(expected, actual);
@@ -48,7 +48,7 @@ public class GetMostCommonFromMergeTest {
         ArrayUtility<String> arrayUtility = new ArrayUtility<String>(inputArray);
 
         // When
-        String actual = arrayUtility.getMostCommonFromMerge(arrayToMerge);
+        String actual = String.valueOf(arrayUtility.getMostCommonFromMerge(arrayToMerge));
 
         // Then
         Assert.assertEquals(expected, actual);

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

@@ -1,6 +1,6 @@
 package com.zipcodewilmington.arrayutility;
 
-import com.zipcodewilmington.UnitTestingUtils;
+//import com.zipcodewilmington.UnitTestingUtils;
 import org.junit.Test;
 
 /**
@@ -32,7 +32,6 @@ public class RemoveValueTest {
         Long[] inputArray = {12L, 2L, valueToRemove, 8L, 4L, 5L, valueToRemove, 0L, 9L, 8L, valueToRemove};
         ArrayUtility<Long> arrayUtility = new ArrayUtility<Long>(inputArray);
 
-
         // When
         Long[] actual = arrayUtility.removeValue(valueToRemove);