finishing up

StringArrayUtils.java

@@ -1,4 +1,5 @@
- 
+package treeSet;
+import java.util.ArrayList; 
 
 /**
  * Created by leon on 1/29/18.
@@ -9,7 +10,7 @@ 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,11 @@ public class StringArrayUtils {
      * @return true if the array contains the specified `value`
      */ // TODO
     public static boolean contains(String[] array, String value) {
+        for(String element:array){
+            if(element==value){
+                return true;
+            }
+        }
         return false;
     }
 
@@ -50,7 +56,13 @@ public class StringArrayUtils {
      * @return an array with identical contents in reverse order
      */ // TODO
     public static String[] reverse(String[] array) {
-        return null;
+        String flip="";
+        for(int i=0;i<array.length/2;i++){
+            flip=array[i];
+            array[i]=array[array.length-1-i];
+            array[array.length-1-i] = flip; 
+        }
+        return array; 
     }
 
     /**
@@ -58,7 +70,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;
+        int palindrome = array.length;
+        for(int i=0;i<array.length;i++){
+            String start = array[i];
+            String end =array[--palindrome];
+            if(palindrome<i){
+                return true;
+            }
+            if(start!=end){
+                return false;
+            }
+        }
+        return true;
     }
 
     /**
@@ -66,7 +89,15 @@ 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;
+        int counter=0;
+        int i;
+        /*for(String e:array){
+            if(e==(i = 'a';i <= 'z'));{
+                counter++;}}
+        if(counter<26){
+            return false;
+        }return true;*/
+
     }
 
     /**
@@ -75,7 +106,12 @@ public class StringArrayUtils {
      * @return number of occurrences the specified `value` has occurred
      */ // TODO
     public static int getNumberOfOccurrences(String[] array, String value) {
-        return 0;
+        int counter=0;
+        for(int i=0;i<array.length;i++){
+            if(array[i]==value){
+                counter++;}
+        }
+        return counter;
     }
 
     /**
@@ -84,7 +120,13 @@ public class StringArrayUtils {
      * @return array with identical contents excluding values of `value`
      */ // TODO
     public static String[] removeValue(String[] array, String valueToRemove) {
-        return null;
+        ArrayList<String> remove = new ArrayList<String>();
+        for(String e : array){
+            if(!e.equals(valueToRemove)){
+                remove.add(e);
+            }
+        }
+        return remove.toArray(new String[remove.size()]);
     }
 
     /**
@@ -92,7 +134,14 @@ public class StringArrayUtils {
      * @return array of Strings with consecutive duplicates removes
      */ // TODO
     public static String[] removeConsecutiveDuplicates(String[] array) {
-        return null;
+        SortedSet<String> remove = new TreeSet<>(array);
+        for(String e:remove){
+        if(e==e){
+        remove.remove(e);
+            }
+        }
+        
+        return array;
     }
 
     /**
@@ -103,5 +152,4 @@ public class StringArrayUtils {
         return null;
     }
 
-
 }

StringArrayUtils.java#

@@ -0,0 +1,155 @@
+package treeSet
+import java.util.ArrayList; 
+
+/**
+ * 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 array[0];
+    }
+
+    /**
+     * @param array array of String objects
+     * @return second element in specified array
+     */
+    public static String getSecondElement(String[] array) {
+        return array[1];
+    }
+
+    /**
+     * @param array array of String objects
+     * @return last element in specified array
+     */ // TODO
+    public static String getLastElement(String[] array) {
+        return array[array.length-1];
+    }
+
+    /**
+     * @param array array of String objects
+     * @return second to last element in specified array
+     */ // TODO
+    public static String getSecondToLastElement(String[] array) {
+        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) {
+        for(String element:array){
+            if(element==value){
+                return true;
+            }
+        }
+        return false;
+    }
+
+    /**
+     * @param array of String objects
+     * @return an array with identical contents in reverse order
+     */ // TODO
+    public static String[] reverse(String[] array) {
+        String flip="";
+        for(int i=0;i<array.length/2;i++){
+            flip=array[i];
+            array[i]=array[array.length-1-i];
+            array[array.length-1-i] = flip; 
+        }
+        return array; 
+    }
+
+    /**
+     * @param array array of String objects
+     * @return true if the order of the array is the same backwards and forwards
+     */ // TODO
+    public static boolean isPalindromic(String[] array) {
+        int palindrome = array.length;
+        for(int i=0;i<array.length;i++){
+            String start = array[i];
+            String end =array[--palindrome];
+            if(palindrome<i){
+                return true;
+            }
+            if(start!=end){
+                return false;
+            }
+        }
+        return true;
+    }
+
+    /**
+     * @param array array of String objects
+     * @return true if each letter in the alphabet has been used in the array
+     */ // TODO
+    public static boolean isPangramic(String[] array) {
+        int counter=0;
+        int i;
+        /*for(String e:array){
+            if(e==(i = 'a';i <= 'z'));{
+                counter++;}}
+        if(counter<26){
+            return false;
+        }return true;*/
+
+    }
+
+    /**
+     * @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) {
+        int counter=0;
+        for(int i=0;i<array.length;i++){
+            if(array[i]==value){
+                counter++;}
+        }
+        return counter;
+    }
+
+    /**
+     * @param array         array of String objects
+     * @param valueToRemove value to remove from array
+     * @return array with identical contents excluding values of `value`
+     */ // TODO
+    public static String[] removeValue(String[] array, String valueToRemove) {
+        ArrayList<String> remove = new ArrayList<String>();
+        for(String e : array){
+            if(!e.equals(valueToRemove)){
+                remove.add(e);
+            }
+        }
+        return remove.toArray(new String[remove.size()]);
+    }
+
+    /**
+     * @param array array of chars
+     * @return array of Strings with consecutive duplicates removes
+     */ // TODO
+    public static String[] removeConsecutiveDuplicates(String[] array) {
+        SortedSet<String> remove = new TreeSet<>(array);
+        for(String e:remove){
+        if(e==e){
+        remove.remove(e);
+            }
+        }
+        
+        return array;
+    }
+
+    /**
+     * @param array array of chars
+     * @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;
+    }
+
+}

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=40
+editor.fx.0.y=120
+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=31
+package.editor.y=75
+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=70
+target1.y=10
+target2.height=50
+target2.name=StringArrayUtils
+target2.showInterface=false
+target2.type=ClassTarget
+target2.width=120
+target2.x=70
+target2.y=70