Compiles

StringArrayUtils.java

@@ -3,6 +3,8 @@ import java.util.Arrays;
 import java.util.Collections;
 import java.util.List;
 import java.util.*;
+import java.lang.StringBuilder;
+import java.lang.String;
 /**
  * Created by leon on 1/29/18.
  */
@@ -94,36 +96,43 @@ public class StringArrayUtils {
      * @return true if each letter in the alphabet has been used in the array
      */ // TODO
     public static boolean isPangramic(String[] array) {
+
+        String alphabet = "abcdefghijklmnopqrstuvwxyz";
+        boolean pan = true;
         boolean check = false;
-        //Scanner reader = new Scanner();
-        String string = new String();//reader.nextLine();
-        Set character = new HashSet();
-        Set set = new HashSet();
-        for (char c:string.toUpperCase().toCharArray()){
             
-            if (character.equals(c)){
-                set.add(c);}
+        for (int i = 0; i>26; i++){
+            
+            for(String string:array){
+                
+                if (string.contains(Character.toString(alphabet.charAt(i)))){    
+                    check = true;
+                }
+                
+                else{ check = false;
+                }
+            }
+            if (check == false){
+                pan = false;
+                break;
+            }
         }
-        if (set.size() == 26){
-            check = true;}
-            else {
-                check = false;}
-        return check;
-        
+        return pan;
     }
-
-    /**
-     * @param array array of String objects
-     * @param value value to check array for
-     * @return number of occurrences the specified `value` has occurred
-     */ // Done
-    public static int getNumberOfOccurrences(String[] array, String value) {
+        /**
+         * @param array array of String objects
+         * @param value value to check array for
+         * @return number of occurrences the specified `value` has occurred
+         */ // Done
+        public static int getNumberOfOccurrences(String[] array, String value) {
         int counter = 0;
         for (int i = 0; i<array.length; i++){
-            if (array[i] == array[i+1]){
-                counter=counter+1;}
-                
+            if (array[i] == value){
+                counter=counter+1;   
             }
+
+        }
+
         return counter;
     }
 
@@ -133,21 +142,30 @@ public class StringArrayUtils {
      * @return array with identical contents excluding values of `value`
      */ // Done
     public static String[] removeValue(String[] array, String valueToRemove) {
-        //sort array, create new array, compare i, add new i to new array.
-        Arrays.sort(array);
-        ArrayList fresh = new ArrayList();
-        for (int i=0;i<array.length;i++){
-            if (array[i] != valueToRemove){
-                fresh.add(array[i]);
+
+        String [] temp = new String[array.length-(getNumberOfOccurrences(array,valueToRemove))];
+
+        for(int i = 0 ,j = 0;  i<array.length; i++){
+            if(!array[i].equals(valueToRemove)){
+
+                temp[j] = array[i];
+                j++;
             }
-            
         }
-        String[] list = (String[])(fresh.toArray()); //needed to convert to a string array, not a string
-        return list;
-        
-        //String delete = value.replaceAll (Character.toString(charToRemove), "");
-       //return delete;  
-        //return list.toString();
+
+        return temp;
+    }
+
+    public static int duplicates(String[] array){
+        String dupes = new String();
+        int counter = 0;
+        for (int i=0; i<array.length-1;i++){
+            if (array[i] == array[i+1]){
+                counter++;
+                //dupes += (array[i]);
+            }
+        }
+        return counter;
     }
 
     /**
@@ -155,15 +173,16 @@ public class StringArrayUtils {
      * @return array of Strings with consecutive duplicates removes
      */ // TODO
     public static String[] removeConsecutiveDuplicates(String[] array) {
-        Arrays.sort(array);
-        ArrayList fresh = new ArrayList();
-        for (int i=0; i<array.length; i++){
-         if (array[i] != array[i-1] && array[i] != array[i+1]) {
-            fresh.add(array[i]);
+        String [] temp = new String[array.length-duplicates(array)];
+        int j = 0;
+        for(int i = 0; i<array.length-1; i++){
+            if(array[i] != array[i+1]){
+                temp[j] = array[i];
+                j++;
             }
         }
-        String[] list = (String[])(fresh.toArray());
-        return list;
+        temp[temp.length-1] = array[array.length-1];
+        return temp;
     }
 
     /**
@@ -171,7 +190,21 @@ 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[] pack = new String[array.length-duplicates(array)];
+        int j = 0;
+        pack[0]=array[0];
+        for(int i=1; i<array.length; i++){
+
+            if (array[i] == array[i-1]){
+                pack[j] += array[i];
+            }
+            else{
+                j++;
+                pack[j]=array[i];
+            }
+        }
+
+        return pack;
     }
 
 }

package.bluej

@@ -2,18 +2,18 @@
 dependency1.from=StringArrayUtilsTest
 dependency1.to=StringArrayUtils
 dependency1.type=UsesDependency
-editor.fx.0.height=714
-editor.fx.0.width=930
-editor.fx.0.x=310
-editor.fx.0.y=23
+editor.fx.0.height=716
+editor.fx.0.width=800
+editor.fx.0.x=-186
+editor.fx.0.y=-1039
 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=255
-package.editor.y=130
+package.editor.x=561
+package.editor.y=-828
 package.frame.height=600
 package.frame.width=800
 package.numDependencies=1