|
|
@@ -1,5 +1,4 @@
|
|
1
|
|
-
|
|
2
|
|
-
|
|
|
1
|
+import java.util.*;
|
|
3
|
2
|
/**
|
|
4
|
3
|
* Created by leon on 1/29/18.
|
|
5
|
4
|
*/
|
|
|
@@ -9,7 +8,7 @@ public class StringArrayUtils {
|
|
9
|
8
|
* @return first element of specified array
|
|
10
|
9
|
*/ // TODO
|
|
11
|
10
|
public static String getFirstElement(String[] array) {
|
|
12
|
|
- return array[0];
|
|
|
11
|
+ return array[0];
|
|
13
|
12
|
}
|
|
14
|
13
|
|
|
15
|
14
|
/**
|
|
|
@@ -25,7 +24,8 @@ public class StringArrayUtils {
|
|
25
|
24
|
* @return last element in specified array
|
|
26
|
25
|
*/ // TODO
|
|
27
|
26
|
public static String getLastElement(String[] array) {
|
|
28
|
|
- return null;
|
|
|
27
|
+ String lastStr = array[array.length - 1];
|
|
|
28
|
+ return lastStr;
|
|
29
|
29
|
}
|
|
30
|
30
|
|
|
31
|
31
|
/**
|
|
|
@@ -33,7 +33,8 @@ public class StringArrayUtils {
|
|
33
|
33
|
* @return second to last element in specified array
|
|
34
|
34
|
*/ // TODO
|
|
35
|
35
|
public static String getSecondToLastElement(String[] array) {
|
|
36
|
|
- return null;
|
|
|
36
|
+ String lastStr = array[array.length - 2];
|
|
|
37
|
+ return lastStr;
|
|
37
|
38
|
}
|
|
38
|
39
|
|
|
39
|
40
|
/**
|
|
|
@@ -42,6 +43,12 @@ public class StringArrayUtils {
|
|
42
|
43
|
* @return true if the array contains the specified `value`
|
|
43
|
44
|
*/ // TODO
|
|
44
|
45
|
public static boolean contains(String[] array, String value) {
|
|
|
46
|
+ for (int i = 0; i < array.length; i++){
|
|
|
47
|
+ if (array[i] == value) {
|
|
|
48
|
+ String result = array[i];
|
|
|
49
|
+ }
|
|
|
50
|
+ return true;
|
|
|
51
|
+ }
|
|
45
|
52
|
return false;
|
|
46
|
53
|
}
|
|
47
|
54
|
|
|
|
@@ -50,7 +57,12 @@ public class StringArrayUtils {
|
|
50
|
57
|
* @return an array with identical contents in reverse order
|
|
51
|
58
|
*/ // TODO
|
|
52
|
59
|
public static String[] reverse(String[] array) {
|
|
53
|
|
- return null;
|
|
|
60
|
+ for (int i = 0; i < array.length/2; i++){
|
|
|
61
|
+ String temp = array[i];
|
|
|
62
|
+ array[i] = array[array.length - i - 1];
|
|
|
63
|
+ array[array.length - i - 1] = temp;
|
|
|
64
|
+ }
|
|
|
65
|
+ return array;
|
|
54
|
66
|
}
|
|
55
|
67
|
|
|
56
|
68
|
/**
|
|
|
@@ -58,7 +70,17 @@ public class StringArrayUtils {
|
|
58
|
70
|
* @return true if the order of the array is the same backwards and forwards
|
|
59
|
71
|
*/ // TODO
|
|
60
|
72
|
public static boolean isPalindromic(String[] array) {
|
|
61
|
|
- return false;
|
|
|
73
|
+ int i1 = 0;
|
|
|
74
|
+ int i2 = array.length - 1;
|
|
|
75
|
+ while (i2 > i1) {
|
|
|
76
|
+ if (array[i1] != array[i2]) {
|
|
|
77
|
+ return false;
|
|
|
78
|
+ }
|
|
|
79
|
+ ++i1;
|
|
|
80
|
+ --i2;
|
|
|
81
|
+ }
|
|
|
82
|
+ return true;
|
|
|
83
|
+
|
|
62
|
84
|
}
|
|
63
|
85
|
|
|
64
|
86
|
/**
|
|
|
@@ -66,7 +88,21 @@ public class StringArrayUtils {
|
|
66
|
88
|
* @return true if each letter in the alphabet has been used in the array
|
|
67
|
89
|
*/ // TODO
|
|
68
|
90
|
public static boolean isPangramic(String[] array) {
|
|
69
|
|
- return false;
|
|
|
91
|
+ boolean bool = true;
|
|
|
92
|
+ for (char letter = 'a'; letter <= 'z'; letter++){
|
|
|
93
|
+ boolean bool2 = false;
|
|
|
94
|
+
|
|
|
95
|
+ for (int i = 0; i < array.length; i++){
|
|
|
96
|
+ if (array[i].toLowerCase().contains(Character.toString(letter))){
|
|
|
97
|
+ bool2 = true;
|
|
|
98
|
+ }
|
|
|
99
|
+ }
|
|
|
100
|
+ if (!bool2) {
|
|
|
101
|
+ bool = false;
|
|
|
102
|
+ }
|
|
|
103
|
+ }
|
|
|
104
|
+
|
|
|
105
|
+ return bool;
|
|
70
|
106
|
}
|
|
71
|
107
|
|
|
72
|
108
|
/**
|
|
|
@@ -75,7 +111,14 @@ public class StringArrayUtils {
|
|
75
|
111
|
* @return number of occurrences the specified `value` has occurred
|
|
76
|
112
|
*/ // TODO
|
|
77
|
113
|
public static int getNumberOfOccurrences(String[] array, String value) {
|
|
78
|
|
- return 0;
|
|
|
114
|
+ int counter = 0;
|
|
|
115
|
+ for (String word : array) {
|
|
|
116
|
+ if (value.equals(word)){
|
|
|
117
|
+ counter++;
|
|
|
118
|
+ }
|
|
|
119
|
+ }
|
|
|
120
|
+
|
|
|
121
|
+ return counter;
|
|
79
|
122
|
}
|
|
80
|
123
|
|
|
81
|
124
|
/**
|
|
|
@@ -84,7 +127,10 @@ public class StringArrayUtils {
|
|
84
|
127
|
* @return array with identical contents excluding values of `value`
|
|
85
|
128
|
*/ // TODO
|
|
86
|
129
|
public static String[] removeValue(String[] array, String valueToRemove) {
|
|
87
|
|
- return null;
|
|
|
130
|
+ ArrayList<String> strArr = new ArrayList<String> (Arrays.asList(array));
|
|
|
131
|
+ strArr.remove(valueToRemove);
|
|
|
132
|
+ String[] newArr = strArr.toArray(new String[strArr.size()]);
|
|
|
133
|
+ return newArr;
|
|
88
|
134
|
}
|
|
89
|
135
|
|
|
90
|
136
|
/**
|
|
|
@@ -92,7 +138,27 @@ public class StringArrayUtils {
|
|
92
|
138
|
* @return array of Strings with consecutive duplicates removes
|
|
93
|
139
|
*/ // TODO
|
|
94
|
140
|
public static String[] removeConsecutiveDuplicates(String[] array) {
|
|
95
|
|
- return null;
|
|
|
141
|
+ int duplicate = 0;
|
|
|
142
|
+ int counter = 0;
|
|
|
143
|
+
|
|
|
144
|
+ for (int i = 0; i < array.length - 1 ; i++){
|
|
|
145
|
+ if (array[i].equals(array[i+1])){
|
|
|
146
|
+ counter++;
|
|
|
147
|
+ }
|
|
|
148
|
+ }
|
|
|
149
|
+
|
|
|
150
|
+ String[] newArr = new String[array.length - counter];
|
|
|
151
|
+ String str = null;
|
|
|
152
|
+
|
|
|
153
|
+ for (int i = 0; i < array.length; i++){
|
|
|
154
|
+ if(!array[i].equals(str)){
|
|
|
155
|
+ newArr[duplicate] = array[i];
|
|
|
156
|
+ str = array[i];
|
|
|
157
|
+ duplicate++;
|
|
|
158
|
+
|
|
|
159
|
+ }
|
|
|
160
|
+ }
|
|
|
161
|
+ return newArr;
|
|
96
|
162
|
}
|
|
97
|
163
|
|
|
98
|
164
|
/**
|
|
|
@@ -100,8 +166,35 @@ public class StringArrayUtils {
|
|
100
|
166
|
* @return array of Strings with each consecutive duplicate occurrence concatenated as a single string in an array of Strings
|
|
101
|
167
|
*/ // TODO
|
|
102
|
168
|
public static String[] packConsecutiveDuplicates(String[] array) {
|
|
103
|
|
- return null;
|
|
104
|
|
- }
|
|
|
169
|
+ int counter = getCounter(array);
|
|
|
170
|
+ String[] result = new String[array.length - counter];
|
|
|
171
|
+ String last = array[0];
|
|
|
172
|
+ result[0] = array[0];
|
|
|
173
|
+ int index = 0;
|
|
105
|
174
|
|
|
|
175
|
+ for (int i = 1; i < array.length; i++){
|
|
|
176
|
+ if (array[i].equals(last)){
|
|
|
177
|
+ result[index] += array[i];
|
|
|
178
|
+ last = array[i];
|
|
|
179
|
+ }
|
|
|
180
|
+ else {
|
|
|
181
|
+ index++;
|
|
|
182
|
+ result[index] = array[i];
|
|
|
183
|
+ last = array[i];
|
|
|
184
|
+ }
|
|
|
185
|
+ }
|
|
106
|
186
|
|
|
|
187
|
+ return result;
|
|
|
188
|
+ }
|
|
|
189
|
+
|
|
|
190
|
+ public static int getCounter(String[] array){
|
|
|
191
|
+ int counter = 0;
|
|
|
192
|
+ for(int i = 0; i < array.length - 1; i++){
|
|
|
193
|
+ if(array[i].equals(array[i+1])){
|
|
|
194
|
+ counter++;
|
|
|
195
|
+ }
|
|
|
196
|
+ }
|
|
|
197
|
+ return counter;
|
|
|
198
|
+ }
|
|
107
|
199
|
}
|
|
|
200
|
+
|