feat(codeforces): implement solve logic for p2190A

Author: lzwjava

src/main/java/com/lzw/solutions/codeforces/p2190A/Main.java

@@ -4,9 +4,6 @@
 import java.io.IOException;
 import java.io.InputStreamReader;
 import java.io.PrintWriter;
-import java.util.HashSet;
-import java.util.Set;
-import java.util.StringTokenizer;
 
 public class Main {
 
@@ -18,13 +15,33 @@ public class Main {
         out = new PrintWriter(System.out);
     }
 
+    // 100100,            100101
+    // 000011(1,4,5,6)    000111(1,4,5)
+
     void solve() throws IOException {
         int t = Integer.parseInt(in.readLine());
-        while (t-->0){
+        while (t-- > 0) {
             int n = Integer.parseInt(in.readLine());
             String s = in.readLine();
             assert (s.length() == n);
-            System.out.println(s);
+            boolean allZeros = true;
+            int i;
+            for (i = 0; i < n; i++) {
+                if (s.charAt(i) == '1') {
+                    allZeros = false;
+                }
+            }
+            boolean allOnes = true;
+            for (i = 0; i < n; i++) {
+                if (s.charAt(i) == '0') {
+                    allOnes = false;
+                }
+            }
+            if (allZeros || allOnes) {
+                out.println("Bob");
+            } else {
+                out.println("Alice");
+            }
         }
     }