commit

StringArrayUtils.java

@@ -1,5 +1,4 @@
- 
-
+import java.util.Arrays;
 /**
  * Created by leon on 1/29/18.
  */
@@ -9,7 +8,11 @@ public class StringArrayUtils {
      * @return first element of specified array
      */ // TODO
     public static String getFirstElement(String[] array) {
-        return null;
+        String result = "";
+
+        result += array[0];
+
+        return result ;
     }
 
     /**
@@ -17,7 +20,12 @@ public class StringArrayUtils {
      * @return second element in specified array
      */
     public static String getSecondElement(String[] array) {
-        return null;
+        String result = "";
+
+        result += array[1];
+
+        return result ;
+
     }
 
     /**
@@ -25,7 +33,9 @@ public class StringArrayUtils {
      * @return last element in specified array
      */ // TODO
     public static String getLastElement(String[] array) {
-        return null;
+        String result = "";
+
+        return array[array.length-1] ;
     }
 
     /**
@@ -33,7 +43,9 @@ public class StringArrayUtils {
      * @return second to last element in specified array
      */ // TODO
     public static String getSecondToLastElement(String[] array) {
-        return null;
+        String result = "";
+
+        return array[array.length-2];
     }
 
     /**
@@ -42,7 +54,17 @@ public class StringArrayUtils {
      * @return true if the array contains the specified `value`
      */ // TODO
     public static boolean contains(String[] array, String value) {
-        return false;
+        boolean x = false;
+        for (String i : array){
+
+            if (i == value){
+
+                x = true; 
+
+            }
+        }
+
+        return x;
     }
 
     /**
@@ -50,7 +72,16 @@ public class StringArrayUtils {
      * @return an array with identical contents in reverse order
      */ // TODO
     public static String[] reverse(String[] array) {
-        return null;
+        String order;
+
+        for (int x = 0; x < array.length/2; x++){
+            order = array[x];
+
+            array[x] = array[array.length -x -1];
+            array[array.length -x -1] = order;
+
+        }
+        return array;
     }
 
     /**
@@ -58,7 +89,18 @@ 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 rev = false;
+        for (int x = 0; x < array.length/2; x++){
+
+            if (array[x] == array[array.length -x -1]){
+
+                rev = true;
+
+            }
+
+        }
+        return rev;
     }
 
     /**
@@ -66,7 +108,25 @@ 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 every = false;
+        StringBuilder build = new StringBuilder();
+
+        for(String s: array){
+            build.append(s);
+        }
+        String ofArr = "";
+        ofArr = build.toString();
+        for (char x = 'A'; x < 'Z'; x++){
+            if ((ofArr.indexOf(x) <0) && (ofArr.indexOf((char) (x + 32)) <0)){
+                every =false;
+            }
+            else{  every = true;
+
+            }
+
+        }
+        return every;
+
     }
 
     /**
@@ -75,7 +135,18 @@ public class StringArrayUtils {
      * @return number of occurrences the specified `value` has occurred
      */ // TODO
     public static int getNumberOfOccurrences(String[] array, String value) {
-        return 0;
+
+        int occur = 0;
+
+        for (int x = 0; x < array.length; x++){
+
+            if (value.equals(array[x])){
+                occur++;
+            }
+
+        }
+
+        return occur;
     }
 
     /**
@@ -84,7 +155,21 @@ public class StringArrayUtils {
      * @return array with identical contents excluding values of `value`
      */ // TODO
     public static String[] removeValue(String[] array, String valueToRemove) {
-        return null;
+
+        int place = 0;
+        int count = getNumberOfOccurrences(array , valueToRemove);
+        String[] newArr = new String [array.length - count];
+
+        for (int x = 0; x < array.length; x++){
+            if (array[x] != valueToRemove){
+                newArr[place] = array[x];
+
+                place++;
+            }
+
+        }
+
+        return newArr;
     }
 
     /**
@@ -92,7 +177,27 @@ public class StringArrayUtils {
      * @return array of Strings with consecutive duplicates removes
      */ // TODO
     public static String[] removeConsecutiveDuplicates(String[] array) {
-        return null;
+        int newArrIndex= 0;
+
+        String[] newArr = new String[array.length];
+        newArr[newArrIndex] = array[0];
+        newArrIndex++;
+
+        for (int x = 1; x < array.length; x++){
+            if (!array[x].equals(newArr[newArrIndex - 1])){
+
+                newArr[newArrIndex]= array[x]; 
+
+                newArrIndex++;
+            }
+
+        }
+        String[] newArr2 = new String [newArrIndex];
+        System.arraycopy(newArr, 0 , newArr2,  0, newArrIndex);
+
+        return newArr2;
+
+        
     }
 
     /**
@@ -100,8 +205,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;
+        StringBuilder dups = new StringBuilder(array[0]);
+
+        String[] newArr = new String[array.length-count(array)];
+        int adding = 0;
+
+        for (int x = 1; x < array.length; x++){
+            if (array[x-1].equals(array[x])){
+                dups.append(array[x]);
+            }
+            else {
+                newArr[adding] = dups.toString();
+                dups.setLength(0);
+                dups.append(array[x]);
+                adding++;
+
+            }
+        }
+
+        newArr[adding] = dups.toString();
+        return newArr;
     }
 
+    public static int count(String[] array){
+        int count = 0;
+
+        for (int x = 1; x < array.length; x++){
+            if (array[x-1].equals(array[x])){
+
+                count++;    
+            }
+
+        }
+        
+        return count;
+    }
 
 }

StringArrayUtilsTest.java

@@ -329,7 +329,7 @@ public class StringArrayUtilsTest {
 
 
 
-
+   
 
 
     @Test

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=800
+editor.fx.0.x=375
+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=154
+package.editor.y=51
+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