finished Lab

StringArrayUtils.java

@@ -1,15 +1,17 @@
- 
 
 /**
  * Created by leon on 1/29/18.
  */
+import java.util.Arrays;
+import java.lang.*;
 public class StringArrayUtils {
     /**
      * @param array array of String objects
      * @return first element of specified array
      */ // TODO
+    static int countRoy = 0;
     public static String getFirstElement(String[] array) {
-        return null;
+        return array[0];
     }
 
     /**
@@ -17,7 +19,7 @@ public class StringArrayUtils {
      * @return second element in specified array
      */
     public static String getSecondElement(String[] array) {
-        return null;
+        return array[1];
     }
 
     /**
@@ -25,7 +27,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 +35,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 +44,11 @@ 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 +57,13 @@ public class StringArrayUtils {
      * @return an array with identical contents in reverse order
      */ // TODO
     public static String[] reverse(String[] array) {
-        return null;
+        
+        for(int i = 0 ; i < array.length/2; i++){
+            String temp1 = array[i];
+            array[i] = array[array.length-i-1];
+            array[array.length-i-1] = temp1;
+        }
+        return array;
     }
 
     /**
@@ -58,15 +71,57 @@ 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[] arrayCopy = reverse(array);
+        String[] arrayCopy = new String[array.length];
+        int j = 0;
+        for (int i = array.length - 1; i >= 0; i--) {
+            System.out.println(j);
+            arrayCopy[j++] = array[i];
+            System.out.println(j);
+        }
+        if (Arrays.equals(array, arrayCopy)){
+        return true;
+        }
+        //System.out.println(array[]);
         return false;
+        
     }
 
     /**
      * @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) {
-        return false;
+    public static boolean isPangramic(String[] array){
+        String alphabet = "abcdefghijklmnopqrstuvwxyz";
+        //System.out.println(newArray);
+        boolean pangramic = true;
+        for(int i =0; i<alphabet.length(); i++){
+            boolean letterFound = false;
+            for(int j =0; j<array.length; j++){
+                
+                if(array[j].toLowerCase().contains(Character.toString(alphabet.charAt(i)))){
+                    letterFound = true;
+                    break;
+                }
+                
+            }
+            if (!letterFound){
+                pangramic = false;
+                break;
+            }
+            
+        }
+
+        return pangramic;
+    }
+
+    public void println(){
+        String[] s = {"Is this a plaindrome?", "This is not a plaindrome", "Is this a palindrome?", "This is not a palindrome"};
+        s = reverse(s);
+        for (String sa: s){
+            System.out.println(sa);
+        }
+        System.out.println(countRoy);
     }
 
     /**
@@ -75,7 +130,13 @@ public class StringArrayUtils {
      * @return number of occurrences the specified `value` has occurred
      */ // TODO
     public static int getNumberOfOccurrences(String[] array, String value) {
-        return 0;
+        int numberOfOccurances =0;
+        for(int i=0; i<array.length; i++){
+            if (array[i] == value){
+                numberOfOccurances++;
+            }
+        }
+        return numberOfOccurances;
     }
 
     /**
@@ -84,7 +145,29 @@ public class StringArrayUtils {
      * @return array with identical contents excluding values of `value`
      */ // TODO
     public static String[] removeValue(String[] array, String valueToRemove) {
-        return null;
+        int occurance = getNumberOfOccurrences(array, valueToRemove);
+
+        String[] newArray = new String[array.length - occurance];
+        int j = 0;
+        for(int i=0; i<array.length; i++){
+            if (array[i] != valueToRemove){
+                newArray[j] = array[i];
+                j++;
+            }
+
+        }
+        return newArray;
+    }
+
+    public static int countOcuurances(String[] array){
+        int count =0;
+        for(int i=1; i<array.length; i++){
+
+            if (array[i-1] == array[i]){
+                count++;
+            }
+        }
+        return count;
     }
 
     /**
@@ -92,7 +175,25 @@ public class StringArrayUtils {
      * @return array of Strings with consecutive duplicates removes
      */ // TODO
     public static String[] removeConsecutiveDuplicates(String[] array) {
-        return null;
+        int count = countOcuurances(array);
+        String[] newArray = new String[array.length - count];
+        String[] expected = {"aba", "baa", "bab", "bba", "zzz", "bba", "aba", "bbb"};
+        int j =0;
+        for(int i=1; i<array.length; i++){
+            if(array[i-1] != array[i] ){
+                System.out.println(array[i]);
+                newArray[j] = array[i-1];
+                j++;
+            }
+
+            if (i == array.length - 1 ) {
+                newArray[j] = array[array.length - 1];
+
+            }
+        }
+        //System.out.println(newArray[0]);
+        return newArray;
+
     }
 
     /**
@@ -100,8 +201,28 @@ 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 = countOcuurances(array);
+        int j=0;
+        String[] newArray = new String[array.length - count];
+        newArray[0] = array[0];
+        for(int i=1; i<array.length; i++){
+            if(array[i-1].equals(array[i]) ){
+                //System.out.println(array[i]);
+                newArray[j] += array[i];
+                //j++;
+
+            }
 
+            else {
+                j++;
+                newArray[j] = array[i];  
+            }
+            // else if (i == array.length - 1 ) {
+            // newArray[j] = array[array.length - 1];
+
+            // }
+        }
+        return newArray;
+    }
 
 }

StringArrayUtilsTest.java

@@ -2,6 +2,7 @@
 
 import org.junit.Assert;
 import org.junit.Test;
+import java.util.*;
 
 /**
  * Created by leon on 1/29/18.
@@ -243,6 +244,7 @@ public class StringArrayUtilsTest {
     public void testIsPalindromic3() {
         String[] array = {"Is this a plaindrome?", "This is not a plaindrome", "Is this a palindrome?", "This is not a palindrome"};
         boolean outcome = StringArrayUtils.isPalindromic(array);
+        //System.out.println(outcome);
         Assert.assertFalse(outcome);
     }
 
@@ -355,8 +357,10 @@ public class StringArrayUtilsTest {
     public void testRemoveConsecutiveDuplicates3() {
         String[] array = {"aba", "aba", "baa", "bab", "bba", "zzz", "bba", "bba", "bba", "aba", "bbb"};
         String[] actual = StringArrayUtils.removeConsecutiveDuplicates(array);
+        
+        System.out.println(Arrays.toString(actual));
         String[] expected = {"aba", "baa", "bab", "bba", "zzz", "bba", "aba", "bbb"};
-        Assert.assertEquals(actual, expected);
+        Assert.assertEquals(expected, actual);
     }
 
 

package.bluej

@@ -0,0 +1,42 @@
+#BlueJ package file
+dependency1.from=StringArrayUtilsTest
+dependency1.to=StringArrayUtils
+dependency1.type=UsesDependency
+editor.fx.0.height=800
+editor.fx.0.width=1280
+editor.fx.0.x=0
+editor.fx.0.y=0
+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=20
+package.editor.y=126
+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=30
+target1.y=0
+target2.height=50
+target2.name=StringArrayUtils
+target2.showInterface=false
+target2.type=ClassTarget
+target2.width=120
+target2.x=70
+target2.y=70