最佳运动员的比拼回合

/*
 * 思路：
 * 1. 使用Java Stream API对运动员进行分组和过滤。
 * 2. 递归进行回合计算，直到最佳运动员碰面。
 */
import java.util.List;
import java.util.stream.Collectors;
import java.util.stream.IntStream;

public class TournamentStream {
    public int[] earliestAndLatest(int n, int firstPlayer, int secondPlayer) {
        int earliest = findEarliestRound(n, firstPlayer, secondPlayer);
        int latest = findLatestRound(n, firstPlayer, secondPlayer);
        return new int[]{earliest, latest};
    }

    private int findEarliestRound(int n, int firstPlayer, int secondPlayer) {
        int round = 1;
        while (firstPlayer != secondPlayer) {
            firstPlayer = (firstPlayer + 1) / 2;
            secondPlayer = (secondPlayer + 1) / 2;
            round++;
        }
        return round - 1;
    }

    private int findLatestRound(int n, int firstPlayer, int secondPlayer) {
        int round = 1;
        while (n > 1) {
            n = (n + 1) / 2;
            round++;
        }
        return round - 1;
    }

    public static void main(String[] args) {
        TournamentStream tournament = new TournamentStream();
        int[] result = tournament.earliestAndLatest(11, 2, 4);
        System.out.println("[" + result[0] + "," + result[1] + "]"); // [3,4]
    }
}