[LeetCode]Sliding Window Maximum

public class Solution {
    public int[] maxSlidingWindow(int[] nums, int k) {
        if(nums.length==0)return new int[0];
		int[] result = new int[nums.length-k+1];
		int max = getMax(nums,0,k-1);
		result[0] = max;
		for(int i=k;i<nums.length;i++){

<span style="white-space:pre">			</span>//在该处数组内的index上面选择容易出现失误，把本应是i的位置写成了k
			if(nums[i]>max){
				result[i-k+1] = nums[i];
				max = nums[i];
			}else if(nums[i-k]==max){
				max = getMax(nums,i-k+1,i);
				result[i-k+1] = max;
			}else{
				result[i-k+1] = max;
			}
		}
		return result;
    }
	
	private int getMax(int[] nums,int beg,int end){
		int max=nums[beg];
		for(int i=beg+1;i<=end;i++){
			if(nums[i]>max)max = nums[i];
		}
		return max;
	}
}