fin

StringArrayUtils.java

@@ -1,5 +1,5 @@
- 
 
+import java.util.*;
 /**
  * Created by leon on 1/29/18.
  */
@@ -9,7 +9,7 @@ public class StringArrayUtils {
      * @return first element of specified array
      */ // TODO
     public static String getFirstElement(String[] array) {
-        return null;
+        return array[0];
     }
 
     /**
@@ -17,7 +17,7 @@ public class StringArrayUtils {
      * @return second element in specified array
      */
     public static String getSecondElement(String[] array) {
-        return null;
+        return array[1];
     }
 
     /**
@@ -25,7 +25,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,16 +33,20 @@ 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];
     }
 
-    /**
+    /*
      * @param array array of String objects
      * @param value value to check array for
      * @return true if the array contains the specified `value`
      */ // TODO
     public static boolean contains(String[] array, String value) {
-        return false;
+        boolean result = false;
+        for (String val : array) {
+            if (val.equals(value)) result = true;
+        }
+        return result;
     }
 
     /**
@@ -50,7 +54,13 @@ public class StringArrayUtils {
      * @return an array with identical contents in reverse order
      */ // TODO
     public static String[] reverse(String[] array) {
-        return null;
+        String[] reverseArray = new String[array.length];
+        int j = 0;
+        for (int i = array.length - 1; i >= 0; i--) {
+            reverseArray[j] = array[i];
+            j++;
+        }
+        return reverseArray;
     }
 
     /**
@@ -58,7 +68,20 @@ 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 result = true;
+        String[] revArr = new String[array.length];
+
+        int j = 0;
+        for (int i = array.length - 1; i >= 0; i--)  {
+            revArr[j] = array[i];
+            j++;
+        }
+
+        for (int i = 0; i < array.length - 1; i++) {
+            if (!(array[i].equals(revArr[i]))) result = false;
+        }
+
+        return result;
     }
 
     /**
@@ -66,7 +89,20 @@ 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;
+        String alpha = "abcdefghijklmnopqrstuvwxyz";
+
+        for (int i = 0; i < array.length; i++) {
+            String word = array[i];
+            for (int j = 0; j < word.length(); j++) {
+                String letter = Character.toString(word.charAt(j)).toLowerCase();
+                if (alpha.indexOf(letter) != -1) {
+                    alpha = alpha.replace(letter, "");
+                }
+            }
+        }
+
+        boolean result = alpha.length() <= 0;
+        return result;
     }
 
     /**
@@ -75,7 +111,11 @@ public class StringArrayUtils {
      * @return number of occurrences the specified `value` has occurred
      */ // TODO
     public static int getNumberOfOccurrences(String[] array, String value) {
-        return 0;
+        int result = 0;
+        for (String val : array) {
+            if (val.equals(value)) result += 1;
+        }
+        return result;
     }
 
     /**
@@ -84,7 +124,22 @@ public class StringArrayUtils {
      * @return array with identical contents excluding values of `value`
      */ // TODO
     public static String[] removeValue(String[] array, String valueToRemove) {
-        return null;
+        int count = 0;
+        for (int i = 0; i < array.length; i++) {
+            if(array[i].equals(valueToRemove)) count++;
+        }
+
+        String[] newArr = new String[array.length - count];
+
+        int j = 0;
+        for (int i = 0; i < array.length; i++) {
+            if (!array[i].equals(valueToRemove)) {
+                newArr[j] = array[i];
+                j++;
+            }
+        }
+
+        return newArr;
     }
 
     /**
@@ -92,7 +147,23 @@ public class StringArrayUtils {
      * @return array of Strings with consecutive duplicates removes
      */ // TODO
     public static String[] removeConsecutiveDuplicates(String[] array) {
-        return null;
+        int count = 0;
+        for (int i = 0; i < array.length - 1; i++) {
+            if (array[i].equals(array[i + 1])) count++;
+        }
+
+        String[] newArr = new String[array.length - count];
+        newArr[newArr.length - 1] = array[array.length - 1];
+        int j = 0;
+
+        for (int i = 0; i < array.length - 1; i++) {
+            if (!array[i].equals(array[i + 1])) {
+                newArr[j] = array[i];
+                j++;
+            }
+        }
+
+        return newArr;
     }
 
     /**
@@ -100,8 +171,40 @@ 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 count = 1;
 
+        for (int i = 0; i < array.length - 1; i++) {
+            System.out.println(!array[i].equals(array[i + 1]));
+            if (!array[i].equals(array[i + 1])) count++;
+        }
 
-}
+        String[] newArr = new String[count];
+
+        StringBuilder temp = new StringBuilder();
+        for (int i = array.length - 1; i >= 0; i--) {
+            if (array[i].equals(array[i - 1])) {
+                temp.append(array[i]);
+            } else {
+                temp.append(array[i]);
+                newArr[newArr.length - 1] = temp.toString();
+                temp = new StringBuilder();
+                break;
+            }
+        }
+
+        int j = 0;
+        for (int i = 0; i < array.length - 1; i++) {
+            if (array[i].equals(array[i + 1])) {
+                temp.append(array[i]);
+            } else {
+                temp.append(array[i]);
+                newArr[j] = temp.toString();
+                temp = new StringBuilder();
+                j++;
+            }
+        }
+
+        System.out.println(Arrays.toString(newArr));
+        return newArr;
+    }
+}

package.bluej

@@ -0,0 +1,42 @@
+#BlueJ package file
+dependency1.from=StringArrayUtilsTest
+dependency1.to=StringArrayUtils
+dependency1.type=UsesDependency
+editor.fx.0.height=0
+editor.fx.0.width=0
+editor.fx.0.x=0
+editor.fx.0.y=0
+objectbench.height=164
+objectbench.width=776
+package.divider.horizontal=0.6
+package.divider.vertical=0.6845018450184502
+package.editor.height=364
+package.editor.width=674
+package.editor.x=0
+package.editor.y=23
+package.frame.height=600
+package.frame.width=800
+package.numDependencies=1
+package.numTargets=2
+package.showExtends=true
+package.showUses=true
+project.charset=UTF-8
+readme.height=58
+readme.name=@README
+readme.width=47
+readme.x=10
+readme.y=10
+target1.height=50
+target1.name=StringArrayUtilsTest
+target1.showInterface=false
+target1.type=UnitTestTargetJunit4
+target1.width=150
+target1.x=130
+target1.y=10
+target2.height=50
+target2.name=StringArrayUtils
+target2.showInterface=false
+target2.type=ClassTarget
+target2.width=120
+target2.x=70
+target2.y=70