refactored lab

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

@@ -7,58 +7,67 @@ import java.util.Arrays;
 /**
  * Created by leon on 3/6/18.
  */
-public class ArrayUtility<E> {
+public class ArrayUtility<T> {
 
-    private ArrayList<E> list;
-    private E[] arr;
-    private ArrayList<E> tempArr;
+    T[] list;
 
-    public ArrayUtility( E[] arr) {
-        list = new ArrayList<E>(Arrays.asList(arr));
-        this.arr=arr;
+    public ArrayUtility(T[] list) {
+        this.list = list;
     }
 
-    public Integer getNumberOfOccurrences(E valueToEvaluate) {
-        Integer counter = 0;
-        for ( E el : list){
-            if (el.equals(valueToEvaluate)){counter++;}
+    public int getNumberOfOccurrences(T element){
+        int count=0;
+        for(T el: list){
+            if(el.equals(element)){
+                count++;
+            }
         }
-        return counter;
+        return count;
     }
 
-    public void merge(E[] arrayToMerge) {
-        for(E el : arrayToMerge){
-            list.add(el);
+    public Object[] merge(T[] arr1){
+        Object[] mergeArr = new Object[list.length+arr1.length];
+        int counter=0;
+        for(T el : list ){
+            mergeArr[counter]=el;
+            counter++;
+        }
+        for(T el : arr1){
+            mergeArr[counter]=el;
+            counter++;
         }
+        return mergeArr;
     }
 
-    public E getMostCommonFromMerge(E[] arrayToMerge) {
-       merge(arrayToMerge);
-       int frequencey = Integer.MIN_VALUE;
-        E mostCommonElement =null;
-        for (E el : list){
-            if (getNumberOfOccurrences(el)>frequencey){
-                frequencey = getNumberOfOccurrences(el);
-                mostCommonElement = el;}
-        }
-        return mostCommonElement;
+    public int countDuplicatesInMerge(T[] arrayToMerge, T valueToEvaluate) {
+        ArrayUtility arrayUtil = new ArrayUtility(merge(arrayToMerge));
+        return arrayUtil.getNumberOfOccurrences(valueToEvaluate);
     }
 
-    public int countDuplicatesInMerge(E[] arrayToMerge, E valueToEvaluate) {
-        merge(arrayToMerge);
-       return getNumberOfOccurrences(valueToEvaluate);
+    public T getMostCommonFromMerge(T[] arrayToMerge) {
+        ArrayUtility arrayUtil = new ArrayUtility(merge(arrayToMerge));
+        int tempCount = 0;
+        T mostCommonObj = null;
+        for(Object el : arrayUtil.list){
+            if(getNumberOfOccurrences((T)el)>tempCount){
+                tempCount=getNumberOfOccurrences((T)el);
+                mostCommonObj=(T)el;
+            }
+        }
+        return mostCommonObj;
     }
 
-    public E[] removeValue(E valueToRemove) {
-        tempArr = new ArrayList<>();
-        for(E el : list){
-            if (el != valueToRemove){
-                tempArr.add(el);
+    public T[] removeValue(T valueToRemove) {
+        ArrayList<T> tempArr = new ArrayList<>();
+        for(int i =0; i<list.length; i++){
+            if(!list[i].equals(valueToRemove)){
+                tempArr.add(list[i]);
             }
         }
         int newLength = tempArr.size();
-        arr = (E[]) Array.newInstance(arr.getClass().getComponentType(), newLength);
+        list = (T[]) Array.newInstance(list.getClass().getComponentType(), newLength);
 
-        return tempArr.toArray(arr);
+        return tempArr.toArray(list);
     }
+
 }

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

@@ -0,0 +1,24 @@
+package com.zipcodewilmington.arrayutility;
+
+import java.util.ArrayList;
+
+public class MyList<T> {
+
+    ArrayList<T> list;
+
+    public MyList(ArrayList<T> list) {
+        this.list = list;
+    }
+
+    public int getNumberOfOccurrences(T element){
+        int count=0;
+        for(T el: list){
+            if(el.equals(element)){
+                count++;
+            }
+        }
+        return count;
+    }
+
+
+}