题解 | 浮木博弈
浮木博弈
https://www.nowcoder.com/practice/8c70e6107d37468e9f6ad2b25ff167bf
import java.util.*;
public class Main{
public static void main(String[] args){
Scanner in = new Scanner(System.in);
int T = in.nextInt();
while(T-- > 0){
int n = in.nextInt();
int[] a = new int[n+5];
for(int i=1;i<=n;i++) a[i] = in.nextInt();
int now = 1;
while(now <= n && a[now] == 1) now++;
int tmp = now - 1;
if(tmp == n) tmp --;
if(tmp % 2 == 0) System.out.println("Alice");
else System.out.println("Bob");
}
}
}
查看5道真题和解析