/** * Created by leon on 1/29/18. */ import java.util.Arrays; 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) { boolean answer = false; for(String arr: array) { if (arr.equals(value)){ answer = true; break; } } return answer; } /** * @param array of String objects * @return an array with identical contents in reverse order */ // TODO public static String[] reverse(String[] array) { String[] answer = new String[array.length]; int count = 0; for(int i = array.length - 1; i >= 0; i--){ answer[count] = array[i]; count++; } return answer; } /** * @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) { boolean answer = false; String[] flipped = reverse(array); if( Arrays.equals(array, flipped)){ answer = true;} return answer; } /** * @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[] alpha = {"a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"}; String bigString = ""; boolean result = true; //could be seperate method makeString(String[] arr) for(int i = 0; i 1 && array[i] == array[i+1]){ saveMe = saveMe; } else if(count == 0 && array[i] == array[i + 1] && i < array.length - 2){ count ++; saveMe = saveMe + array[i] + " "; }else if(array[i] != array[i -1]){ saveMe = saveMe + array[i] + " "; } } String[] answer = saveMe.split(" "); return answer; } /** * @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) { String saveMe = ""; for(int i = 0; i < array.length; i++){ saveMe = saveMe +array[i]; } String[]answer = saveMe.split("(?<=(.))(?!\\1)"); return answer; } }