StringArrayUtils.java

@@ -1,15 +1,16 @@
- 
+import java.util.Arrays;
 
 /**
  * Created by leon on 1/29/18.
  */
 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 +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,9 @@ public class StringArrayUtils {
      * @return true if the array contains the specified `value`
      */ // TODO
     public static boolean contains(String[] array, String value) {
+        for(int i = 0; i < array.length; i++) {
+            if(array[i].equals(value)) return true;
+        }
         return false;
     }
 
@@ -50,7 +54,11 @@ public class StringArrayUtils {
      * @return an array with identical contents in reverse order
      */ // TODO
     public static String[] reverse(String[] array) {
-        return null;
+        String[] revArray = new String[array.length];
+        for (int i = 0; i < array.length; i++) {
+            revArray[i] = array[array.length - 1 - i];
+        }
+        return revArray;
     }
 
     /**
@@ -58,7 +66,13 @@ 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;
+
+        for ( int i = 0; i < array.length / 2; i++) {
+            if (array[i] != array[array.length - 1 - i]) {
+                return false;
+            }
+        }    
+        return true;
     }
 
     /**
@@ -66,16 +80,41 @@ public class StringArrayUtils {
      * @return true if each letter in the alphabet has been used in the array
      */ // TODO
     public static boolean isPangramic(String[] array) {
+        //boolean result= true;
+        String words = String.join("", array).toLowerCase();
+
+      int counterTrue = 0;
+        for(char c = 'a';c <= 'z'; c++) {
+
+            if(words.contains(String.valueOf(c))) {
+                //result = false;
+                counterTrue++;
+                //return true;
+            } 
+        }
+
+        if (counterTrue == 26) return true;
         return false;
     }
+        
+    
 
     /**
      * @param array array of String objects
      * @param value value to check array for
      * @return number of occurrences the specified `value` has occurred
      */ // TODO
+
     public static int getNumberOfOccurrences(String[] array, String value) {
-        return 0;
+        int num = 0;
+        for (int i=0;i<array.length;i++){
+            if (array[i]== value){
+                num++;
+            }
+
+        }
+
+        return num;
     }
 
     /**
@@ -84,7 +123,23 @@ public class StringArrayUtils {
      * @return array with identical contents excluding values of `value`
      */ // TODO
     public static String[] removeValue(String[] array, String valueToRemove) {
-        return null;
+        int newLength = array.length;
+        String[] result = new String[array.length-1];
+        String[] removedValue = new String[1];
+        int count1 = 0; // count tracks the current index of the output array
+        int count2 = 0; // count tracks the current index of the output array
+        
+        for(int i = 0; i < array.length; i++) // i tracks the current index of the input array
+        {
+            if(!array[i].contains(valueToRemove)) {
+                result[count1] = array[i]; 
+                count1++;
+            }else {
+                removedValue[count2] = array[i];
+                count2++;
+            }
+        }
+        return result;
     }
 
     /**
@@ -92,7 +147,25 @@ public class StringArrayUtils {
      * @return array of Strings with consecutive duplicates removes
      */ // TODO
     public static String[] removeConsecutiveDuplicates(String[] array) {
-        return null;
+        String[] resultArray = new String[array.length];
+        int resultIndex = 0;
+        for(int i = 0; i < array.length; i++) {
+            
+            if(i == 0) {
+                resultArray[resultIndex] = array[i];
+                resultIndex++;
+            }
+            else if((i > 0 && i < array.length-2) && (!array[i].equals(array[i-1]) || !array[i].equals(array[i+1])))
+            {
+                resultArray[resultIndex] = array[i];
+                resultIndex++;
+            }else if (i == array.length-1 && !array[i].equals(array[i-1])) {
+                resultArray[resultIndex] = array[i];
+                resultIndex++;
+            }
+        }
+        String[] realAnswer = Arrays.copyOf(resultArray, resultIndex);
+        return realAnswer;
     }
 
     /**
@@ -100,8 +173,29 @@ 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[] resultArray = new String[array.length];
+        StringBuilder dups = new StringBuilder();
+        int resultIndex = 0;
+        for(int i = 0; i < array.length; i++) {
+            
+            if(i == 0) {
+                resultArray[resultIndex] = array[i];
+                dups.append(array[i].toString());
+                resultIndex++;
+            }
+            else if((i > 0 && i < array.length-2) && (array[i].equals(array[i-1]) || array[i].equals(array[i+1])))
+            {
+                resultArray[resultIndex] = array[i];
+                dups.append(array[i].toString());
+                resultIndex++;
+            }else if (i == array.length-1 && array[i].equals(array[i-1])) {
+                resultArray[resultIndex] = array[i];
+                dups.append(array[i].toString());
+                resultIndex++;
+            }
+        }
+        String[] realAnswer = Arrays.copyOf(resultArray, resultIndex);
+        return realAnswer;
     }
 
-
 }

package.bluej

@@ -0,0 +1,42 @@
+#BlueJ package file
+dependency1.from=StringArrayUtilsTest
+dependency1.to=StringArrayUtils
+dependency1.type=UsesDependency
+editor.fx.0.height=714
+editor.fx.0.width=800
+editor.fx.0.x=442
+editor.fx.0.y=33
+objectbench.height=101
+objectbench.width=461
+package.divider.horizontal=0.6
+package.divider.vertical=0.8007380073800738
+package.editor.height=427
+package.editor.width=674
+package.editor.x=267
+package.editor.y=85
+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