feat: add new lc problems

solution/3600-3699/3618.Split Array by Prime Indices/README.md

@@ -0,0 +1,115 @@
+---
+comments: true
+difficulty: 中等
+edit_url: https://github.com/doocs/leetcode/edit/main/solution/3600-3699/3618.Split%20Array%20by%20Prime%20Indices/README.md
+---
+
+<!-- problem:start -->
+
+# [3618. 根据质数下标分割数组](https://leetcode.cn/problems/split-array-by-prime-indices)
+
+[English Version](/solution/3600-3699/3618.Split%20Array%20by%20Prime%20Indices/README_EN.md)
+
+## 题目描述
+
+<!-- description:start -->
+
+<p>给你一个整数数组 <code>nums</code>。</p>
+
+<p>根据以下规则将 <code>nums</code> 分割成两个数组 <code>A</code> 和 <code>B</code>：</p>
+
+<ul>
+	<li><code>nums</code> 中位于&nbsp;<strong>质数 </strong>下标的元素必须放入数组 <code>A</code>。</li>
+	<li>所有其他元素必须放入数组 <code>B</code>。</li>
+</ul>
+
+<p>返回两个数组和的&nbsp;<strong>绝对&nbsp;</strong>差值：<code>|sum(A) - sum(B)|</code>。</p>
+
+<p><strong>质数&nbsp;</strong>是一个大于 1 的自然数，它只有两个因子，1和它本身。</p>
+
+<p><strong>注意</strong>：空数组的和为 0。</p>
+
+<p>&nbsp;</p>
+
+<p><strong class="example">示例 1:</strong></p>
+
+<div class="example-block">
+<p><strong>输入:</strong> <span class="example-io">nums = [2,3,4]</span></p>
+
+<p><strong>输出:</strong> <span class="example-io">1</span></p>
+
+<p><strong>解释:</strong></p>
+
+<ul>
+	<li>数组中唯一的质数下标是 2，所以 <code>nums[2] = 4</code> 被放入数组 <code>A</code>。</li>
+	<li>其余元素 <code>nums[0] = 2</code> 和 <code>nums[1] = 3</code> 被放入数组 <code>B</code>。</li>
+	<li><code>sum(A) = 4</code>，<code>sum(B) = 2 + 3 = 5</code>。</li>
+	<li>绝对差值是 <code>|4 - 5| = 1</code>。</li>
+</ul>
+</div>
+
+<p><strong class="example">示例 2:</strong></p>
+
+<div class="example-block">
+<p><strong>输入:</strong> <span class="example-io">nums = [-1,5,7,0]</span></p>
+
+<p><strong>输出:</strong> <span class="example-io">3</span></p>
+
+<p><strong>解释:</strong></p>
+
+<ul>
+	<li>数组中的质数下标是 2 和 3，所以 <code>nums[2] = 7</code> 和 <code>nums[3] = 0</code> 被放入数组 <code>A</code>。</li>
+	<li>其余元素 <code>nums[0] = -1</code> 和 <code>nums[1] = 5</code> 被放入数组 <code>B</code>。</li>
+	<li><code>sum(A) = 7 + 0 = 7</code>，<code>sum(B) = -1 + 5 = 4</code>。</li>
+	<li>绝对差值是 <code>|7 - 4| = 3</code>。</li>
+</ul>
+</div>
+
+<p>&nbsp;</p>
+
+<p><strong>提示:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= nums.length &lt;= 10<sup>5</sup></code></li>
+	<li><code>-10<sup>9</sup> &lt;= nums[i] &lt;= 10<sup>9</sup></code></li>
+</ul>
+
+<!-- description:end -->
+
+## 解法
+
+<!-- solution:start -->
+
+### 方法一
+
+<!-- tabs:start -->
+
+#### Python3
+
+```python
+
+```
+
+#### Java
+
+```java
+
+```
+
+#### C++
+
+```cpp
+
+```
+
+#### Go
+
+```go
+
+```
+
+<!-- tabs:end -->
+
+<!-- solution:end -->
+
+<!-- problem:end -->

solution/3600-3699/3618.Split Array by Prime Indices/README_EN.md

