leetcode

Solution to some Leetcode problems written in C++

git clone git://git.dimitrijedobrota.com/leetcode.git

1509.cpp (489B)

0 class Solution { 1 public: 2 int minDifference(vector<int> &nums) const { 3 const int n = size(nums); 4 if (n <= 4) return 0; 5 partial_sort(begin(nums), begin(nums) + 4, end(nums)); 6 nth_element(begin(nums) + 4, end(nums) - 4, end(nums)); 7 sort(end(nums) - 4, end(nums)); 8 return min({ 9 nums[n - 1] - nums[3], 10 nums[n - 2] - nums[2], 11 nums[n - 3] - nums[1], 12 nums[n - 4] - nums[0], 13 }); 14 } 15 };