Java循环条件陷阱：如何正确比较数组元素并寻找最接近值

public void teamlengthaverage(int N) {
    for (int i = 0; i < N; i++) {
        if (teams[i].getScore() <= mesoScore(N)) {
            for (int j = 0; j != i && j < N; j++) { // 问题所在
                if (teams[i].getScore() > teams[j].getScore()) {
                    System.out.print(
                            "The team closest to the average score is: "
                                    + teams[i]);
                }
            }
        } else if (teams[i].getScore() >= mesoScore(N)) {
            for (int j = 0; j != i && j < N; j++) { // 问题所在
                if (teams[i].getScore() < teams[j].getScore()) {
                    System.out.print(
                            "The team closest to the average score is: "
                                    + teams[i]);
                }
            }
        }
    }
}

public void teamlengthaverage(int N) {
    for (int i = 0; i < N; i++) {
        // 原始逻辑保持不变，但内层循环结构修正
        if (teams[i].getScore() <= mesoScore(N)) {
            for (int j = 0; j < N; j++) { // 修正：j < N
                if (j == i) continue; // 修正：跳过自比较

                if (teams[i].getScore() > teams[j].getScore()) {
                    System.out.print(
                            "The team closest to the average score is: "
                                    + teams[i]);
                }
            }
        } else if (teams[i].getScore() >= mesoScore(N)) {
            for (int j = 0; j < N; j++) { // 修正：j < N
                if (j == i) continue; // 修正：跳过自比较

                if (teams[i].getScore() < teams[j].getScore()) {
                    System.out.print(
                            "The team closest to the average score is: "
                                    + teams[i]);
                }
            }
        }
    }
}

public class TeamAnalyzer {

    // 假设 Team 类有 getScore() 方法
    static class Team {
        private String name;
        private int score;

        public Team(String name, int score) {
            this.name = name;
            this.score = score;
        }

        public int getScore() {
            return score;
        }

        @Override
        public String toString() {
            return "Team{" +
                   "name='" + name + '\'' +
                   ", score=" + score +
                   '}';
        }
    }

    private Team[] teams; // 假设 teams 数组已初始化
    private int N; // 数组长度

    public TeamAnalyzer(Team[] teams) {
        this.teams = teams;
        this.N = teams.length;
    }

    // 假设 mesoScore(N) 是一个计算平均分的方法
    private int mesoScore(int N) {
        if (N == 0) return 0;
        int totalScore = 0;
        for (int i = 0; i < N; i++) {
            totalScore += teams[i].getScore();
        }
        return totalScore / N;
    }

    /**
     * 寻找分数最接近平均分的团队
     */
    public Team findTeamClosestToAverage() {
        if (N == 0) {
            System.out.println("No teams to analyze.");
            return null;
        }

        int targetScore = mesoScore(N);
        Team closestTeam = null;
        int minDifference = Integer.MAX_VALUE; // 初始化为最大整数值

        for (int i = 0; i < N; i++) {
            int currentScore = teams[i].getScore();
            int currentDifference = Math.abs(currentScore - targetScore); // 计算绝对差

            if (currentDifference < minDifference) {
                minDifference = currentDifference;
                closestTeam = teams[i];
            }
        }
        return closestTeam;
    }

    public static void main(String[] args) {
        Team[] myTeams = {
            new Team("Alpha", 85),
            new Team("Beta", 92),
            new Team("Gamma", 78),
            new Team("Delta", 88),
            new Team("Epsilon", 95)
        };

        TeamAnalyzer analyzer = new TeamAnalyzer(myTeams);
        Team closest = analyzer.findTeamClosestToAverage();

        if (closest != null) {
            System.out.println("The team closest to the average score (" + analyzer.mesoScore(analyzer.N) + ") is: " + closest);
        }
    }
}