Come from : [https://leetcode-cn.com/problems/smallest-range-i/submissions/]

908. Smallest Range I

1.Question2.Answer3.大神们的解决方案4.我的收获

1.Question

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].

After this process, we have some array B.

Return the smallest possible difference between the maximum value of B and the minimum value of B.

Example 1 :

Input: A = [1], K = 0 Output: 0 Explanation: B = [1]

Example 2 :

Input: A = [0,10], K = 2 Output: 6 Explanation: B = [2,8]

Example 3 :

Input: A = [1,3,6], K = 3 Output: 0 Explanation: B = [3,3,3] or B = [4,4,4]

Note:

1. 1 <= A.length <= 10000 2. 0 <= A[i] <= 10000 3. 0 <= K <= 10000

2.Answer

easy 类型题目。 我的暴力解题思路：

AC代码如下：（比较low。。。）

class Solution { public: int smallestRangeI(vector<int>& A, int K) { sort(A.begin(), A.end()); if( (A[A.size() - 1] - K) < (A[0] + K) ) { return 0; } else { return A[A.size() - 1] - K - A[0] - K; } } };

3.大神们的解决方案

4.我的收获

Fighting~~~

2019/5/23 胡云层 于南京 84