篮球比赛python

 难度指数：⭐⭐⭐⭐⭐

【满分】【华为OD机试真题2023B卷 JAVA&JS】篮球比赛

通用一般算法：

【华为OD统一考试B卷 】篮球比赛 python

def min_d(a1):
    a2 = list(combinations(a1, len(a1) // 2))
    min_diff = abs(sum(a1) - 2 * sum(a2[0]))
    for arr in a2:
        if abs(sum(a1) - 2 * sum(arr)) < min_diff:
            min_diff = abs(sum(a1) - 2 * sum(arr))
    return min_diff

创新算法

idea

• 从10个篮球手中挑选5个的组合问题，可以转化为从原始组队状态交换队员的问题，即从两个队伍的5个篮球手中分别挑1-2个进行交换。
• 将篮球手按战斗力升序排列，并分组，得到战斗力差值最大的原始组队状态。
• 分别计算交换一个或两个篮球手之后，两个队伍的战斗力差值。

代码实现

def min_d0(a10):
    a10 = sorted(a10)
    half_l=len(a10)//2
    max_diff=sum(a10[half_l:])-sum(a10[:half_l])
    min_diff=max_diff
    temps=[[max_diff for _ in range(half_l)] for _ in range(half_l)]
    for i in range(half_l):
        for j in range(half_l):
            temp=max_diff-2*(a10[half_l+j]-a10[i])
            if -1<=temp<=1:   return abs(temp)
            else:
                min_diff=min(min_diff,abs(temp))
                temps[i][j]=temp 
    for i in range(half_l-1):
        for j in range(half_l-1): 
            for m in range(i+1,half_l):
                for n in range(j+1,half_l):
                    temp=temps[i][j]+temps[m][n]-max_diff
                    if -1<=temp<=1:   return abs(temp)
                    else:
                        min_diff=min(min_diff,abs(temp))
    return min_diff

def min_d1(a10):
    a10 = sorted(a10)
    half_l=len(a10)//2
    max_diff=sum(a10[half_l:])-sum(a10[:half_l])
    min_diff=max_diff
    for i in range(half_l):
        for j in range(half_l):
            temp=max_diff-2*(a10[half_l+j]-a10[i])
            if -1<=temp<=1:   return abs(temp)
            else:
                min_diff=min(min_diff,abs(temp))
    a1=list(combinations(a10[:half_l],2))
    a2=list(combinations(a10[half_l:],2))
    for i in a1:
        for j in a2:
            temp=max_diff-2*(sum(j)-sum(i))
            if -1<=temp<=1:   return abs(temp)
            else:
                min_diff=min(min_diff,abs(temp))
    return min_diff

对比验证

耗时：

import random
from time import time
from itertools import combinations

def min_d(a1):
    a2 = list(combinations(a1, len(a1) // 2))
    min_diff = abs(sum(a1) - 2 * sum(a2[0]))
    for arr in a2:
        if abs(sum(a1) - 2 * sum(arr)) < min_diff:
            min_diff = abs(sum(a1) - 2 * sum(arr))
    return min_diff

def min_d0(a10):
    a10 = sorted(a10)
    half_l=len(a10)//2
    max_diff=sum(a10[half_l:])-sum(a10[:half_l])
    min_diff=max_diff
    temps=[[max_diff for _ in range(half_l)] for _ in range(half_l)]
    for i in range(half_l):
        for j in range(half_l):
            temp=max_diff-2*(a10[half_l+j]-a10[i])
            if -1<=temp<=1:   return abs(temp)
            else:
                min_diff=min(min_diff,abs(temp))
                temps[i][j]=temp 
    for i in range(half_l-1):
        for j in range(half_l-1): 
            for m in range(i+1,half_l):
                for n in range(j+1,half_l):
                    temp=temps[i][j]+temps[m][n]-max_diff
                    if -1<=temp<=1:   return abs(temp)
                    else:
                        min_diff=min(min_diff,abs(temp))
    return min_diff

T=10
while T:
    players=[random.randint(1,int(1e4)) for _ in range(10)]
    t1=time()
    m=min_d(players)
    t2=time()
    m0=min_d0(players)
    t3=time()
    print(m,m0)
    print(t2-t1,t3-t2)
    T-=1