大意了,尼玛# JobHunting - 待字闺中
p*u
1 楼
sliding window那个题,rocket fuel的烙印不让用STL,非要手写heap,还要求删除任
意元素的复杂度也是O(logn)
一般不都是鼓励用库的么!g家onsite有个稍麻烦点但是最后也用heap的题,用STL面试
官就很满意啊。。。
更新下题目:
You are given an array of size n. There is a sliding window of size k( Return an array containing max element in each window position(from leftmost
window position to rightmost).
Eg.
input: A=4,7,3,6,8,2,4,3,2,5,4 k=4
output:B=7,8,8,8,8,4,5,5
意元素的复杂度也是O(logn)
一般不都是鼓励用库的么!g家onsite有个稍麻烦点但是最后也用heap的题,用STL面试
官就很满意啊。。。
更新下题目:
You are given an array of size n. There is a sliding window of size k(
window position to rightmost).
Eg.
input: A=4,7,3,6,8,2,4,3,2,5,4 k=4
output:B=7,8,8,8,8,4,5,5