-
Notifications
You must be signed in to change notification settings - Fork 174
Expand file tree
/
Copy pathStringArrayUtils.java
More file actions
160 lines (135 loc) · 4.56 KB
/
StringArrayUtils.java
File metadata and controls
160 lines (135 loc) · 4.56 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
package com.zipcodewilmington;
import java.util.*;
/**
* 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) {
int lastIndex = array.length;
return array[lastIndex-1];
}
/**
* @param array array of String objects
* @return second to last element in specified array
*/ // TODO
public static String getSecondToLastElement(String[] array) {
int s2L = array.length - 2;
return array[s2L];
}
/**
* @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) {
ArrayList newArray = new ArrayList(Arrays.asList(array));
if (newArray.contains(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) {
ArrayList<String> newArray = new ArrayList(Arrays.asList(array));
Collections.reverse(newArray);
return newArray.toArray(new String[0]);
}
/**
* @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[] palindrome = reverse(array);
if (Arrays.equals(array, palindrome)){
return true;
}
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 stringArray = Arrays.toString(array).toLowerCase();
String alphabet = "abcdefghijklmnopqrstuvwxyz";
StringBuilder compareTo = new StringBuilder();
for (int i = 0; i < alphabet.length(); i++) {
for (int j = 0; j < stringArray.length(); j++) {
if (alphabet.charAt(i) == stringArray.charAt(j)){
compareTo.append(alphabet.charAt(i));
}
}
}
System.out.println(compareTo);
return false;
}
//
/**
* @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 numOfOccurences = 0;
for (String s : array) {
if (s == value) {
numOfOccurences++;
}
}
return numOfOccurences;
}
/**
* @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) {
ArrayList<String> newArray = new ArrayList(Arrays.asList(array));
newArray.remove(valueToRemove);
String[] editedArray = newArray.toArray(new String[0]);
return editedArray;
}
/**
* @param array array of chars
* @return array of Strings with consecutive duplicates removes
*/ // TODO
public static String[] removeConsecutiveDuplicates(String[] array) {
ArrayList<String> editList = new ArrayList<>();
String newElement = "";
for (String element: array){
if (element != newElement){
editList.add(element);
}
newElement = element;
}
return editList.toArray(new String[0]);
}
/**
* @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;
}
}