<p>You are given an array of integers&nbsp;<code>nums</code>, there is a sliding window of size <code>k</code> which is moving from the very left of the array to the very right. You can only see the <code>k</code> numbers in the window. Each time the sliding window moves right by one position.</p>

<p>Return <em>the max sliding window</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums = [1,3,-1,-3,5,3,6,7], k = 3
<strong>Output:</strong> [3,3,5,5,6,7]
<strong>Explanation:</strong> 
Window position                Max
---------------               -----
[1  3  -1] -3  5  3  6  7       <strong>3</strong>
 1 [3  -1  -3] 5  3  6  7       <strong>3</strong>
 1  3 [-1  -3  5] 3  6  7      <strong> 5</strong>
 1  3  -1 [-3  5  3] 6  7       <strong>5</strong>
 1  3  -1  -3 [5  3  6] 7       <strong>6</strong>
 1  3  -1  -3  5 [3  6  7]      <strong>7</strong>
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums = [1], k = 1
<strong>Output:</strong> [1]
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums.length &lt;= 10<sup>5</sup></code></li>
	<li><code>-10<sup>4</sup> &lt;= nums[i] &lt;= 10<sup>4</sup></code></li>
	<li><code>1 &lt;= k &lt;= nums.length</code></li>
</ul>

class Solution {
public:
    vector<int> maxSlidingWindow(vector<int>& nums, int k) {
        int n = nums.size();
        vector <int> res;

        if(n == 0)
            return res;
        if(k == 1)
            return nums;

        int left[n]; 
        int right[n]; 

        left[0] = nums[0];
        right[n - 1] = nums[n - 1];

        //max from left in the windows of k
        for(int i = 0;i < n;i++)
        {
            if(i % k == 0)
            left[i] = nums[i];
            else
            left[i] = std::max(nums[i],left[i - 1]);
        } 

        // max from right in the windows of k
        for(int i = n - 2;i >= 0;i--)
        {
            if(i % k == 0)
            right[i] = nums[i];
            else
            right[i] = std::max(nums[i],right[i + 1]);
        } 

        //overall maximum
        for(int i = 0; i <= n - k;i++)
        {
            res.push_back(std::max(right[i],left[i + k - 1]));
        }
        return res;
    }
};
136386