|
|
@@ -1,5 +1,4 @@
|
|
1
|
|
-
|
|
2
|
|
-
|
|
|
1
|
+import java.util.Arrays;
|
|
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 null;
|
|
|
11
|
+ return array[0];
|
|
13
|
12
|
}
|
|
14
|
13
|
|
|
15
|
14
|
/**
|
|
|
@@ -17,7 +16,7 @@ public class StringArrayUtils {
|
|
17
|
16
|
* @return second element in specified array
|
|
18
|
17
|
*/
|
|
19
|
18
|
public static String getSecondElement(String[] array) {
|
|
20
|
|
- return null;
|
|
|
19
|
+ return array[1];
|
|
21
|
20
|
}
|
|
22
|
21
|
|
|
23
|
22
|
/**
|
|
|
@@ -25,7 +24,7 @@ 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
|
+ return array[array.length-1];
|
|
29
|
28
|
}
|
|
30
|
29
|
|
|
31
|
30
|
/**
|
|
|
@@ -33,7 +32,7 @@ public class StringArrayUtils {
|
|
33
|
32
|
* @return second to last element in specified array
|
|
34
|
33
|
*/ // TODO
|
|
35
|
34
|
public static String getSecondToLastElement(String[] array) {
|
|
36
|
|
- return null;
|
|
|
35
|
+ return array[array.length-2];
|
|
37
|
36
|
}
|
|
38
|
37
|
|
|
39
|
38
|
/**
|
|
|
@@ -42,7 +41,13 @@ public class StringArrayUtils {
|
|
42
|
41
|
* @return true if the array contains the specified `value`
|
|
43
|
42
|
*/ // TODO
|
|
44
|
43
|
public static boolean contains(String[] array, String value) {
|
|
45
|
|
- return false;
|
|
|
44
|
+ boolean containsString = false;
|
|
|
45
|
+ for (String element : array)
|
|
|
46
|
+ if(element.equals(value)){
|
|
|
47
|
+ containsString = true;
|
|
|
48
|
+ break;
|
|
|
49
|
+ }
|
|
|
50
|
+ return containsString;
|
|
46
|
51
|
}
|
|
47
|
52
|
|
|
48
|
53
|
/**
|
|
|
@@ -50,7 +55,11 @@ public class StringArrayUtils {
|
|
50
|
55
|
* @return an array with identical contents in reverse order
|
|
51
|
56
|
*/ // TODO
|
|
52
|
57
|
public static String[] reverse(String[] array) {
|
|
53
|
|
- return null;
|
|
|
58
|
+ String[] reverseString = new String[array.length];
|
|
|
59
|
+ for(int i = 0; i < array.length; i++){
|
|
|
60
|
+ reverseString [array.length-1-i] = array[i];
|
|
|
61
|
+ }
|
|
|
62
|
+ return reverseString;
|
|
54
|
63
|
}
|
|
55
|
64
|
|
|
56
|
65
|
/**
|
|
|
@@ -58,15 +67,51 @@ public class StringArrayUtils {
|
|
58
|
67
|
* @return true if the order of the array is the same backwards and forwards
|
|
59
|
68
|
*/ // TODO
|
|
60
|
69
|
public static boolean isPalindromic(String[] array) {
|
|
61
|
|
- return false;
|
|
|
70
|
+ String[] reverseString = reverse(array);
|
|
|
71
|
+ boolean isTrue = false;
|
|
|
72
|
+ if(Arrays.equals(reverseString, array)){
|
|
|
73
|
+ return true;
|
|
|
74
|
+ }
|
|
|
75
|
+ return isTrue;
|
|
62
|
76
|
}
|
|
63
|
77
|
|
|
64
|
78
|
/**
|
|
65
|
79
|
* @param array array of String objects
|
|
66
|
80
|
* @return true if each letter in the alphabet has been used in the array
|
|
67
|
81
|
*/ // TODO
|
|
68
|
|
- public static boolean isPangramic(String[] array) {
|
|
69
|
|
- return false;
|
|
|
82
|
+
|
|
|
83
|
+ public static boolean isPangramic(String[] array){
|
|
|
84
|
+ char [] alphabet = {'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};
|
|
|
85
|
+ boolean containsEveryLetter = true;
|
|
|
86
|
+ for(char letter:alphabet){
|
|
|
87
|
+ if(arrayContainsLetter(array,letter)==false){
|
|
|
88
|
+ containsEveryLetter = false;
|
|
|
89
|
+ break;
|
|
|
90
|
+ }
|
|
|
91
|
+ }
|
|
|
92
|
+ return containsEveryLetter;
|
|
|
93
|
+ }
|
|
|
94
|
+
|
|
|
95
|
+ public static boolean arrayContainsLetter(String[] array, char letter){
|
|
|
96
|
+ boolean containsLetter = false;
|
|
|
97
|
+ for(String string : array){
|
|
|
98
|
+ if(stringContainsLetter(string.toLowerCase(),letter)){
|
|
|
99
|
+ containsLetter = true;
|
|
|
100
|
+ break;
|
|
|
101
|
+ }
|
|
|
102
|
+ }
|
|
|
103
|
+ return containsLetter;
|
|
|
104
|
+ }
|
|
|
105
|
+
|
|
|
106
|
+ public static boolean stringContainsLetter(String string, char letter){
|
|
|
107
|
+ boolean containsLetter = false;
|
|
|
108
|
+ for(int i = 0; i < string.length(); i++){
|
|
|
109
|
+ if (string.charAt(i)==letter){
|
|
|
110
|
+ containsLetter = true;
|
|
|
111
|
+ break;
|
|
|
112
|
+ }
|
|
|
113
|
+ }
|
|
|
114
|
+ return containsLetter;
|
|
70
|
115
|
}
|
|
71
|
116
|
|
|
72
|
117
|
/**
|
|
|
@@ -75,16 +120,31 @@ public class StringArrayUtils {
|
|
75
|
120
|
* @return number of occurrences the specified `value` has occurred
|
|
76
|
121
|
*/ // TODO
|
|
77
|
122
|
public static int getNumberOfOccurrences(String[] array, String value) {
|
|
78
|
|
- return 0;
|
|
|
123
|
+ int counter = 0;
|
|
|
124
|
+ for (String element : array){
|
|
|
125
|
+ if(element.equals(value)){
|
|
|
126
|
+ counter += 1;
|
|
|
127
|
+ }
|
|
|
128
|
+ }
|
|
|
129
|
+ return counter;
|
|
79
|
130
|
}
|
|
80
|
131
|
|
|
81
|
132
|
/**
|
|
82
|
|
- * @param array array of String objects
|
|
|
133
|
+ * @param array array of String objects
|
|
83
|
134
|
* @param valueToRemove value to remove from array
|
|
84
|
135
|
* @return array with identical contents excluding values of `value`
|
|
85
|
136
|
*/ // TODO
|
|
86
|
137
|
public static String[] removeValue(String[] array, String valueToRemove) {
|
|
87
|
|
- return null;
|
|
|
138
|
+ int lengthOfNewArray = array.length-getNumberOfOccurrences(array,valueToRemove);
|
|
|
139
|
+ String[] newArray = new String[lengthOfNewArray];
|
|
|
140
|
+ int index = 0;
|
|
|
141
|
+ for(String element : array){
|
|
|
142
|
+ if(element != valueToRemove){
|
|
|
143
|
+ newArray[index] = element;
|
|
|
144
|
+ index += 1;
|
|
|
145
|
+ }
|
|
|
146
|
+ }
|
|
|
147
|
+ return newArray;
|
|
88
|
148
|
}
|
|
89
|
149
|
|
|
90
|
150
|
/**
|
|
|
@@ -92,16 +152,23 @@ public class StringArrayUtils {
|
|
92
|
152
|
* @return array of Strings with consecutive duplicates removes
|
|
93
|
153
|
*/ // TODO
|
|
94
|
154
|
public static String[] removeConsecutiveDuplicates(String[] array) {
|
|
95
|
|
- return null;
|
|
96
|
|
- }
|
|
97
|
|
-
|
|
98
|
|
- /**
|
|
99
|
|
- * @param array array of chars
|
|
100
|
|
- * @return array of Strings with each consecutive duplicate occurrence concatenated as a single string in an array of Strings
|
|
101
|
|
- */ // TODO
|
|
102
|
|
- public static String[] packConsecutiveDuplicates(String[] array) {
|
|
103
|
|
- return null;
|
|
|
155
|
+ String[] sortedArray = array.sort();
|
|
|
156
|
+
|
|
|
157
|
+ for(int i = 1; i < sortedArray.length; i++){
|
|
|
158
|
+ if(sortedArray[i]!=sortedArray[i-1]){
|
|
|
159
|
+ add to array list
|
|
|
160
|
+ }
|
|
|
161
|
+ }
|
|
104
|
162
|
}
|
|
|
163
|
+ return null;
|
|
|
164
|
+}
|
|
105
|
165
|
|
|
|
166
|
+/**
|
|
|
167
|
+ * @param array array of chars
|
|
|
168
|
+ * @return array of Strings with each consecutive duplicate occurrence concatenated as a single string in an array of Strings
|
|
|
169
|
+ */ // TODO
|
|
|
170
|
+public static String[] packConsecutiveDuplicates(String[] array) {
|
|
|
171
|
+return null;
|
|
|
172
|
+}
|
|
106
|
173
|
|
|
107
|
174
|
}
|