completed

StringArrayUtils.java

@@ -1,15 +1,15 @@
- 
 
 /**
  * Created by leon on 1/29/18.
  */
+import java.util.Arrays;
 public class StringArrayUtils {
     /**
      * @param array array of String objects
      * @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,7 +33,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 +42,15 @@ public class StringArrayUtils {
      * @return true if the array contains the specified `value`
      */ // TODO
     public static boolean contains(String[] array, String value) {
-        return false;
+
+        boolean answer = false;
+        for(String arr: array) {
+            if (arr.equals(value)){
+                answer = true;
+                break;
+            } 
+        }
+        return answer;
     }
 
     /**
@@ -50,7 +58,15 @@ public class StringArrayUtils {
      * @return an array with identical contents in reverse order
      */ // TODO
     public static String[] reverse(String[] array) {
-        return null;
+        String[] answer = new String[array.length];
+        int count = 0;
+
+        for(int i = array.length - 1; i >= 0; i--){
+            answer[count] = array[i];
+            count++;
+        }
+
+        return answer;
     }
 
     /**
@@ -58,7 +74,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 answer = false;
+        String[] flipped = reverse(array);
+
+        if( Arrays.equals(array, flipped)){
+
+            answer = true;}
+
+        return answer;
     }
 
     /**
@@ -66,7 +89,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;
+        String[] alpha = {"a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"};
+        String bigString = "";
+
+        boolean result = true;
+        //could be seperate method makeString(String[] arr)
+        for(int i = 0; i<array.length;i++){
+            bigString = bigString + array[i];
+        }
+        // could be seperate method backToArray(String string)
+        String[] arrBig = new String[bigString.length()];
+        for(int j = 0; j < arrBig.length; j++){
+            arrBig[j]= (bigString.charAt(j)+"").toLowerCase();
+        }
+
+        for(int i = 0; i < alpha.length; i++){
+            if(!contains(arrBig,alpha[i])){
+                result = false;
+                break;
+            }
+        }
+
+        return result;
     }
 
     /**
@@ -75,7 +119,14 @@ public class StringArrayUtils {
      * @return number of occurrences the specified `value` has occurred
      */ // TODO
     public static int getNumberOfOccurrences(String[] array, String value) {
-        return 0;
+        int count = 0;
+        for(int i = 0; i < array.length; i++){
+            if(array[i].contains(value)){
+                count++;
+            }
+        }
+
+        return count;
     }
 
     /**
@@ -84,7 +135,21 @@ public class StringArrayUtils {
      * @return array with identical contents excluding values of `value`
      */ // TODO
     public static String[] removeValue(String[] array, String valueToRemove) {
-        return null;
+        //iterate over an array of strings
+        // if array[i] !contains valueToRemove, add to new string
+        // convert string to array
+        // return new array
+        String saveMe = "";
+
+        for(int i = 0; i < array.length; i++){
+            if(array[i] != valueToRemove){
+                saveMe = saveMe + array[i] + " ";
+            }
+        }
+
+        String[] answer = saveMe.split(" ", 0);
+
+        return answer;
     }
 
     /**
@@ -92,7 +157,23 @@ public class StringArrayUtils {
      * @return array of Strings with consecutive duplicates removes
      */ // TODO
     public static String[] removeConsecutiveDuplicates(String[] array) {
-        return null;
+        //create string to save needed values
+        int count = 0;
+        String saveMe = "";
+        //loop array and compare array[i] and array[i+1]
+        for(int i = 0; i < array.length; i++){
+            
+            if(count > 1 && array[i] == array[i+1]){
+            saveMe = saveMe;
+            } else if(count == 0 && array[i] == array[i + 1] && i < array.length - 2){
+            count ++;
+            saveMe = saveMe + array[i] + " ";
+            }else if(array[i] != array[i -1]){
+            saveMe = saveMe + array[i] + " ";
+            }
+        }
+        String[] answer = saveMe.split(" ");
+        return answer;
     }
 
     /**
@@ -100,8 +181,14 @@ 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;
-    }
+        String saveMe = "";
 
+        for(int i = 0; i < array.length; i++){
+            saveMe = saveMe +array[i];
+        }
+        String[]answer = saveMe.split("(?<=(.))(?!\\1)");
+
+        return answer;
+    }
 
 }

package.bluej

@@ -0,0 +1,42 @@
+#BlueJ package file
+dependency1.from=StringArrayUtilsTest
+dependency1.to=StringArrayUtils
+dependency1.type=UsesDependency
+editor.fx.0.height=722
+editor.fx.0.width=991
+editor.fx.0.x=119
+editor.fx.0.y=23
+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=139
+package.editor.y=39
+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