滑动窗口的最大值
一、题目描述
给定一个数组 nums 和滑动窗口的大小 k,请找出所有滑动窗口里的最大值。
示例:
输入: nums = [1,3,-1,-3,5,3,6,7], 和 k = 3
输出: [3,3,5,5,6,7]
解释:
滑动窗口的位置 最大值
[1 3 -1] -3 5 3 6 7 3
1 [3 -1 -3] 5 3 6 7 3
1 3 [-1 -3 5] 3 6 7 5
1 3 -1 [-3 5 3] 6 7 5
1 3 -1 -3 [5 3 6] 7 6
1 3 -1 -3 5 [3 6 7] 7
提示:
你可以假设 k 总是有效的,在输入数组不为空的情况下,1 ≤ k ≤ 输入数组的大小。
作者:Krahets
链接:https://leetcode-cn.com/leetbook/read/illustration-of-algorithm/58o46i/
来源:力扣(LeetCode)
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。
二、解题思路及代码实现
1、解题思路
在滑动窗口中,每次移动窗口,最左边的移除,右边的加入窗口,最先想到的是使用列表来存储窗口的元素,方便插入和删除,同时链表可以排序,这样可以非常方便的取得最大值。这样设计貌似效率不是很好,看了官方解题方案,感觉也很麻烦,还是贴一下自己写的代码吧。
2、C++代码实现
struct MyNode {
int val;
MyNode* next;
MyNode(int _val) {
val = _val;
next = NULL;
}
};
class Solution {
private:
MyNode* m_head = NULL;
MyNode* m_tail = NULL;
MyNode* m_free = NULL;
public:
void init_order_list(vector<int>& nums, int k) {
for (int i = 0; i < k; ++i) {
MyNode* tmp = new MyNode(nums.at(i));
if (m_head == NULL) {
m_head = tmp;
m_tail = tmp;
} else {
if (nums.at(i) >= m_head->val) {
tmp->next = m_head;
m_head = tmp;
} else {
MyNode* current = m_head->next;
MyNode* pre = m_head;
while (current != NULL) {
if (nums.at(i) >= current->val) {
pre->next = tmp;
tmp->next = current;
break;
} else {
pre = current;
current = current->next;
}
}
if (current == NULL) {
pre->next = tmp;
}
}
}
}
}
int get_max(int in, int out) {
MyNode* current = m_head;
MyNode* pre = m_head;
//移除出来的值
while (out != current->val) {
pre = current;
current = current->next;
}
m_free = current;
pre->next = current->next;
if (current == m_head) {
m_head = current->next;
} else {
pre->next = current->next;
}
//插入新值
current = m_head;
pre = m_head;
while (current!= NULL && in < current->val) {
pre = current;
current = current->next;
}
m_free->val = in;
if (current == m_head) {
m_head = m_free;
m_free->next = current;
} else {
pre->next = m_free;
m_free->next = current;
}
return m_head->val;
}
vector<int> maxSlidingWindow(vector<int>& nums, int k) {
vector<int> ret;
if (nums.size() < k || k <= 0) return ret;
init_order_list(nums, k);
ret.push_back(m_head->val);
for (int i = 0; i < nums.size() - k; ++i) {
int max_val = get_max(nums.at(i + k), nums.at(i));
ret.push_back(max_val);
}
return ret;
}
};
三、提交结果
总结
确实没有想到什么好方法,也有考虑过用队列实现的,没想出来,o(╥﹏╥)o