滑动窗口最大值

群里看到的，原型是leetcode 239题目

239. Sliding Window Maximum

Given an array nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numbers in the window. Each time the sliding window moves right by one position.

For example,
Given nums = [1,3,-1,-3,5,3,6,7], and k = 3.

Window position                Max
---------------               -----
[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

Therefore, return the max sliding window as [3,3,5,5,6,7].

提示用的heap，复杂度O（n）我不会，我用的方法O（nlogn），也能通过。。

public class Solution {
    public int[] maxSlidingWindow(int[] nums, int size) {
        ArrayList<Integer> list=new ArrayList<>();
        TreeMap<Integer,Integer> map=new TreeMap<>();
        int len=0;
        for(int i=0;i<nums.length;i++){
            if(map.containsKey(nums[i])){
                map.put(nums[i],map.get(nums[i])+1);
            }else{
                map.put(nums[i],1);
            }
            len++;
            if(len>size){
                if(map.get(nums[i-size])==1){
                    map.remove(nums[i-size]);
                }else{
                    map.put(nums[i-size],map.get(nums[i-size])-1);
                }
                len--;
            }
            if(len==size){
                list.add(map.lastKey());
            }
        }
        int[] answear=new int[list.size()];
        for(int i=0;i<list.size();i++){
            answear[i]=list.get(i);
        }
        return answear;
    }
}