First negative in window

Given an integer array and window size k, return for each window the first negative number in that window, or 0 if the window has no negative number. Slide the window left to right one step at a time. Use a deque so the whole pass is O(n). Return a list of length len(nums) - k + 1. 1 <= k <= len(nums) <= 10^5.