原题:
MaxWindowTotal will take an array of integers and a windowSize, and return the maximum total of any consecutive sequence of integers of length windowSize.
For example, given (array = [5, 12, 25, 7, 9], windowSize = 3), the method will return 44 (the sum of 12, 25, and 7 is the greatest total of any 3 consecutive integers in the array).
Implement MaxWindowTotal
5, 12, 25, 7, 9
5, 12, 25 = 42
12, 25, 7 = 44
25, 7, 9 = 41
*/
思路分析:
1 本题需要注意consecutive (连续),不是返回N个元素就可以,必须连续;
2 定义sum时,要以Int32.MinValue为准; 不能初始化为0,否则无法处理负数输入;
3 先用暴力算法,再用动态规划算法; 即存储每次的结果,然后公式:
int
sum = resultArr[i] - values[i] + values[i + windowSize ];
解决方案1,暴力算法
static void Main(string[] args)
{
int[] arr = new int[] { 5, 12, 25, 7, 9 };
int windowSize = 3;
int sum = MaxWindowTotal(arr, windowSize);
Console.WriteLine(sum);
Console.ReadKey();
}
static int MaxWindowTotal(int[] values, int windowSize)
{
//boundary condition
if (windowSize > values.Length)
throw new Exception("windowSize is bigger than value'sLength");
int max = Int32.MinValue;//此处如果是负数的话;
for (int i = 0; i <= values.Length - windowSize; i++)
{
int sum = GetSum(values, i, i + windowSize);
if (sum > max)
max = sum;
}
return max;
}
static int GetSum(int[] values, int startIndex, int endIndex)
{
int result = 0;
for (int i = startIndex; i < endIndex; i++)
{
result += values[i];
}
return result;
}
static int MaxWindowTotal(int[] values, int windowSize)
{
if (windowSize > values.Length)
throw new Exception("windowSize is bigger than value's Length");
int max = Int32.MinValue;
int[] resultArr = new int[values.Length - windowSize + 1];
resultArr[0] = GetSum(values, 0, 0 + windowSize);
if (resultArr[0] > max)
max = resultArr[0];
for (int i = 0; i < values.Length - windowSize; i++)
{
int sum = resultArr[i] - values[i] + values[i + windowSize ];
resultArr[i+1] = sum;
if (sum > max)
max = sum;
}
return max;
}
static int GetSum(int[] values, int startIndex, int endIndex)
{
int result = 0;
for (int i = startIndex; i < endIndex; i++)
{
result += values[i];
}
return result;
}