数组相减计算

文章详细描述了一个名为`subtract_arrays`的Python函数,用于计算两个给定数组a和b中,a中的每个元素与b中较小且未被选过的元素的差值。函数通过迭代和比较找到最接近的数并更新结果列表c。
摘要由CSDN通过智能技术生成
def subtract_arrays(a, b):
    c = []
    subtracted_nums = set()  # Keep track of already subtracted numbers
    for i in range(len(a)):
        min_diff = float('inf')
        closest_num = None
        for j in range(len(b)):
            if b[j] <= a[i] and b[j] not in subtracted_nums:
                diff = abs(a[i] - b[j])
                if diff < min_diff:
                    min_diff = diff
                    closest_num = b[j]
        if closest_num is not None:
            c.append(a[i] - closest_num)
            subtracted_nums.add(closest_num)
    return c


n = [3, 6, 10, 12]
m = [1, 2, 3, 4, 5, 8, 10, 13]
 
s = subtract_arrays(n, m)
print(s)
def subtract_arrays(a, b):
    c = []
    for i in range(len(a)):
        min_diff = float('inf')
        for j in range(len(b)):
            if b[j] <= a[i] and b[j] not in c:  
                diff = abs(a[i] - b[j])
                if diff < min_diff:
                    min_diff = diff
                    closest_num = b[j]
                    c.append(a[i] - closest_num)
    return c

n = [3, 6, 10, 12]
m = [1, 2, 3, 4, 5, 8, 10, 13]

s = subtract_arrays(n, m)
print(s)
def subtract_arrays(a, b):
    b = set(b)
    c = []
    for i in range(len(a)):
        min_diff = float('inf')
        for j in range(len(b)):
            if b[j] <= a[i]:
                diff = abs(a[i] - b[j])
                if diff < min_diff:
                    min_diff = diff
                    closest_num = b[j]
                    if closest_num in b:
                        b.remove(closest_num)
        c.append(a[i] - closest_num)
    return c

n = [3, 6, 10, 12]
m = [1, 2, 3, 4, 5, 8, 10, 13]

s = subtract_arrays(n, m)
print(s)
def subtract_arrays(a, b):
    c = []
    for i in range(len(a)):
        min_diff = float('inf')
        for j in range(len(b)):
            if b[j] <= a[i] and b[j] != closest_num:
                diff = abs(a[i] - b[j])
                if diff < min_diff:
                    min_diff = diff
                    closest_num = b[j]
        c.append(a[i] - closest_num)
    return c

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值