|
|
@@ -91,28 +91,28 @@ public class StringArrayUtils {
|
|
91
|
91
|
public static boolean isPangramic(String[] array) {
|
|
92
|
92
|
|
|
93
|
93
|
String alpha = "abcdefghijklmnopqrstuvwxyz";
|
|
94
|
|
- String original = Arrays.toString(array).replace(" ", "").toLowerCase();
|
|
95
|
|
- original.replace(",", "");
|
|
|
94
|
+ String original = Arrays.toString(array).toLowerCase();
|
|
|
95
|
+ String newAlpha = "";
|
|
96
|
96
|
|
|
97
|
|
- char[] orig = original.toCharArray();
|
|
98
|
|
- Arrays.sort(orig);
|
|
99
|
|
- String ori = Arrays.toString(orig).replace(",", "").replace(" ", "").replace("[", "").replace("]", "");
|
|
100
|
|
- String finalResult = "";
|
|
|
97
|
+ for (int j = 0; j < alpha.length(); j++) {
|
|
|
98
|
+ boolean found = false;
|
|
101
|
99
|
|
|
102
|
|
- //Stopped here
|
|
103
|
|
- for (int i = 0; i < ori.length(); i++) {
|
|
104
|
|
- String currentLetter = "";
|
|
105
|
|
- if(!lastLetter.equals(ori.substring(i, i+1))) {
|
|
106
|
|
- lastLetter = ori.substring(i, i+1);
|
|
107
|
|
- finalResult = finalResult + ori.substring(i, i+1);
|
|
|
100
|
+ for (int i = 0; i < original.length(); i++) {
|
|
108
|
101
|
|
|
109
|
|
- }
|
|
|
102
|
+ if(alpha.substring(j, (j+1)).equals(original.substring(i, i+1))) {
|
|
|
103
|
+ while (!found) {
|
|
|
104
|
+ newAlpha = newAlpha + alpha.substring(j, (j+1));
|
|
|
105
|
+ found = true;
|
|
|
106
|
+ }
|
|
|
107
|
+ }
|
|
110
|
108
|
|
|
|
109
|
+ }
|
|
111
|
110
|
}
|
|
112
|
111
|
|
|
113
|
|
- System.out.println(finalResult);
|
|
|
112
|
+ boolean result = alpha.equals(newAlpha);
|
|
|
113
|
+
|
|
|
114
|
+ return result;
|
|
114
|
115
|
|
|
115
|
|
- return false;//finalResult.equals(alpha);
|
|
116
|
116
|
}
|
|
117
|
117
|
|
|
118
|
118
|
/**
|