*Sliding Window Maximum | LeetCode*A long array A[] is given to you. There is a sliding window of size...

Please Visit: http://ift.tt/1ajReyV

*Sliding Window Maximum | LeetCode*A long array A[] is given to you. There is a sliding window of size w which is moving from the very left of the array to the very right. You can only see the w numbers in the window. Each time the sliding window moves rightwards by one position. Following is an example:

The array is [1 3 -1 -3 5 3 6 7], and w is 3.

http://ift.tt/1lHLHx7

http://ift.tt/1wemLiS

Sliding Window Maximum | LeetCode

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1lHLJVz

via LifeLong Community