Leetcode 713. Subarray Product Less Than K

You have an array nums and an integer k. Find the total number of contiguous subarrays where the product of all the elements in the subarray is less than k. Example 1: Input: `nums = [10, 5, 2, 6]`, `k = 100` Output: `8` Explanation: The subarrays that have a product less than 100 are : `[10], [5], [2], [6], [10, 5], [5, 2], [2, 6], [5, 2, 6]`. Example 2: Input: `nums = [1, 2, 3]`, `k = 0` Output: `0` Explanation: No subarray's product is less than 0.