篮球队员5V5分组战力差最小

解法1:

依次把队员中最接近平均值的队员找出来，放都两队中，放入规则：A组，B组人数相同且总战力较小；或者人数较少的那一组优先放入

---

package com.hanzheng.algorithm;

import java.util.ArrayList;
import java.util.Collections;
import java.util.List;

public class BasketballPlayer {
    public static List<Integer> nums = new ArrayList<>();

    public static void main(String[] args) {
        int[] players = new int[]{1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
        int sum = 0;
        for (int i = 0; i < players.length; i++) {
            nums.add(players[i]);
            sum += players[i];
        }
        Collections.sort(nums);
        List<Integer> A = new ArrayList<>();
        int countA = 0;
        List<Integer> B = new ArrayList<>();
        int countB = 0;
        while (nums.size() > 0) {
            int index = findMostNearAverage(sum / nums.size());