|
|
@@ -1,4 +1,4 @@
|
|
1
|
|
-package treeSet;
|
|
|
1
|
+import java.util.TreeSet;
|
|
2
|
2
|
import java.util.ArrayList;
|
|
3
|
3
|
|
|
4
|
4
|
/**
|
|
|
@@ -92,11 +92,11 @@ public class StringArrayUtils {
|
|
92
|
92
|
int counter=0;
|
|
93
|
93
|
int i;
|
|
94
|
94
|
/*for(String e:array){
|
|
95
|
|
- if(e==(i = 'a';i <= 'z'));{
|
|
96
|
|
- counter++;}}
|
|
|
95
|
+ if(e==(i = 'a';i <= 'z'));{
|
|
|
96
|
+ counter++;}}
|
|
97
|
97
|
if(counter<26){
|
|
98
|
|
- return false;
|
|
99
|
|
- }return true;*/
|
|
|
98
|
+ return false;
|
|
|
99
|
+ }*/return true;
|
|
100
|
100
|
|
|
101
|
101
|
}
|
|
102
|
102
|
|
|
|
@@ -121,7 +121,7 @@ public class StringArrayUtils {
|
|
121
|
121
|
*/ // TODO
|
|
122
|
122
|
public static String[] removeValue(String[] array, String valueToRemove) {
|
|
123
|
123
|
ArrayList<String> remove = new ArrayList<String>();
|
|
124
|
|
- for(String e : array){
|
|
|
124
|
+ for(String e:array){
|
|
125
|
125
|
if(!e.equals(valueToRemove)){
|
|
126
|
126
|
remove.add(e);
|
|
127
|
127
|
}
|
|
|
@@ -134,14 +134,34 @@ public class StringArrayUtils {
|
|
134
|
134
|
* @return array of Strings with consecutive duplicates removes
|
|
135
|
135
|
*/ // TODO
|
|
136
|
136
|
public static String[] removeConsecutiveDuplicates(String[] array) {
|
|
137
|
|
- SortedSet<String> remove = new TreeSet<>(array);
|
|
138
|
|
- for(String e:remove){
|
|
139
|
|
- if(e==e){
|
|
140
|
|
- remove.remove(e);
|
|
141
|
|
- }
|
|
142
|
|
- }
|
|
|
137
|
+ // ArrayList<String> remove = new ArrayList<String>();
|
|
|
138
|
+ // for(String e:array){
|
|
|
139
|
+ // if(array[e] !=array[-1]){
|
|
|
140
|
+ // remove.removeAll();
|
|
|
141
|
+ // }
|
|
|
142
|
+ // }
|
|
|
143
|
+ // return remove.toArray(new String[remove.add()]);
|
|
|
144
|
+
|
|
|
145
|
+
|
|
|
146
|
+
|
|
|
147
|
+ //Code below is skipping on index value
|
|
|
148
|
+ // StringBuilder answerString = new StringBuilder();
|
|
|
149
|
+ // for(int i = 1; i < array.length; i++){
|
|
|
150
|
+ // if((array[i] != array[i-1]) && (i < array.length-1)){
|
|
|
151
|
+ // answerString.append(array[i-1] + "`");
|
|
|
152
|
+ // }else if (array[i] != array[i-1]){
|
|
|
153
|
+ // answerString.append(array[i] + "`");
|
|
|
154
|
+ // }
|
|
|
155
|
+ // }
|
|
|
156
|
+
|
|
|
157
|
+ // String answer = answerString.toString();
|
|
|
158
|
+ // String[] answerArray = answer.split("`");
|
|
|
159
|
+
|
|
|
160
|
+ // for(int i = 0; i < answerArray.length; i++){
|
|
|
161
|
+ // System.out.println(answerArray[i]);
|
|
|
162
|
+ // }
|
|
143
|
163
|
|
|
144
|
|
- return array;
|
|
|
164
|
+ // return answerArray;
|
|
145
|
165
|
}
|
|
146
|
166
|
|
|
147
|
167
|
/**
|