|
|
@@ -1,4 +1,4 @@
|
|
1
|
|
-import java.util.Arrays;
|
|
|
1
|
+import java.util.*;
|
|
2
|
2
|
|
|
3
|
3
|
/**
|
|
4
|
4
|
* Created by leon on 1/29/18.
|
|
|
@@ -24,8 +24,8 @@ public class StringArrayUtils {
|
|
24
|
24
|
* @param array array of String objects
|
|
25
|
25
|
* @return last element in specified array
|
|
26
|
26
|
*/ // TODO
|
|
27
|
|
- public static String getLastElement(String[] array) {
|
|
28
|
|
- return array[array.length - 1];
|
|
|
27
|
+ public static String getLastElement(String[] array) {
|
|
|
28
|
+ return array[array.length-1];
|
|
29
|
29
|
}
|
|
30
|
30
|
|
|
31
|
31
|
/**
|
|
|
@@ -41,16 +41,17 @@ public class StringArrayUtils {
|
|
41
|
41
|
* @param value value to check array for
|
|
42
|
42
|
* @return true if the array contains the specified `value`
|
|
43
|
43
|
*/ // TODO
|
|
44
|
|
- public static boolean contains(String[] array, String value) {
|
|
|
44
|
+ public static boolean contains(String[] array, String value) {
|
|
45
|
45
|
|
|
46
|
46
|
for(String x : array) {
|
|
47
|
|
- if(value == x) {
|
|
|
47
|
+ if(value.equals(x)) {
|
|
48
|
48
|
return true;
|
|
49
|
49
|
}
|
|
50
|
50
|
}
|
|
51
|
51
|
return false;
|
|
52
|
52
|
}
|
|
53
|
53
|
|
|
|
54
|
+
|
|
54
|
55
|
/**
|
|
55
|
56
|
* @param array of String objects
|
|
56
|
57
|
* @return an array with identical contents in reverse order
|
|
|
@@ -59,7 +60,7 @@ public class StringArrayUtils {
|
|
59
|
60
|
|
|
60
|
61
|
String[] reverseArr = new String[array.length];
|
|
61
|
62
|
|
|
62
|
|
- for(int i=0; i<array.length; i++){
|
|
|
63
|
+ for(int i = 0; i < array.length; i++){
|
|
63
|
64
|
reverseArr[i] = array[array.length - i - 1];
|
|
64
|
65
|
}
|
|
65
|
66
|
return reverseArr;
|
|
|
@@ -74,33 +75,60 @@ public class StringArrayUtils {
|
|
74
|
75
|
String[] reverseArr = reverse(array);
|
|
75
|
76
|
String[] regArr = new String[array.length];
|
|
76
|
77
|
|
|
77
|
|
- for(int i=0; i<array.length; i++){
|
|
78
|
|
- regArr[i] = array[i];
|
|
79
|
|
- }
|
|
80
|
|
-
|
|
81
|
|
- if(regArr == reverseArr) {
|
|
82
|
|
- return true;
|
|
83
|
|
- }
|
|
|
78
|
+ for(int i= 0; i < array.length; i++){
|
|
|
79
|
+ regArr[i] = array[i];
|
|
|
80
|
+ if(regArr[i] == reverseArr[i]) {
|
|
|
81
|
+ return true;
|
|
|
82
|
+ }
|
|
|
83
|
+ }
|
|
84
|
84
|
return false;
|
|
85
|
85
|
}
|
|
86
|
86
|
|
|
87
|
|
-
|
|
88
|
|
-
|
|
89
|
87
|
/**
|
|
90
|
88
|
* @param array array of String objects
|
|
91
|
89
|
* @return true if each letter in the alphabet has been used in the array
|
|
92
|
90
|
*/ // TODO
|
|
93
|
91
|
public static boolean isPangramic(String[] array) {
|
|
94
|
|
- return false;
|
|
|
92
|
+ String alphabet = "abcdefghijklmnopqrstuvwxyz";
|
|
|
93
|
+ String fullCombinedString = String.join("", array).toLowerCase();
|
|
|
94
|
+ for(char c : alphabet.toCharArray()) {
|
|
|
95
|
+ if(fullCombinedString.indexOf(c) < 0) {
|
|
|
96
|
+ return false;
|
|
|
97
|
+ }
|
|
|
98
|
+ }
|
|
|
99
|
+ return true;
|
|
|
100
|
+
|
|
|
101
|
+
|
|
|
102
|
+ /*
|
|
|
103
|
+ for(char c : alphabet.toCharArray()) {
|
|
|
104
|
+ boolean found = false;
|
|
|
105
|
+ for(String word : array) {
|
|
|
106
|
+ word = word.toLowerCase();
|
|
|
107
|
+ if(word.indexOf(c) >= 0)
|
|
|
108
|
+ found = true;
|
|
|
109
|
+ break;
|
|
|
110
|
+ }
|
|
|
111
|
+ if(!found) {
|
|
|
112
|
+ return false;
|
|
|
113
|
+ }
|
|
|
114
|
+ }
|
|
|
115
|
+ return true;*/
|
|
95
|
116
|
}
|
|
96
|
117
|
|
|
|
118
|
+
|
|
97
|
119
|
/**
|
|
98
|
120
|
* @param array array of String objects
|
|
99
|
121
|
* @param value value to check array for
|
|
100
|
122
|
* @return number of occurrences the specified `value` has occurred
|
|
101
|
123
|
*/ // TODO
|
|
102
|
124
|
public static int getNumberOfOccurrences(String[] array, String value) {
|
|
103
|
|
- return 0;
|
|
|
125
|
+ int count = 0;
|
|
|
126
|
+ for(String s : array) {
|
|
|
127
|
+ if(s == value) {
|
|
|
128
|
+ count++;
|
|
|
129
|
+ }
|
|
|
130
|
+ }
|
|
|
131
|
+ return count;
|
|
104
|
132
|
}
|
|
105
|
133
|
|
|
106
|
134
|
/**
|
|
|
@@ -109,7 +137,14 @@ public class StringArrayUtils {
|
|
109
|
137
|
* @return array with identical contents excluding values of `value`
|
|
110
|
138
|
*/ // TODO
|
|
111
|
139
|
public static String[] removeValue(String[] array, String valueToRemove) {
|
|
112
|
|
- return null;
|
|
|
140
|
+ List<String> newArray = new ArrayList<>();
|
|
|
141
|
+
|
|
|
142
|
+ for(String s : array) {
|
|
|
143
|
+ if(s != valueToRemove) {
|
|
|
144
|
+ newArray.add(s);
|
|
|
145
|
+ }
|
|
|
146
|
+ }
|
|
|
147
|
+ return newArray.toArray(new String[] {});
|
|
113
|
148
|
}
|
|
114
|
149
|
|
|
115
|
150
|
/**
|
|
|
@@ -117,18 +152,46 @@ public class StringArrayUtils {
|
|
117
|
152
|
* @return array of Strings with consecutive duplicates removes
|
|
118
|
153
|
*/ // TODO
|
|
119
|
154
|
public static String[] removeConsecutiveDuplicates(String[] array) {
|
|
|
155
|
+ List<String> newArray = new ArrayList<>();
|
|
120
|
156
|
|
|
|
157
|
+ for(int i = 0; i < array.length; i++) {
|
|
|
158
|
+ String added = array[i];
|
|
|
159
|
+ newArray.add(added);
|
|
|
160
|
+ int toRemove = 0;
|
|
|
161
|
+
|
|
|
162
|
+ for(; toRemove + i + 1 < array.length; toRemove++) {
|
|
|
163
|
+ if(array[i + 1 + toRemove] != added){
|
|
|
164
|
+ break;
|
|
|
165
|
+ }
|
|
|
166
|
+ }
|
|
|
167
|
+ i += toRemove;
|
|
|
168
|
+ }
|
|
|
169
|
+ return newArray.toArray(new String[] {});
|
|
|
170
|
+}
|
|
121
|
171
|
|
|
122
|
|
-
|
|
123
|
|
- return null;
|
|
124
|
|
- }
|
|
125
|
|
-
|
|
126
|
172
|
/**
|
|
127
|
173
|
* @param array array of chars
|
|
128
|
174
|
* @return array of Strings with each consecutive duplicate occurrence concatenated as a single string in an array of Strings
|
|
129
|
175
|
*/ // TODO
|
|
130
|
176
|
public static String[] packConsecutiveDuplicates(String[] array) {
|
|
131
|
|
- return null;
|
|
|
177
|
+ List<String> newArray = new ArrayList<>();
|
|
|
178
|
+
|
|
|
179
|
+ for(int i = 0; i < array.length; i++) {
|
|
|
180
|
+ String added = array[i];
|
|
|
181
|
+ String toAdd = added;
|
|
|
182
|
+ int toRemove = 0;
|
|
|
183
|
+
|
|
|
184
|
+ for(; toRemove + i + 1 < array.length; toRemove++) {
|
|
|
185
|
+ if(array[i + 1 + toRemove] != added){
|
|
|
186
|
+ break;
|
|
|
187
|
+ }
|
|
|
188
|
+ toAdd += array[i + 1 + toRemove];
|
|
|
189
|
+ }
|
|
|
190
|
+ newArray.add(toAdd);
|
|
|
191
|
+ i += toRemove;
|
|
|
192
|
+ }
|
|
|
193
|
+ System.out.println(Arrays.toString(newArray.toArray()));
|
|
|
194
|
+ return newArray.toArray(new String[] {});
|
|
132
|
195
|
}
|
|
133
|
196
|
|
|
134
|
197
|
|