Legacy code all the way!

StringArrayUtils.java

@@ -1,4 +1,4 @@
- 
+import java.util.Arrays;
 
 /**
  * Created by leon on 1/29/18.
@@ -9,7 +9,8 @@ public class StringArrayUtils {
      * @return first element of specified array
      */ // TODO
     public static String getFirstElement(String[] array) {
-        return null;
+
+        return array[0];
     }
 
     /**
@@ -17,7 +18,7 @@ public class StringArrayUtils {
      * @return second element in specified array
      */
     public static String getSecondElement(String[] array) {
-        return null;
+        return array[1];
     }
 
     /**
@@ -25,7 +26,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 +34,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,6 +43,12 @@ public class StringArrayUtils {
      * @return true if the array contains the specified `value`
      */ // TODO
     public static boolean contains(String[] array, String value) {
+        for(String entry: array){
+            if(entry.equalsIgnoreCase(value)){
+                return true;
+            }
+        }
+
         return false;
     }
 
@@ -50,7 +57,15 @@ 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];
+        int j= 0;
+        for(int i=array.length-1; i> -1; i--){
+            reverse[j] = array[i];
+
+            j++;
+        } 
+
+        return reverse;
     }
 
     /**
@@ -58,6 +73,12 @@ public class StringArrayUtils {
      * @return true if the order of the array is the same backwards and forwards
      */ // TODO
     public static boolean isPalindromic(String[] array) {
+        String [] reverse = new String[array.length];
+        reverse = reverse(array);
+
+        if(Arrays.equals(array, reverse)){
+            return true;
+        }
         return false;
     }
 
@@ -66,7 +87,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 output = false;
+        char [] alphabet = {'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'};
+        int count = 0;
+        for(int i =0; i< array.length; i++){
+            for(int j =0; j< array[i].length(); j++){
+                for( int k = 0; k<alphabet.length; k++){
+                    if(array[i].toUpperCase().charAt(j) == (alphabet[k])){
+                        count++;
+                        continue;
+                    }
+                    if(count == 26){
+                        output=true;
+                        break;
+                    }
+                }
+            }
+        }
+
+        return output;
     }
 
     /**
@@ -75,7 +114,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 count = 0;
+
+        for(String entry: array){
+            if(entry.equals(value)){
+                count++;
+            }
+        }
+
+        return count;
     }
 
     /**
@@ -84,7 +131,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 totaltodelete = getNumberOfOccurrences(array,valueToRemove);
+        String[] output = new String[array.length- totaltodelete];
+        int count = 0;
+
+        for(int i =0; i< array.length; i++){
+            if(array[i].equals(valueToRemove)){
+
+            } else{
+                output[count] =array[i];
+                count++;
+            }   
+        }
+
+        return output;
     }
 
     /**
@@ -92,7 +153,24 @@ public class StringArrayUtils {
      * @return array of Strings with consecutive duplicates removes
      */ // TODO
     public static String[] removeConsecutiveDuplicates(String[] array) {
-        return null;
+        int count = 0;
+        int entry = 0;
+
+        for(int i =0; i< array.length; i++){
+            if((i-1>-1) && (array[i].equals(array[i-1]))){
+                count++;
+            } 
+        }
+        String[] output = new String[array.length - count];
+        for(int i =0; i< array.length; i++){
+            if((i-1>-1) && (array[i].equals(array[i-1]))){
+
+            }else{
+                output[entry] =array[i];
+                entry++;
+            }
+        }
+        return output;
     }
 
     /**
@@ -100,8 +178,44 @@ 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 = 0;
+        int entry = 0;
+        int dupes = 0;
+
+        for(int i =0; i< array.length; i++){
+            if(((i+1< array.length) && (array[i].equals(array[i+1])))){
 
+            } else{
+                count++;
+            }
+        }
+
+        String[] output = new String[count];
+        StringBuilder consecutive = new StringBuilder("");
+        for(int i =0; i< array.length; i++){
+            //Is the entry equal to an adjacent entry? If so apeend to consecutive
+            if((i == array.length -1) || (entry == 0) || (i+1< array.length) && (i-1>-1) && (array[i].equals(array[i-1]) || array[i].equals(array[i+1]))){
+                consecutive.append(array[i]);
+                entry++;
+                if((i == array.length -1) || (i+1< array.length) && !(array[i].equals(array[i+1]))){
+                    output[dupes] = consecutive.toString();
+                    consecutive.setLength(0);
+                    dupes++;
+                }
+            }
+            //If not add it to the array
+            else{
+                //but make sure to add consecutive to the array first
+                if(consecutive.length() > 0){
+                    output[dupes] = array[i];
+                }else{
+                    output[dupes] = array[i];
+                }
+                dupes++;
+            }
+        }
+        System.out.print(output.toString());
+        return output;
+    }
 }

package.bluej

@@ -0,0 +1,42 @@
+#BlueJ package file
+dependency1.from=StringArrayUtilsTest
+dependency1.to=StringArrayUtils
+dependency1.type=UsesDependency
+editor.fx.0.height=709
+editor.fx.0.width=800
+editor.fx.0.x=240
+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=208
+package.editor.y=135
+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