<p>You are given a <strong>0-indexed</strong> array <code>nums</code> and an integer <code>target</code>.</p>

<p>A <strong>0-indexed</strong> array <code>infinite_nums</code> is generated by infinitely appending the elements of <code>nums</code> to itself.</p>

<p>Return <em>the length of the <strong>shortest</strong> subarray of the array </em><code>infinite_nums</code><em> with a sum equal to </em><code>target</code><em>.</em> If there is no such subarray return <code>-1</code>.</p>

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

<pre>
<strong>Input:</strong> nums = [1,2,3], target = 5
<strong>Output:</strong> 2
<strong>Explanation:</strong> In this example infinite_nums = [1,2,3,1,2,3,1,2,...].
The subarray in the range [1,2], has the sum equal to target = 5 and length = 2.
It can be proven that 2 is the shortest length of a subarray with sum equal to target = 5.
</pre>

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

<pre>
<strong>Input:</strong> nums = [1,1,1,2,3], target = 4
<strong>Output:</strong> 2
<strong>Explanation:</strong> In this example infinite_nums = [1,1,1,2,3,1,1,1,2,3,1,1,...].
The subarray in the range [4,5], has the sum equal to target = 4 and length = 2.
It can be proven that 2 is the shortest length of a subarray with sum equal to target = 4.
</pre>

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

<pre>
<strong>Input:</strong> nums = [2,4,6,8], target = 3
<strong>Output:</strong> -1
<strong>Explanation:</strong> In this example infinite_nums = [2,4,6,8,2,4,6,8,...].
It can be proven that there is no subarray with sum equal to target = 3.
</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>1 &lt;= nums[i] &lt;= 10<sup>5</sup></code></li>
	<li><code>1 &lt;= target &lt;= 10<sup>9</sup></code></li>
</ul>

class Solution:
    def minSizeSubarray(self, nums: List[int], target: int) -> int:
        result = 0
        sum_nums = sum(nums)
        l = len(nums)
        i, target = divmod(target, sum_nums)
        if i:
            result = i * l
            if not target:
                return result
        if l == 1:
            return -1

        left_bound, right_bound = {}, {}
        x = 0
        for i in range(l-1):
            x += nums[i]
            if x > target:
                break
            left_bound[x] = i + 1
        x = 0
        for i in range(l-1, 0, -1):
            x += nums[i]
            if x > target:
                break
            right_bound[x] = l - i

        new_result = l
        if target in left_bound:
            new_result = min(new_result, left_bound[target])
        if target in right_bound:
            new_result = min(new_result, right_bound[target])

        for k_l, v_l in left_bound.items():
            if target - k_l in right_bound:
                new_result = min(new_result, v_l + right_bound[target - k_l])

        left, right = 1, 2
        x = nums[left]
        while right < l:
            if x == target:
                new_result = min(new_result, right - left)
                x += nums[right]
                right += 1
            elif x < target:
                x += nums[right]
                right += 1
            else:
                x -= nums[left]
                left += 1

        if new_result == l:
            return -1
        return result + new_result
33800