@@ -0,0 +1,113 @@
+---
+comments: true
+difficulty: Medium
+edit_url: https://github.com/doocs/leetcode/edit/main/solution/3600-3699/3618.Split%20Array%20by%20Prime%20Indices/README_EN.md
+---
+
+<!-- problem:start -->
+
+# [3618. Split Array by Prime Indices](https://leetcode.com/problems/split-array-by-prime-indices)
+
+[中文文档](/solution/3600-3699/3618.Split%20Array%20by%20Prime%20Indices/README.md)
+
+## Description
+
+<!-- description:start -->
+
+<p>You are given an integer array <code>nums</code>.</p>
+
+<p>Split <code>nums</code> into two arrays <code>A</code> and <code>B</code> using the following rule:</p>
+
+<ul>
+	<li>Elements at <strong>prime</strong> indices in <code>nums</code> must go into array <code>A</code>.</li>
+	<li>All other elements must go into array <code>B</code>.</li>
+</ul>
+
+<p>Return the <strong>absolute</strong> difference between the sums of the two arrays: <code>|sum(A) - sum(B)|</code>.</p>
+
+<p>A <strong>prime</strong> number is a natural number greater than 1 with only two factors, 1 and itself.</p>
+
+<p><strong>Note:</strong> An empty array has a sum of 0.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">nums = [2,3,4]</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">1</span></p>
+
+<p><strong>Explanation:</strong></p>
+
+<ul>
+	<li>The only prime index in the array is 2, so <code>nums[2] = 4</code> is placed in array <code>A</code>.</li>
+	<li>The remaining elements, <code>nums[0] = 2</code> and <code>nums[1] = 3</code> are placed in array <code>B</code>.</li>
+	<li><code>sum(A) = 4</code>, <code>sum(B) = 2 + 3 = 5</code>.</li>
+	<li>The absolute difference is <code>|4 - 5| = 1</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 = [-1,5,7,0]</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">3</span></p>
+
+<p><strong>Explanation:</strong></p>
+
+<ul>
+	<li>The prime indices in the array are 2 and 3, so <code>nums[2] = 7</code> and <code>nums[3] = 0</code> are placed in array <code>A</code>.</li>
+	<li>The remaining elements, <code>nums[0] = -1</code> and <code>nums[1] = 5</code> are placed in array <code>B</code>.</li>
+	<li><code>sum(A) = 7 + 0 = 7</code>, <code>sum(B) = -1 + 5 = 4</code>.</li>
+	<li>The absolute difference is <code>|7 - 4| = 3</code>.</li>
+</ul>
+</div>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= nums.length &lt;= 10<sup>5</sup></code></li>
+	<li><code>-10<sup>9</sup> &lt;= nums[i] &lt;= 10<sup>9</sup></code></li>
+</ul>
+
+<!-- description:end -->
+
+## Solutions
+
+<!-- solution:start -->
+
+### Solution 1
+
+<!-- tabs:start -->
+
+#### Python3
+
+```python
+
+```
+
+#### Java
+
+```java
+
+```
+
+#### C++
+
+```cpp
+
+```
+
+#### Go
+
+```go
+
+```
+
+<!-- tabs:end -->
+
+<!-- solution:end -->
+
+<!-- problem:end -->

solution/3600-3699/3619.Count Islands With Total Value Divisible by K/README.md

@@ -0,0 +1,100 @@
+---
+comments: true
+difficulty: 中等
+edit_url: https://github.com/doocs/leetcode/edit/main/solution/3600-3699/3619.Count%20Islands%20With%20Total%20Value%20Divisible%20by%20K/README.md
+---
+
+<!-- problem:start -->
+
+# [3619. 总价值可以被 K 整除的岛屿数目](https://leetcode.cn/problems/count-islands-with-total-value-divisible-by-k)
+
+[English Version](/solution/3600-3699/3619.Count%20Islands%20With%20Total%20Value%20Divisible%20by%20K/README_EN.md)
+
+## 题目描述
+
+<!-- description:start -->
+
+<p>给你一个 <code>m x n</code> 的矩阵 <code>grid</code> 和一个正整数 <code>k</code>。一个&nbsp;<strong>岛屿&nbsp;</strong>是由&nbsp;<strong>正&nbsp;</strong>整数（表示陆地）组成的，并且陆地间&nbsp;<strong>四周&nbsp;</strong>连通（水平或垂直）。</p>
+
+<p>一个岛屿的总价值是该岛屿中所有单元格的值之和。</p>
+
+<p>返回总价值可以被 <code>k</code> <strong>整除&nbsp;</strong>的岛屿数量。</p>
+
+<p>&nbsp;</p>
+
+<p><strong class="example">示例 1:</strong></p>
+<img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/3600-3699/3619.Count%20Islands%20With%20Total%20Value%20Divisible%20by%20K/images/example1griddrawio-1.png" style="width: 200px; height: 200px;" />
+<div class="example-block">
+<p><strong>输入:</strong> <span class="example-io">grid = [[0,2,1,0,0],[0,5,0,0,5],[0,0,1,0,0],[0,1,4,7,0],[0,2,0,0,8]], k = 5</span></p>
+
+<p><strong>输出:</strong> <span class="example-io">2</span></p>
+
+<p><strong>解释:</strong></p>
+
+<p>网格中包含四个岛屿。蓝色高亮显示的岛屿的总价值可以被 5 整除，而红色高亮显示的岛屿则不能。</p>
+</div>
+
+<p><strong class="example">示例 2:</strong></p>
+<img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/3600-3699/3619.Count%20Islands%20With%20Total%20Value%20Divisible%20by%20K/images/example2griddrawio.png" style="width: 200px; height: 150px;" />
+<div class="example-block">
+<p><strong>输入:</strong> <span class="example-io">grid = [[3,0,3,0], [0,3,0,3], [3,0,3,0]], k = 3</span></p>
+
+<p><strong>输出:</strong> <span class="example-io">6</span></p>
+
+<p><strong>解释:</strong></p>
+
+<p>网格中包含六个岛屿，每个岛屿的总价值都可以被 3 整除。</p>
+</div>
+
+<p>&nbsp;</p>
+
+<p><strong>提示:</strong></p>
+
+<ul>
+	<li><code>m == grid.length</code></li>
+	<li><code>n == grid[i].length</code></li>
+	<li><code>1 &lt;= m, n &lt;= 1000</code></li>
+	<li><code>1 &lt;= m * n &lt;= 10<sup>5</sup></code></li>
+	<li><code>0 &lt;= grid[i][j] &lt;= 10<sup>6</sup></code></li>
+	<li><code>1 &lt;= k &lt; = 10<sup>6</sup></code></li>
+</ul>
+
+<!-- description:end -->
+
+## 解法
+
+<!-- solution:start -->
+
+### 方法一
+
+<!-- tabs:start -->
+
+#### Python3
+
+```python
+
+```
+
+#### Java
+
+```java
+
+```
+
+#### C++
+
+```cpp
+
+```
+
+#### Go
+
+```go
+
+```
+
+<!-- tabs:end -->
+
+<!-- solution:end -->
+
+<!-- problem:end -->