题目:
刚开始是创建一个窗口数组,然后用sort函数排序找出最大值,但是时间复杂度超过题目要求,具体代码是:
public class Solution {
public int[] MaxSlidingWindow(int[] nums, int k) {
int[]result=new int [nums.Length-k+1];
int[] current;
for(int i=0;i<result.Length;i++)
{
current=new int[k];
System.Array.Copy(nums,i,current,0,k);
Array.Sort(current);
result[i]=current[k-1];
}
return result;
}
}
改进之后代码为:
public class Solution {
public int[] MaxSlidingWindow(int[] nums, int k) {
if (nums.Length < 2) {
return nums;
}
int[] result = new int[nums.Length - k + 1];
int max = int.MinValue;
for (int i = 0; i < nums.Length; i++) {
if (nums[i] >= max) {
max = nums[i];
}
if (i > k - 1 && nums[i] < max && max == nums[i - k]) {
max = int.MinValue;
for (int j = i - k + 1; j <= i; j++) {
if (nums[j] > max) {
max = nums[j];
}
}
}
if (i >= k - 1) {
result[i - k + 1] = max;
}
}
return result;
}
}
运行结果为: