In C++, create the function that takes integer target and the array as the parameters and returns the length of minimum subarray. Check the function on example 1 in the main function.
![Given an array of positive integers nums and a positive integer target , return the minimal<br>length of a contiguous subarray [nums1l, nums1+1/<br>greater than or equal to target . If there is no such subarray, return o instead.<br>numsr-1, numsr] of which the sum is<br>....<br>Example 1:<br>Input: target =<br>7, nums =<br>[2,3,1,2,4,3]<br>Output: 2<br>Explanation: The subarray [4,3] has the minimal length under the problem<br>constraint.<br>Example 2:<br>Input: target = 4, nums =<br>[1,4,4]<br>Output: 1<br>Example 3:<br>Input: target<br>11, nums =<br>[1,1,1,1,1,1,1,1]<br>%3D<br>Output: 0<br>](https://s3.us-east-1.amazonaws.com/storage.unifolks.com/qimg-008/008_k85wx50-ujfkbsnr.jpeg)
Extracted text: Given an array of positive integers nums and a positive integer target , return the minimal length of a contiguous subarray [nums1l, nums1+1/ greater than or equal to target . If there is no such subarray, return o instead. numsr-1, numsr] of which the sum is .... Example 1: Input: target = 7, nums = [2,3,1,2,4,3] Output: 2 Explanation: The subarray [4,3] has the minimal length under the problem constraint. Example 2: Input: target = 4, nums = [1,4,4] Output: 1 Example 3: Input: target 11, nums = [1,1,1,1,1,1,1,1] %3D Output: 0