刷题-青草博弈问题-暴力解找规律

package com.example.demo.study.huawei;

import java.util.Scanner;

public class niuyang {

    public static void main(String args[]){
//        Scanner scanner=new Scanner(System.in);
//        Integer n=scanner.nextInt();
//        Integer[] grass=new Integer[n];
//        for (int i = 0; i <n ; i++) {
//            grass[i]=scanner.nextInt();
//        }
//        scanner.close();
        for (int i = 0; i <50 ; i++) {
            System.out.println(winner(i));
        }
    }

    public static String winner(Integer n){
        if(n<5){
            return (n==2 ||n==0)?"yang":"niu";
        }
        int base=1;//假设先手第一次吃1个草
        while (base<=n){
            if (winner(n-base).equals("yang")){
                return "niu";
            }
            if(base* 4> n){
                break;
            }
            base=base*4;
        }
        return "yang";
    }


}