mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 15:31:43 +08:00
58 lines
2.7 KiB
HTML
58 lines
2.7 KiB
HTML
<p>You are given an integer array <code>nums</code> having length <code>n</code> and a 2D integer array <code>queries</code> where <code>queries[i] = [idx, val]</code>.</p>
|
|
|
|
<p>For each query:</p>
|
|
|
|
<ol>
|
|
<li>Update <code>nums[idx] = val</code>.</li>
|
|
<li>Choose an integer <code>k</code> with <code>1 <= k < n</code> to split the array into the non-empty prefix <code>nums[0..k-1]</code> and suffix <code>nums[k..n-1]</code> such that the sum of the counts of <strong>distinct</strong> <span data-keyword="prime-number">prime</span> values in each part is <strong>maximum</strong>.</li>
|
|
</ol>
|
|
|
|
<p><strong data-end="513" data-start="504">Note:</strong> The changes made to the array in one query persist into the next query.</p>
|
|
|
|
<p>Return an array containing the result for each query, in the order they are given.</p>
|
|
|
|
<p> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
|
|
<div class="example-block">
|
|
<p><strong>Input:</strong> <span class="example-io">nums = [2,1,3,1,2], queries = [[1,2],[3,3]]</span></p>
|
|
|
|
<p><strong>Output:</strong> <span class="example-io">[3,4]</span></p>
|
|
|
|
<p><strong>Explanation:</strong></p>
|
|
|
|
<ul>
|
|
<li>Initially <code>nums = [2, 1, 3, 1, 2]</code>.</li>
|
|
<li>After 1<sup>st</sup> query, <code>nums = [2, 2, 3, 1, 2]</code>. Split <code>nums</code> into <code>[2]</code> and <code>[2, 3, 1, 2]</code>. <code>[2]</code> consists of 1 distinct prime and <code>[2, 3, 1, 2]</code> consists of 2 distinct primes. Hence, the answer for this query is <code>1 + 2 = 3</code>.</li>
|
|
<li>After 2<sup>nd</sup> query, <code>nums = [2, 2, 3, 3, 2]</code>. Split <code>nums</code> into <code>[2, 2, 3]</code> and <code>[3, 2]</code> with an answer of <code>2 + 2 = 4</code>.</li>
|
|
<li>The output is <code>[3, 4]</code>.</li>
|
|
</ul>
|
|
</div>
|
|
|
|
<p><strong class="example">Example 2:</strong></p>
|
|
|
|
<div class="example-block">
|
|
<p><strong>Input:</strong> <span class="example-io">nums = [2,1,4], queries = [[0,1]]</span></p>
|
|
|
|
<p><strong>Output:</strong> <span class="example-io">[0]</span></p>
|
|
|
|
<p><strong>Explanation:</strong></p>
|
|
|
|
<ul>
|
|
<li>Initially <code>nums = [2, 1, 4]</code>.</li>
|
|
<li>After 1<sup>st</sup> query, <code>nums = [1, 1, 4]</code>. There are no prime numbers in <code>nums</code>, hence the answer for this query is 0.</li>
|
|
<li>The output is <code>[0]</code>.</li>
|
|
</ul>
|
|
</div>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>2 <= n == nums.length <= 5 * 10<sup>4</sup></code></li>
|
|
<li><code>1 <= queries.length <= 5 * 10<sup>4</sup></code></li>
|
|
<li><code>1 <= nums[i] <= 10<sup>5</sup></code></li>
|
|
<li><code>0 <= queries[i][0] < nums.length</code></li>
|
|
<li><code>1 <= queries[i][1] <= 10<sup>5</sup></code></li>
|
|
</ul>
|