leetcode刷题python之长度最小的子数组

字符串操作，使用了双指针算法，但是感觉很费时间啊。。难道是我自己也有写的不好的地方？

class Solution:
    def minSubArrayLen(self, s: int, nums: List[int]) -> int:
        # if not nums: return 0
        left = 0
        right = 0
        min_len = float("inf")
        while right < len(nums):
            right += 1
            while sum(nums[left: right]) >= s:
                if right - left < min_len:
                    min_len = right - left
                left += 1
        return min_len if min_len != float("inf") else 0