nafis nibir il y a 8 ans
Parent
révision
8e20221e35
2 fichiers modifiés avec 58 ajouts et 9 suppressions
  1. 45
    8
      StringArrayUtils.java
  2. 13
    1
      StringArrayUtilsTest.java

+ 45
- 8
StringArrayUtils.java Voir le fichier

@@ -1,4 +1,4 @@
1
-
1
+import java.util.Arrays;
2 2
 /**
3 3
  * Created by leon on 1/29/18.
4 4
  */
@@ -41,13 +41,14 @@ public class StringArrayUtils {
41 41
      * @return true if the array contains the specified `value`
42 42
      */ // TODO
43 43
     public static boolean contains(String[] array, String value) {
44
-
44
+        boolean output = false;
45 45
         for (String test: array){
46 46
             if (test.equals(value)){
47
-                return true;
47
+                output = true;
48
+                break;
48 49
             }        
49 50
         }
50
-        return false; 
51
+        return output; 
51 52
     }
52 53
 
53 54
     /**
@@ -55,8 +56,11 @@ public class StringArrayUtils {
55 56
      * @return an array with identical contents in reverse order
56 57
      */ // TODO
57 58
     public static String[] reverse(String[] array) {
58
-        
59
-        return null;
59
+        String[] newArray = new String[array.length];
60
+        for (int start = 0; start < array.length; start++){
61
+            newArray[start] = array[array.length-start-1];           
62
+        }
63
+        return newArray;
60 64
     }
61 65
 
62 66
     /**
@@ -64,7 +68,13 @@ public class StringArrayUtils {
64 68
      * @return true if the order of the array is the same backwards and forwards
65 69
      */ // TODO
66 70
     public static boolean isPalindromic(String[] array) {
67
-        return false;
71
+        boolean output = false;
72
+        String[] reverseArr = new String[array.length];
73
+        reverseArr = reverse(array);
74
+        if (Arrays.equals(reverseArr, array)){
75
+            output = true;
76
+        }
77
+        return output;
68 78
     }
69 79
 
70 80
     /**
@@ -72,7 +82,34 @@ public class StringArrayUtils {
72 82
      * @return true if each letter in the alphabet has been used in the array
73 83
      */ // TODO
74 84
     public static boolean isPangramic(String[] array) {
75
-        return false;
85
+        String[] arr = makeSplitStringArray(array);
86
+        boolean isPang = containsLetter(arr);
87
+        return isPang;
88
+    }
89
+
90
+    public static boolean containsLetter(String[] array){
91
+        boolean doesContain = true;
92
+        String[] alph = new String[]{"a", "b", "c", "d", "e", "f", "g", "h",
93
+                "i", "j", "k", "l", "m", "n", "o", "p",
94
+                "q", "r", "s", "t", "u", "v", "w", "x",
95
+                "y", "z"};
96
+        for (String check: alph){
97
+            doesContain = contains(array, check);
98
+            if(doesContain == false){
99
+                break;
100
+            }
101
+        }
102
+        return doesContain;
103
+    }
104
+
105
+    public static String[] makeSplitStringArray(String[] array){
106
+        StringBuilder fullString = new StringBuilder();
107
+        for(String s : array) {
108
+            fullString.append(s);
109
+        }
110
+        String str = fullString.toString().toLowerCase();
111
+        String[] individualLetters = str.split("");    
112
+        return individualLetters;
76 113
     }
77 114
 
78 115
     /**

+ 13
- 1
StringArrayUtilsTest.java Voir le fichier

@@ -278,7 +278,19 @@ public class StringArrayUtilsTest {
278 278
         Assert.assertFalse(outcome);
279 279
     }
280 280
 
281
-
281
+    @Test
282
+    public void testContainsLetter(){
283
+       boolean expected = true;
284
+       boolean given = StringArrayUtilis
285
+        
286
+        
287
+    }
288
+    
289
+    @Test
290
+    public void testMakeSplitStringArray(){
291
+        
292
+        
293
+    }
282 294
 
283 295
 
284 296