diff options
author | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
commit | a96b65cbfad7f62f3db6b2eab105e4e25c0414c5 (patch) | |
tree | e2a2b3f49f9fb741be81415266ac93e74cff42ec /other/subarr_product_less_k.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/subarr_product_less_k.cpp')
-rw-r--r-- | other/subarr_product_less_k.cpp | 23 |
1 files changed, 0 insertions, 23 deletions
diff --git a/other/subarr_product_less_k.cpp b/other/subarr_product_less_k.cpp deleted file mode 100644 index 64cb1b4..0000000 --- a/other/subarr_product_less_k.cpp +++ /dev/null @@ -1,23 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - int numSubarrayProductLessThanK(vector<int> &nums, int k) { - if (k == 0) - return 0; - int count = 0, prod = 1; - for (int low = 0, high = 0; high < nums.size(); high++) { - prod *= nums[high]; - while (low <= high && prod >= k) - prod /= nums[low++]; - count += (high - low + 1); - } - return count; - } -}; - -int main() { - Solution obj; - vector<int> nums = {10, 5, 2, 6}; - cout << obj.numSubarrayProductLessThanK(nums, 100); -} |