updated

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

@@ -8,11 +8,13 @@ import java.util.Arrays;
  * Created by leon on 3/6/18.
  */
 public class ArrayUtility<S> {
-    ArrayList<S> newlist=new ArrayList<S>();
+
     S[] inputArray;
+    S[] mergerArray;
+
     public ArrayUtility(S[] inputArray) {
         this.inputArray=inputArray;
-        this.newlist.addAll(Arrays.asList(inputArray));
+
         //S[] temp = (S[]) new Object[length];(creating a new generic array)
     }
     public int getNumberOfOccurrences(S valueToEvaluate)
@@ -45,10 +47,13 @@ public class ArrayUtility<S> {
 
     }
 
-    public Integer countDuplicatesInMerge(S[] inputArray, S valueToEvaluate ) {
+    public Integer countDuplicatesInMerge(S[] newArray, S valueToEvaluate ) {
+
         Integer count=0;
-        newlist.addAll(Arrays.asList(inputArray));
-        for (S element : newlist) {
+        mergerArray = (S[]) new Object[inputArray.length+newArray.length];
+        System.arraycopy(inputArray, 0,mergerArray, 0,inputArray.length);
+        System.arraycopy(newArray,0,mergerArray, inputArray.length,newArray.length);
+        for (S element : mergerArray) {
             if(element.equals(valueToEvaluate))
             {
                 count++;
@@ -57,11 +62,14 @@ public class ArrayUtility<S> {
         return count;
     }
 
-    public S getMostCommonFromMerge(S[] inputArray)
+    public S getMostCommonFromMerge(S[] newArray)
     {
-        S mostcommonElement=inputArray[0];
+        mergerArray = (S[]) new Object[inputArray.length+newArray.length];
+        System.arraycopy(inputArray, 0,mergerArray, 0,inputArray.length);
+        System.arraycopy(newArray,0,mergerArray, inputArray.length,newArray.length);
+        S mostcommonElement=mergerArray[0];
         int mostcommonElementOccurences=0;
-        for(S element :newlist)
+        for(S element :mergerArray)
         {
             if(getNumberOfOccurrences(element)>mostcommonElementOccurences)
             {
@@ -71,5 +79,4 @@ public class ArrayUtility<S> {
         }
         return mostcommonElement;
     }
-
 }