-
Notifications
You must be signed in to change notification settings - Fork 174
Expand file tree
/
Copy pathStringArrayUtils.java
More file actions
206 lines (182 loc) · 6.89 KB
/
StringArrayUtils.java
File metadata and controls
206 lines (182 loc) · 6.89 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
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
package com.zipcodewilmington;
import com.sun.xml.internal.fastinfoset.util.StringArray;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.List;
/**
* 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 checker = false;
for (String arrayValue : array) {
if (arrayValue == value) {
checker = true;
break;
}
}
return checker;
}
/**
* @param array of String objects
* @return an array with identical contents in reverse order
*/ // TODO
public static String[] reverse(String[] array) {
String[] reverseArray = new String[array.length];
int index = 0;
for (int i = reverseArray.length - 1; i >= 0; i--) {
reverseArray[index++] = array[i];
}
return reverseArray;
}
// List<String> arrayList = Arrays.asList(array);
// Collections.reverse(arrayList);
// String[] reverseArrayList = arrayList.toArray(array);
// return reverseArrayList;
// }
/**
* @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[] reverseArray = new String[array.length];
int index = 0;
for (int i = array.length - 1; i >= 0; i--) {
reverseArray[index++] = array[i];
}
if (!Arrays.equals(reverseArray, array)) {
return false;
} else {
return true;
}
}
/**
* @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); //change array to string
if (stringArray.toLowerCase().length() < 26) { //check to see if array length is less than number of alphabets
return false; // if so return false and no further action
} else {
for (char index = 'a'; index <= 'z'; index++) { // iterate through characters from a - z
if (stringArray.toLowerCase().indexOf(index) < 0) { //if the index of character is less than 0 return false
// and it will fail the conditons of a panagram.
return false; //toLowerCase to make all characters even.
}
}
return true;
}
}
// List<String> arrayList = new ArrayList<String>();
// String string = "";
// for (String value: arrayList) {
// if(!string.contains(value)) {
// return false;
// }
// }
// return true;
// }
/**
* @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 tracker = 0;
for (int i = 0; i < array.length; i++) {
if (value.equals(array[i])) {
tracker++;
}
}
return tracker;
}
/**
* @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) {
List<String> arrayList = new ArrayList<String>(Arrays.asList(array)); //created new arrayList from string array
arrayList.remove(valueToRemove); //remove the valueToRemove from new arrayList
return array = arrayList.toArray(new String[0]); // return back to array the newList without removed value
}
// String stringArray = Arrays.toString(array);
// String newString = stringArray.replaceAll(valueToRemove, "");
// return new String[]{newString};
//}
/**
* @param array array of chars
* @return array of Strings with consecutive duplicates removes
*/ // TODO
public static String[] removeConsecutiveDuplicates(String[] array) {
List<String> arrayList = new ArrayList<String>();
arrayList.add(array[0]); //adds first value of array to newArray
for (int i = 1; i < array.length; i++) { //iterates through array starting at index 1
if (!array[i].equals(array[i - 1])) { //checks if current value is equal to previous value
arrayList.add(array[i]); //if not add that to the new arrayLst
}
}
return arrayList.toArray(new String[0]); //changing newArray to return as an Array of strings.
}
/**
* @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) {
//Arrays.sort(array);
ArrayList<String> arrayList = new ArrayList<String>();
arrayList.add(array[0]);
int tracker = 0;
for (int i = 1; i < array.length; i++) {
if (arrayList.get(tracker).contains(array[i])) {
arrayList.set(tracker, (arrayList.get(tracker) + array[i]));
} else {
tracker++;
arrayList.add(array[i]);
}
}
return arrayList.toArray(new String[0]);
}
}
// for (int i = 0; i < array.length - 1; i++) {
// for (int j = i+1; j < array.length; j++) {
// if(array[i].equals(array[j]) && (i != j)) {
// return array = arrayList.toArray(new String[0]);
// }
// }
// }