ZCW-Arrays-StringArrayUtilities-BlueJ/StringArrayUtils.java

/**
 * 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 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(int i =0; i<array.length; i++){
            if (array[i].equals(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) {
        
        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;
    }

    /**
     * @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) {
        // 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){
        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;
    }

    /**
     * @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 numberOfOccurances =0;
        for(int i=0; i<array.length; i++){
            if (array[i] == value){
                numberOfOccurances++;
            }
        }
        return numberOfOccurances;
    }

    /**
     * @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) {
        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;
    }

    /**
     * @param array array of chars
     * @return array of Strings with consecutive duplicates removes
     */ // TODO
    public static String[] removeConsecutiveDuplicates(String[] array) {
        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;

    }

    /**
     * @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) {
        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;
    }

}