feat: add solutions to lc problem: No.3034

solution/3000-3099/3034.Number of Subarrays That Match a Pattern I/Solution.cpp

@@ -1,25 +1,23 @@
 class Solution {
 public:
     int countMatchingSubarrays(vector<int>& nums, vector<int>& pattern) {
-        assert(nums.size() >= 2 && nums.size() <= 100);
-        for (int x : nums) {
-            assert(x >= 1 && x <= 1000000000);
-        }
-        const int m = pattern.size();
-        assert(m >= 1 && m < nums.size());
-        for (int x : pattern) {
-            assert(abs(x) <= 1);
-        }
-        int r = 0;
-        for (int i = 0; i + m < nums.size(); ++i) {
-            bool mark = true;
-            for (int k = 0; mark && k < m; ++k) {
-                mark = (pattern[k] == 1 && nums[i + k + 1] > nums[i + k])
-                    || (pattern[k] == 0 && nums[i + k + 1] == nums[i + k])
-                    || (pattern[k] == -1 && nums[i + k + 1] < nums[i + k]); 
+        int n = nums.size();
+        int m = pattern.size();
+        int c = 0;
+        for (int i = 0; i <= n - m - 1; i++) {
+            bool flag = true;
+            for (int j = 0; j < m; j++) {
+                if ((pattern[j] == 1 && nums[i + j + 1] <= nums[i + j]) ||
+                    (pattern[j] == 0 && nums[i + j + 1] != nums[i + j]) ||
+                    (pattern[j] == -1 && nums[i + j + 1] >= nums[i + j])) {
+                        flag = false;
+                        break;
+                }
+            }
+            if (flag) {
+                c++;
             }
-            r += mark;
         }
-        return r;
+        return c;
     }
 };