Minimum Difference Between Largest and Smallest Value in Three Moves LeetCode solution in C++

1
class Solution {
2
 public:
3
  int minDifference(vector<int> &nums) {
4
    int n = nums.size();
5

6
    sort(nums.begin(), nums.end());
7

8
    if (n < 5) {
9
      return 0;
10

11
    } else
12
      return min({nums[n - 4] - nums[0], nums[n - 3] - nums[1], nums[n - 2] - nums[2],
13
                  nums[n - 1] - nums[3]});
14
  }
15
};