20/35

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

@@ -1,5 +1,7 @@
 package com.zipcodewilmington;
 
+import java.util.Arrays;
+
 /**
  * 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,16 @@ public class StringArrayUtils {
      * @return true if the array contains the specified `value`
      */ // TODO
     public static boolean contains(String[] array, String value) {
-        return false;
+
+        boolean result = false;
+
+        for (int i = 0; i < array.length; i++) {
+
+        if (array[i] == value) {
+            result = true;}
+        }
+
+        return result;
     }
 
     /**
@@ -50,7 +61,14 @@ public class StringArrayUtils {
      * @return an array with identical contents in reverse order
      */ // TODO
     public static String[] reverse(String[] array) {
-        return null;
+        String[] reverse = new String[array.length - 1];
+        int counter = array.length - 1;
+
+        for (int i = 0; i < array.length; i++) {
+            reverse[i] = array[counter];
+            counter--;
+        }
+        return reverse;
     }
 
     /**
@@ -58,7 +76,19 @@ 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;
+        String[] reverse = new String[array.length];
+        int counter = array.length - 1;
+        boolean result = false;
+
+        for (int i = 0; i < array.length; i++) {
+            reverse[i] = array[counter];
+            counter--;
+        }
+
+        if (Arrays.equals(array, reverse)) {
+            result = true;}
+
+            return result;
     }
 
     /**
@@ -66,7 +96,32 @@ 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;
+        int counter = 0;
+        char charmatch = 'a';
+        boolean result = false;
+        int i = 0;
+
+        while (charmatch <= 122) {
+
+            while (i < array.length) {
+                String value = array[i];
+                value = value.toLowerCase();
+                String thechar = String.valueOf(charmatch);
+                    if (value.contains(thechar)) {
+                    counter++;
+                    i++;
+                    } else { i++;}
+            }
+
+        charmatch++;
+        i = 0;
+
+        }
+
+        if (counter == 26) {
+            result = true;}
+
+            return result;
     }
 
     /**
@@ -75,7 +130,15 @@ public class StringArrayUtils {
      * @return number of occurrences the specified `value` has occurred
      */ // TODO
     public static int getNumberOfOccurrences(String[] array, String value) {
-        return 0;
+        int counter = 0;
+
+        for (int i = 0; i < array.length; i++) {
+
+            if (array[i].equals(value)) {
+                counter++;
+            }
+        }
+        return counter;
     }
 
     /**
@@ -84,7 +147,17 @@ public class StringArrayUtils {
      * @return array with identical contents excluding values of `value`
      */ // TODO
     public static String[] removeValue(String[] array, String valueToRemove) {
-        return null;
+        String[] newArray = new String[array.length - 2];
+        int counter = 0;
+
+        for (int i = 0; i < array.length; i++) {
+
+            if (array[i].equals(valueToRemove)) {
+                counter++;} else {newArray[i] = array[counter];
+            }
+            counter++;
+        }
+        return newArray;
     }
 
     /**
@@ -92,7 +165,26 @@ public class StringArrayUtils {
      * @return array of Strings with consecutive duplicates removes
      */ // TODO
     public static String[] removeConsecutiveDuplicates(String[] array) {
-        return null;
+        int counter = 0;
+
+        for (int i = 0; i < array.length; i++) {
+            if (array[i].equals(array[i+1])) {
+                counter++;
+            }}
+
+            int newArrayLength = (array.length - 1) - counter;
+            String[] newArray = new String[newArrayLength];
+
+            int dupcounter = 0;
+
+            for (int i = 0; i < newArrayLength; i++) {
+                if (array[i].equals(array[i+1])) {
+                    dupcounter++;
+                } else {newArray[i] = array[dupcounter];}
+            dupcounter++;
+        }
+
+        return newArray;
     }
 
     /**
@@ -100,8 +192,28 @@ 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;
-    }
+        int counter = 0;
+
+        for (int i = 0; i < array.length; i++) {
+            if (array[i].equals(array[counter])) {
+                counter++;
+            }
+            counter++;
+        }
 
+        int newArrayLength = (array.length - 1) - counter;
+        String[] newArray = new String[newArrayLength];
 
+        int dupcounter = 0;
+
+        for (int i = 0; i < newArrayLength; i++) {
+            if (array[i].equals(array[dupcounter])) {
+                newArray[i] += array[i];
+                counter++;
+            } else {newArray[i] = array[dupcounter];}
+            counter++;
+        }
+
+        return newArray;
+}
 }