Complete the method numXY.
It finds the number of times the string "XY" appears in the input string recursively.
You must not use any loops or regular expressions.
Test cases:
numXY("AAXYAA") → 1
numXY("AXYBXYAA") → 2
格式:
public static int numXY(String input) {
// base case
// recursive step
}