|
|
@@ -166,6 +166,7 @@ public class StringArrayUtils {
|
|
166
|
166
|
}
|
|
167
|
167
|
}
|
|
168
|
168
|
revisedArr[revisedArr.length-1]=array[array.length-1];
|
|
|
169
|
+
|
|
169
|
170
|
return revisedArr;
|
|
170
|
171
|
}
|
|
171
|
172
|
|
|
|
@@ -185,7 +186,30 @@ public class StringArrayUtils {
|
|
185
|
186
|
* @return array of Strings with each consecutive duplicate occurrence concatenated as a single string in an array of Strings
|
|
186
|
187
|
*/ // TODO
|
|
187
|
188
|
public static String[] packConsecutiveDuplicates(String[] array) {
|
|
188
|
|
- return null;
|
|
|
189
|
+ //int dupes = countDuplicates(array);
|
|
|
190
|
+ //String[] revisedArr = new String[array.length-dupes];
|
|
|
191
|
+
|
|
|
192
|
+ StringBuilder full = new StringBuilder();
|
|
|
193
|
+ full.append(array[0]);
|
|
|
194
|
+ //revisedArr[0]=array[0];
|
|
|
195
|
+
|
|
|
196
|
+ StringBuilder temp = new StringBuilder();
|
|
|
197
|
+ for(int i = 1; i < array.length; i++) {
|
|
|
198
|
+
|
|
|
199
|
+ if(array[i].equals(array[i-1])) {
|
|
|
200
|
+ full.append(array[i]);
|
|
|
201
|
+ //temp.append(array[i]);
|
|
|
202
|
+ } else {
|
|
|
203
|
+ full.append(" ");
|
|
|
204
|
+ full.append(array[i]);
|
|
|
205
|
+ //revisedArr[i]=temp.toString();
|
|
|
206
|
+ //temp.setLength(0);
|
|
|
207
|
+ }
|
|
|
208
|
+ }
|
|
|
209
|
+ //String[] cleanPack = full.toString();
|
|
|
210
|
+ String[] cleanPack = full.toString().split(" ");
|
|
|
211
|
+ return cleanPack;
|
|
|
212
|
+ //return revisedArr;
|
|
189
|
213
|
}
|
|
190
|
214
|
|
|
191
|
215
|
}
|