123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149 |
- import java.util.Arrays;
-
- /**
- * 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) {
- boolean answer = false;
- for (String string : array) {
- if (string.equalsIgnoreCase(value));
- answer = true;
- }
- 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];
-
- for (int i = 0; i< array.length; i++)
- answer[i] = array[array.length-1-i];
-
- 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;
- for (int i = 0; i < array.length; i++)
- if (Arrays.equals(array, reverse(array))){
- 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) {
-
- boolean isPangramic = false;
- for (char i = 'A' ; i <= 'Z'; i++)
- if (Arrays.toString(array).indexOf(i) < 0 && (Arrays.toString(array).indexOf((char) i +32) < 0)) {
- isPangramic = false;
- break;
- } else {
- isPangramic = true;
- }
-
- return isPangramic;
- }
-
- /**
- * @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 count = 0;
- for (String s: array) {
- if (value.equals(s)) {
- count ++;
- }
- }
- return count;
- }
-
- /**
- * @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 index = 0;
- int count = getNumberOfOccurrences(array, valueToRemove);
- String[] newArray = new String[array.length-count];
- for (int i = 0; i < array.length; i++) {
- if (array[i] != valueToRemove) {
- newArray[index] = array[i];
- index++;
- }
- }
- return newArray;
- }
-
- /**
- * @param array array of chars
- * @return array of Strings with consecutive duplicates removes
- */ // TODO
- public static String[] removeConsecutiveDuplicates(String[] array) {
-
- return null;
- }
-
- /**
- * @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;
- }
-
- }
|