Python solution beats 99%
There is a simple solution, by enumerate list and count the combinations of numbers.\n\n\nclass Solution:\n    def numberOfSubarrays(self, nums: List[int], k: i
There is a simple solution, by enumerate list and count the combinations of numbers.\n\n```\nclass Solution:\n    def numberOfSubarrays(self, nums: List[int], k: int) -> int:\n        # count\n        arr = []\n        for i, x in enumerate(nums):\n            if x % 2 != 0:\n                arr.append(i)   \n        arr.append(len(nums))\n        \n        # not satisify\n        if len(arr) <= k:\n            return 0\n        \n        # calculate\n        count = 0\n        count +=  (arr[0] + 1) * (arr[k] - arr[k-1])\n        for i in range(k+1, len(arr)):\n            count += (arr[i-k] - arr[i-k-1]) * (arr[i] - arr[i-1])\n            \n        return count \n```
[]