leetcode: Sliding Window Maximum

代码：

public class Solution {
public int[] maxSlidingWindow(int[] nums, int k) {
int[] res = new int[nums.length-k+1];
int count = 0;

if(nums.length == 0) {
return nums;
}

for(int i=0; i<=(nums.length-k); i++) {
int max = nums[i];
for(int j=i; j<=i+k-1; j++) {
max = nums[j]>max ? nums[j] : max;
}
res[i] = max;
}

return res;
}
}