Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- class Solution {
- public:
- int minDifference(vector<int>& nums) {
- if(nums.size()<5){
- return 0;
- }
- sort(nums.begin(),nums.end());
- int ans=0;
- ans=nums.back()-nums[0];
- vector<int> first={nums[1]-nums[0],nums[2]-nums[1],nums[3]-nums[2]};
- vector<int> last={nums[nums.size()-1]-nums[nums.size()-2],
- nums[nums.size()-2]-nums[nums.size()-3],
- nums[nums.size()-3]-nums[nums.size()-4]};
- int fiter=0;
- int liter=0;
- int maxi=0;
- maxi=max(maxi,first[0]+first[1]+first[2]);
- maxi=max(maxi,first[0]+first[1]+last[0]);
- maxi=max(maxi,first[0]+last[0]+last[1]);
- maxi=max(maxi,last[0]+last[1]+last[2]);
- return ans-maxi;
- }
- };
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement