add scripts and problemset

算法题/count-number-of-nice-subarrays.html

@@ -0,0 +1,36 @@
+<p>Given an array of integers <code>nums</code> and an integer <code>k</code>. A continuous subarray is called <strong>nice</strong> if there are <code>k</code> odd numbers on it.</p>
+
+
+
+<p>Return <em>the number of <strong>nice</strong> sub-arrays</em>.</p>
+
+
+
+<p>&nbsp;</p>
+
+<p><strong>Example 1:</strong></p>
+
+
+
+<pre>
+
+<strong>Input:</strong> nums = [1,1,2,1,1], k = 3
+
+<strong>Output:</strong> 2
+
+<strong>Explanation:</strong> The only sub-arrays with 3 odd numbers are [1,1,2,1] and [1,2,1,1].
+
+</pre>
+
+
+
+<p><strong>Example 2:</strong></p>
+
+
+
+<pre>
+
+<strong>Input:</strong> nums = [2,4,6], k = 1
+
+<strong>Output:</strong> 0
+