LeetCode刷題記錄——第908題（最小差值）

題目描述 Given an array A of integers, for each integer A[i] we may choose any x with -K <= x <= K, and add x to A[i].python After this process, we have some array B.web Return the smallest possible diffe

>>阅读原文<<