Python 基础知识简单

最小绝对差之和

“最小总和绝对差”问题的详细指南和 Python 实现。

问题陈述

简单

编写一个函数 min_sum_abs_diff(arr1, arr2) ,它接受两个长度相等的数组,并在以任意顺序重新排列两个数组的元素后返回 sum(|arr1[i] - arr2[i]|) 的最小可能值。要最小化此总和,请对同一索引处的数组和对元素进行排序。

约束条件
  • 1 <= len(arr1) == len(arr2) <= 10^5
  • -10^9 <= arr1[i], arr2[i] <= 10^9

示例

Example 1
Input
arr1 = [4, 1, 8, 7], arr2 = [2, 3, 6, 5]
Output
6
Explanation

Sort arr1: [1,4,7,8]. Sort arr2: [2,3,5,6]. Sum: |1-2|+|4-3|+|7-5|+|8-6| = 1+1+2+2 = 6.

Example 2
Input
arr1 = [1, 2, 3], arr2 = [1, 2, 3]
Output
0
Explanation

Same arrays, so differences are all zero.

Example 3
Input
arr1 = [5, 5], arr2 = [5, 5]
Output
0
Explanation

All pairs match perfectly.

Need a Hint?
考虑使用特定于数组的数据结构,例如集合或堆。
Edge Cases to Watch
  • 空输入结构
  • 单元素输入
  • 大数值范围

准备好解决了吗?

Open the problem in PyRun's browser-based Python editor. Your code runs fully offline — no server required.

在编辑器中打开
Found this breakdown helpful?

PyRun is built and maintained by an independent solo developer. If this helped your interview prep, consider buying a coffee!

Buy me a coffee

推荐的 Python 资源

通过相关的交互式教程、备忘单和代码比较来扩展您的知识。