finished lab

src/main/java/com/zipcodewilmington/StringArrayUtils.java

@@ -1,5 +1,7 @@
 package com.zipcodewilmington;
 
+import java.util.ArrayList;
+
 /**
  * Created by leon on 1/29/18.
  */
@@ -9,7 +11,7 @@ public class StringArrayUtils {
      * @return first element of specified array
      */ // TODO
     public static String getFirstElement(String[] array) {
-        return null;
+        return array[0];
     }
 
     /**
@@ -17,7 +19,7 @@ public class StringArrayUtils {
      * @return second element in specified array
      */
     public static String getSecondElement(String[] array) {
-        return null;
+        return array[1];
     }
 
     /**
@@ -25,7 +27,7 @@ public class StringArrayUtils {
      * @return last element in specified array
      */ // TODO
     public static String getLastElement(String[] array) {
-        return null;
+        return array[array.length-1];
     }
 
     /**
@@ -33,7 +35,7 @@ public class StringArrayUtils {
      * @return second to last element in specified array
      */ // TODO
     public static String getSecondToLastElement(String[] array) {
-        return null;
+        return array[array.length-2];
     }
 
     /**
@@ -42,7 +44,12 @@ public class StringArrayUtils {
      * @return true if the array contains the specified `value`
      */ // TODO
     public static boolean contains(String[] array, String value) {
-        return false;
+        boolean inArr = false;
+        for(String str : array){
+            if(str.equals(value)){inArr = true;}
+            else{}
+        }
+        return inArr;
     }
 
     /**
@@ -50,7 +57,11 @@ public class StringArrayUtils {
      * @return an array with identical contents in reverse order
      */ // TODO
     public static String[] reverse(String[] array) {
-        return null;
+        String[] revArr = new String[array.length];
+        for (int i = 0; i < array.length; i++) {
+            revArr[i] = array[array.length-i-1];
+        }
+        return revArr;
     }
 
     /**
@@ -58,7 +69,14 @@ public class StringArrayUtils {
      * @return true if the order of the array is the same backwards and forwards
      */ // TODO
     public static boolean isPalindromic(String[] array) {
-        return false;
+            boolean isPal = false;
+        for (int i = 0; i < array.length; i++) {
+            if(array[i] == reverse(array)[i]){
+                isPal = true;
+            }
+            else{}
+        }
+        return isPal;
     }
 
     /**
@@ -66,7 +84,28 @@ public class StringArrayUtils {
      * @return true if each letter in the alphabet has been used in the array
      */ // TODO
     public static boolean isPangramic(String[] array) {
-        return false;
+
+        boolean[] lettersUsed = new boolean[26];
+        int charIndex = 0;
+
+        for(int i = 0; i < array.length; i++) {
+            for (int j = 0; j < array[i].length(); j++) {
+                array[i] = array[i].toLowerCase();
+               if ('a' <= array[i].charAt(j) && 'z' >= array[i].charAt(j)) {
+                    charIndex = array[i].charAt(j) - 'a';
+                } else {
+                }
+                lettersUsed[charIndex] = true;
+            }
+        }
+
+        for(int i = 0; i <= 25; i++){
+            if(!lettersUsed[i]){
+                return false;
+            } else{
+            }
+        }
+        return true;
     }
 
     /**
@@ -75,7 +114,13 @@ public class StringArrayUtils {
      * @return number of occurrences the specified `value` has occurred
      */ // TODO
     public static int getNumberOfOccurrences(String[] array, String value) {
-        return 0;
+        int sumVal = 0;
+        for(String str : array){
+            if(str.equals(value)){
+                sumVal++;
+            } else{}
+        }
+        return sumVal;
     }
 
     /**
@@ -84,7 +129,19 @@ public class StringArrayUtils {
      * @return array with identical contents excluding values of `value`
      */ // TODO
     public static String[] removeValue(String[] array, String valueToRemove) {
-        return null;
+
+       ArrayList<String> temp = new ArrayList<String>();
+
+       for(String str : array){
+           if(!str.equals(valueToRemove)){
+               temp.add(str);
+           } else{}
+       }
+       String[] newArr = new String[temp.size()];
+       newArr = temp.toArray(new String[temp.size()]);
+
+
+        return newArr;
     }
 
     /**
@@ -92,7 +149,20 @@ public class StringArrayUtils {
      * @return array of Strings with consecutive duplicates removes
      */ // TODO
     public static String[] removeConsecutiveDuplicates(String[] array) {
-        return null;
+
+        ArrayList<String> temp = new ArrayList<String>();
+
+        temp.add(array[0]);
+
+        for (int i = 1; i < array.length; i++) {
+            if(!array[i-1].equals(array[i])){
+                temp.add(array[i]);
+            }
+        }
+        String[] newArr = new String[temp.size()];
+        newArr = temp.toArray(new String[temp.size()]);
+
+        return newArr;
     }
 
     /**
@@ -100,8 +170,26 @@ public class StringArrayUtils {
      * @return array of Strings with each consecutive duplicate occurrence concatenated as a single string in an array of Strings
      */ // TODO
     public static String[] packConsecutiveDuplicates(String[] array) {
-        return null;
-    }
 
+        ArrayList<String> temp = new ArrayList<String>();
 
+       // temp.set(0,array[0]);
+        String compCh = new String();
+        compCh = array[0];
+        temp.add(array[0]);
+
+        for(int i = 1; i < array.length; i++){
+            if(array[i] == compCh){
+                temp.set(temp.size() -1, temp.get(temp.size() - 1) + array[i]);
+            } else {
+                temp.add(array[i]);
+                compCh = array[i];
+            }
+        }
+
+        String[] newArr = new String[temp.size()];
+        newArr = temp.toArray(new String[temp.size()]);
+
+        return newArr;
+    }
 }