漫画算法笔记 无序数组排序后的最大相邻差

漫画算法笔记

无序数组排序后的最大相邻差

#include <iostream>
#include <stdlib.h>
#include <algorithm>
#include <vector>
using namespace std;

template<typename T>
struct Bucket
{
	T _min = 0;
	T _max = 0;
};
//无序数组排序后的最大相邻差
template<typename T>
T getMaxSortedDistance(const vector<T>& vec)
{
	//1.得到数列的最大值和最小值
	auto minMax = std::minmax_element(vec.begin(), vec.end());
	T min = *minMax.first;
	T max = *minMax.second;
	T d = max - min;
	if( d == 0)
	{
		return 0;
	}
	//2.初始化桶
	int bucketNum = vec.size();
	vector<Bucket<T>> buckets(bucketNum);
	//3.遍历原始数组,确定每个桶的最大最小值
	for (int i = 0; i < vec.size(); ++i )
	{
		int index = ((vec[i] - min) *(bucketNum - 1) / d);
		if (buckets[index]._min == 0 || buckets[index]._min > vec[i])
		{
			buckets[index]._min = vec[i];
		}
		if (buckets[index]._max == 0 || buckets[index]._max < vec[i])
		{
			buckets[index]._max = vec[i];
		}
	}
	//4.遍历桶,找到最大差值
	T leftMax = buckets[0]._max;
	T maxDistance = 0;
	for ( int i = 1 ; i < buckets.size(); ++i )
	{
		if (buckets[i]._min == 0)
		{
			continue;
		}
		if ( buckets[i]._min - leftMax > maxDistance ) 
		{
			maxDistance = buckets[i]._min - leftMax;
		}
		leftMax = buckets[i]._max;
	}
	return maxDistance;
}
int main(int argc, char** argv)
{
	vector<int> vec = {2, 6, 3, 4, 5, 10, 9};
	cout << getMaxSortedDistance(vec) << endl;	//3

	system("pause");
	return 0;
}