feat: add solutions to lc/lcof2 problems: No.9

lcof2/剑指 Offer II 009. 乘积小于 K 的子数组/README.md

@@ -111,6 +111,31 @@ func numSubarrayProductLessThanK(nums []int, k int) int {
 }
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int numSubarrayProductLessThanK(vector<int>& nums, int k) {
+        int left = 0, right;
+        long mul = 1;
+        int count = 0;
+
+        for (right = 0; right < nums.size(); right++) {
+            mul *= nums[right];
+
+            while(left <= right && mul >= k) {
+                mul /= nums[left++];
+            }
+
+            count += right >= left? right - left + 1: 0;
+        }
+
+        return count;
+    }
+};
+```
+
 ### **...**
 
 ```

lcof2/剑指 Offer II 009. 乘积小于 K 的子数组/Solution.cpp

@@ -0,0 +1,20 @@
+class Solution {
+public:
+    int numSubarrayProductLessThanK(vector<int>& nums, int k) {
+        int left = 0, right;
+        long mul = 1;
+        int count = 0;
+
+        for (right = 0; right < nums.size(); right++) {
+            mul *= nums[right];
+
+            while(left <= right && mul >= k) {
+                mul /= nums[left++];
+            }
+
+            count += right >= left? right - left + 1: 0;
+        }
+
+        return count;
+    }
+};

solution/0700-0799/0713.Subarray Product Less Than K/README.md

@@ -34,6 +34,32 @@
 
 <!-- tabs:start -->
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int numSubarrayProductLessThanK(vector<int>& nums, int k) {
+        int left = 0, right;
+        long mul = 1;
+        int count = 0;
+
+        for (right = 0; right < nums.size(); right++) {
+            mul *= nums[right];
+
+            while(left <= right && mul >= k) {
+                mul /= nums[left++];
+            }
+
+            count += right >= left? right - left + 1: 0;
+        }
+
+        return count;
+    }
+};
+```
+
+
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->

solution/0700-0799/0713.Subarray Product Less Than K/README_EN.md

@@ -42,6 +42,32 @@ Note that [10, 5, 2] is not included as the product of 100 is not strictly less
 
 <!-- tabs:start -->
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int numSubarrayProductLessThanK(vector<int>& nums, int k) {
+        int left = 0, right;
+        long mul = 1;
+        int count = 0;
+
+        for (right = 0; right < nums.size(); right++) {
+            mul *= nums[right];
+
+            while(left <= right && mul >= k) {
+                mul /= nums[left++];
+            }
+
+            count += right >= left? right - left + 1: 0;
+        }
+
+        return count;
+    }
+};
+```
+
+
 ### **Python3**
 
 ```python

solution/0700-0799/0713.Subarray Product Less Than K/Solution.cpp

@@ -0,0 +1,20 @@
+class Solution {
+public:
+    int numSubarrayProductLessThanK(vector<int>& nums, int k) {
+        int left = 0, right;
+        long mul = 1;
+        int count = 0;
+
+        for (right = 0; right < nums.size(); right++) {
+            mul *= nums[right];
+
+            while(left <= right && mul >= k) {
+                mul /= nums[left++];
+            }
+
+            count += right >= left? right - left + 1: 0;
+        }
+
+        return count;
+    }
+};