NWAFU-1544数组填充

代码：

int MinInsert(int* pnums, int m, int k)
{
	int left = 0;
	int right = 0;
	int sum = 0;
	int i = 0;
	int gap = 0;
	// 采用冒泡排序升序排序数组中的元素
	for (i = 0; i < m - 1; i++)
	{
		for (int j = 0; j < m - i - 1; j++)
		{
			if (*(pnums + j) > *(pnums + j + 1))
			{
				int t = *(pnums + j);
				*(pnums + j) = *(pnums + j + 1);
				*(pnums + j + 1) = t;
			}
		}
	}
	//循环判定数组的间隙大小
	for (i = 0; i < m; i++)
	{
		right = *(pnums + i);
		gap = right - left - 1;
		if (gap > 0)
		{
			if (k <= gap)//当间隙大于待填数量时，依次填入整数并统计填入的数之和
			{
				sum += (left * 2 + 1 + k) * k / 2;
				return sum;
			}
			else//否则依次填满间隙，调整k, 并统计填入的数之和
			{
				sum += (left + right) * gap / 2;
				k = k - gap;
			}
		}
		left = right;
	}
	if (k)//如未达到要求的待填数量，则继续在尾部填充，统计填入的数之和
	{
		sum += (left * 2 + 1 + k) * k / 2;
	}
	return sum;
}