feat: add new lc problems: No.3061~3064

solution/3000-3099/3061.Calculate Trapping Rain Water/README.md

@@ -0,0 +1,76 @@
+# [3061. Calculate Trapping Rain Water](https://leetcode.cn/problems/calculate-trapping-rain-water)
+
+[English Version](/solution/3000-3099/3061.Calculate%20Trapping%20Rain%20Water/README_EN.md)
+
+<!-- tags: -->
+
+## 题目描述
+
+<!-- 这里写题目描述 -->
+
+<p>Table: <font face="monospace">Heights</font></p>
+
+<pre>
++-------------+------+
+| Column Name | Type |
++-------------+------+
+| id          | int  |
+| height      | int  |
++-------------+------+
+id is the primary key (column with unique values) for this table, and it is guaranteed to be in sequential order.
+Each row of this table contains an id and height.
+</pre>
+
+<p>Write a solution to calculate the amount of rainwater can be <strong>trapped between the bars</strong> in the landscape, considering that each bar has a <strong>width</strong> of <code>1</code> unit.</p>
+
+<p>Return <em>the result table in </em><strong>any</strong><em> order.</em></p>
+
+<p>The result format is in the following example.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> 
+Heights table:
++-----+--------+
+| id  | height |
++-----+--------+
+| 1   | 0      |
+| 2   | 1      |
+| 3   | 0      |
+| 4   | 2      |
+| 5   | 1      |
+| 6   | 0      |
+| 7   | 1      |
+| 8   | 3      |
+| 9   | 2      |
+| 10  | 1      |
+| 11  | 2      |
+| 12  | 1      |
++-----+--------+
+<strong>Output:</strong> 
++---------------------+
+| total_trapped_water | 
++---------------------+
+| 6                   | 
++---------------------+
+<strong>Explanation:</strong> 
+<img src="https://assets.leetcode.com/uploads/2024/02/26/trapping_rain_water.png" style="width:500px; height:200px;" />
+
+The elevation map depicted above (in the black section) is graphically represented with the x-axis denoting the id and the y-axis representing the heights [0,1,0,2,1,0,1,3,2,1,2,1]. In this scenario, 6 units of rainwater are trapped within the blue section.
+</pre>
+
+## 解法
+
+### 方法一
+
+<!-- tabs:start -->
+
+```sql
+
+```
+
+<!-- tabs:end -->
+
+<!-- end -->

solution/3000-3099/3061.Calculate Trapping Rain Water/README_EN.md

@@ -0,0 +1,74 @@
+# [3061. Calculate Trapping Rain Water](https://leetcode.com/problems/calculate-trapping-rain-water)
+
+[中文文档](/solution/3000-3099/3061.Calculate%20Trapping%20Rain%20Water/README.md)
+
+<!-- tags: -->
+
+## Description
+
+<p>Table: <font face="monospace">Heights</font></p>
+
+<pre>
++-------------+------+
+| Column Name | Type |
++-------------+------+
+| id          | int  |
+| height      | int  |
++-------------+------+
+id is the primary key (column with unique values) for this table, and it is guaranteed to be in sequential order.
+Each row of this table contains an id and height.
+</pre>
+
+<p>Write a solution to calculate the amount of rainwater can be <strong>trapped between the bars</strong> in the landscape, considering that each bar has a <strong>width</strong> of <code>1</code> unit.</p>
+
+<p>Return <em>the result table in </em><strong>any</strong><em> order.</em></p>
+
+<p>The result format is in the following example.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> 
+Heights table:
++-----+--------+
+| id  | height |
++-----+--------+
+| 1   | 0      |
+| 2   | 1      |
+| 3   | 0      |
+| 4   | 2      |
+| 5   | 1      |
+| 6   | 0      |
+| 7   | 1      |
+| 8   | 3      |
+| 9   | 2      |
+| 10  | 1      |
+| 11  | 2      |
+| 12  | 1      |
++-----+--------+
+<strong>Output:</strong> 
++---------------------+
+| total_trapped_water | 
++---------------------+
+| 6                   | 
++---------------------+
+<strong>Explanation:</strong> 
+<img src="https://assets.leetcode.com/uploads/2024/02/26/trapping_rain_water.png" style="width:500px; height:200px;" />
+
+The elevation map depicted above (in the black section) is graphically represented with the x-axis denoting the id and the y-axis representing the heights [0,1,0,2,1,0,1,3,2,1,2,1]. In this scenario, 6 units of rainwater are trapped within the blue section.
+</pre>
+
+## Solutions
+
+### Solution 1
+
+<!-- tabs:start -->
+
+```sql
+
+```
+
+<!-- tabs:end -->
+
+<!-- end -->

solution/3000-3099/3062.Winner of the Linked List Game/README.md

@@ -0,0 +1,112 @@
+# [3062. Winner of the Linked List Game](https://leetcode.cn/problems/winner-of-the-linked-list-game)
+
+[English Version](/solution/3000-3099/3062.Winner%20of%20the%20Linked%20List%20Game/README_EN.md)
+
+<!-- tags: -->
+
+## 题目描述
+
+<!-- 这里写题目描述 -->
+
+<p>You are given the <code>head</code> of a linked list of <strong>even</strong> length containing integers.</p>
+
+<p>Each <strong>odd-indexed</strong> node contains an odd integer and each <strong>even-indexed</strong> node contains an even integer.</p>
+
+<p>We call each even-indexed node and its next node a <strong>pair</strong>, e.g., the nodes with indices <code>0</code> and <code>1</code> are a pair, the nodes with indices <code>2</code> and <code>3</code> are a pair, and so on.</p>
+
+<p>For every <strong>pair</strong>, we compare the values of the nodes in the pair:</p>
+
+<ul>
+	<li>If the odd-indexed node is higher, the <code>&quot;Odd&quot;</code> team gets a point.</li>
+	<li>If the even-indexed node is higher, the <code>&quot;Even&quot;</code> team gets a point.</li>
+</ul>
+
+<p>Return <em>the name of the team with the <strong>higher</strong> points, if the points are equal, return</em> <code>&quot;Tie&quot;</code>.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1: </strong></p>
+
+<div class="example-block" style="border-color: var(--border-tertiary); border-left-width: 2px; color: var(--text-secondary); font-size: .875rem; margin-bottom: 1rem; margin-top: 1rem; overflow: visible; padding-left: 1rem;">
+<p><strong>Input: </strong> <span class="example-io" style="font-family: Menlo,sans-serif; font-size: 0.85rem;"> head = [2,1] </span></p>
+
+<p><strong>Output: </strong> <span class="example-io" style="font-family: Menlo,sans-serif; font-size: 0.85rem;"> &quot;Even&quot; </span></p>
+
+<p><strong>Explanation: </strong> There is only one pair in this linked list and that is <code>(2,1)</code>. Since <code>2 &gt; 1</code>, the Even team gets the point.</p>
+
+<p>Hence, the answer would be <code>&quot;Even&quot;</code>.</p>
+</div>
+
+<p><strong class="example">Example 2: </strong></p>
+
+<div class="example-block" style="border-color: var(--border-tertiary); border-left-width: 2px; color: var(--text-secondary); font-size: .875rem; margin-bottom: 1rem; margin-top: 1rem; overflow: visible; padding-left: 1rem;">
+<p><strong>Input: </strong> <span class="example-io" style="font-family: Menlo,sans-serif; font-size: 0.85rem;"> head = [2,5,4,7,20,5] </span></p>
+
+<p><strong>Output: </strong> <span class="example-io" style="font-family: Menlo,sans-serif; font-size: 0.85rem;"> &quot;Odd&quot; </span></p>
+
+<p><strong>Explanation: </strong> There are <code>3</code> pairs in this linked list. Let&#39;s investigate each pair individually:</p>
+
+<p><code>(2,5)</code> -&gt; Since <code>2 &lt; 5</code>, The Odd team gets the point.</p>
+
+<p><code>(4,7)</code> -&gt; Since <code>4 &lt; 7</code>, The Odd team gets the point.</p>
+
+<p><code>(20,5)</code> -&gt; Since <code>20 &gt; 5</code>, The Even team gets the point.</p>
+
+<p>The Odd team earned <code>2</code> points while the Even team got <code>1</code> point and the Odd team has the higher points.</p>
+
+<p>Hence, the answer would be <code>&quot;Odd&quot;</code>.</p>
+</div>
+
+<p><strong class="example">Example 3: </strong></p>
+
+<div class="example-block" style="border-color: var(--border-tertiary); border-left-width: 2px; color: var(--text-secondary); font-size: .875rem; margin-bottom: 1rem; margin-top: 1rem; overflow: visible; padding-left: 1rem;">
+<p><strong>Input: </strong> <span class="example-io" style="font-family: Menlo,sans-serif; font-size: 0.85rem;"> head = [4,5,2,1] </span></p>
+
+<p><strong>Output: </strong> <span class="example-io" style="font-family: Menlo,sans-serif; font-size: 0.85rem;"> &quot;Tie&quot; </span></p>
+
+<p><strong>Explanation: </strong> There are <code>2</code> pairs in this linked list. Let&#39;s investigate each pair individually:</p>
+
+<p><code>(4,5)</code> -&gt; Since <code>4 &lt; 5</code>, the Odd team gets the point.</p>
+
+<p><code>(2,1)</code> -&gt; Since <code>2 &gt; 1</code>, the Even team gets the point.</p>
+
+<p>Both teams earned <code>1</code> point.</p>
+
+<p>Hence, the answer would be <code>&quot;Tie&quot;</code>.</p>
+</div>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li>The number of nodes in the list is in the range <code>[2, 100]</code>.</li>
+	<li>The number of nodes in the list is even.</li>
+	<li><code>1 &lt;= Node.val &lt;= 100</code></li>
+	<li>The value of each odd-indexed node is odd.</li>
+	<li>The value of each even-indexed node is even.</li>
+</ul>
+
+## 解法
+
+### 方法一
+
+<!-- tabs:start -->
+
+```python
+
+```
+
+```java
+
+```
+
+```cpp
+
+```
+
+```go
+
+```
+
+<!-- tabs:end -->
+
+<!-- end -->

solution/3000-3099/3062.Winner of the Linked List Game/README_EN.md

@@ -0,0 +1,110 @@
+# [3062. Winner of the Linked List Game](https://leetcode.com/problems/winner-of-the-linked-list-game)
+
+[中文文档](/solution/3000-3099/3062.Winner%20of%20the%20Linked%20List%20Game/README.md)
+
+<!-- tags: -->
+
+## Description
+
+<p>You are given the <code>head</code> of a linked list of <strong>even</strong> length containing integers.</p>
+
+<p>Each <strong>odd-indexed</strong> node contains an odd integer and each <strong>even-indexed</strong> node contains an even integer.</p>
+
+<p>We call each even-indexed node and its next node a <strong>pair</strong>, e.g., the nodes with indices <code>0</code> and <code>1</code> are a pair, the nodes with indices <code>2</code> and <code>3</code> are a pair, and so on.</p>
+
+<p>For every <strong>pair</strong>, we compare the values of the nodes in the pair:</p>
+
+<ul>
+	<li>If the odd-indexed node is higher, the <code>&quot;Odd&quot;</code> team gets a point.</li>
+	<li>If the even-indexed node is higher, the <code>&quot;Even&quot;</code> team gets a point.</li>
+</ul>
+
+<p>Return <em>the name of the team with the <strong>higher</strong> points, if the points are equal, return</em> <code>&quot;Tie&quot;</code>.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1: </strong></p>
+
+<div class="example-block" style="border-color: var(--border-tertiary); border-left-width: 2px; color: var(--text-secondary); font-size: .875rem; margin-bottom: 1rem; margin-top: 1rem; overflow: visible; padding-left: 1rem;">
+<p><strong>Input: </strong> <span class="example-io" style="font-family: Menlo,sans-serif; font-size: 0.85rem;"> head = [2,1] </span></p>
+
+<p><strong>Output: </strong> <span class="example-io" style="font-family: Menlo,sans-serif; font-size: 0.85rem;"> &quot;Even&quot; </span></p>
+
+<p><strong>Explanation: </strong> There is only one pair in this linked list and that is <code>(2,1)</code>. Since <code>2 &gt; 1</code>, the Even team gets the point.</p>
+
+<p>Hence, the answer would be <code>&quot;Even&quot;</code>.</p>
+</div>
+
+<p><strong class="example">Example 2: </strong></p>
+
+<div class="example-block" style="border-color: var(--border-tertiary); border-left-width: 2px; color: var(--text-secondary); font-size: .875rem; margin-bottom: 1rem; margin-top: 1rem; overflow: visible; padding-left: 1rem;">
+<p><strong>Input: </strong> <span class="example-io" style="font-family: Menlo,sans-serif; font-size: 0.85rem;"> head = [2,5,4,7,20,5] </span></p>
+
+<p><strong>Output: </strong> <span class="example-io" style="font-family: Menlo,sans-serif; font-size: 0.85rem;"> &quot;Odd&quot; </span></p>
+
+<p><strong>Explanation: </strong> There are <code>3</code> pairs in this linked list. Let&#39;s investigate each pair individually:</p>
+
+<p><code>(2,5)</code> -&gt; Since <code>2 &lt; 5</code>, The Odd team gets the point.</p>
+
+<p><code>(4,7)</code> -&gt; Since <code>4 &lt; 7</code>, The Odd team gets the point.</p>
+
+<p><code>(20,5)</code> -&gt; Since <code>20 &gt; 5</code>, The Even team gets the point.</p>
+
+<p>The Odd team earned <code>2</code> points while the Even team got <code>1</code> point and the Odd team has the higher points.</p>
+
+<p>Hence, the answer would be <code>&quot;Odd&quot;</code>.</p>
+</div>
+
+<p><strong class="example">Example 3: </strong></p>
+
+<div class="example-block" style="border-color: var(--border-tertiary); border-left-width: 2px; color: var(--text-secondary); font-size: .875rem; margin-bottom: 1rem; margin-top: 1rem; overflow: visible; padding-left: 1rem;">
+<p><strong>Input: </strong> <span class="example-io" style="font-family: Menlo,sans-serif; font-size: 0.85rem;"> head = [4,5,2,1] </span></p>
+
+<p><strong>Output: </strong> <span class="example-io" style="font-family: Menlo,sans-serif; font-size: 0.85rem;"> &quot;Tie&quot; </span></p>
+
+<p><strong>Explanation: </strong> There are <code>2</code> pairs in this linked list. Let&#39;s investigate each pair individually:</p>
+
+<p><code>(4,5)</code> -&gt; Since <code>4 &lt; 5</code>, the Odd team gets the point.</p>
+
+<p><code>(2,1)</code> -&gt; Since <code>2 &gt; 1</code>, the Even team gets the point.</p>
+
+<p>Both teams earned <code>1</code> point.</p>
+
+<p>Hence, the answer would be <code>&quot;Tie&quot;</code>.</p>
+</div>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li>The number of nodes in the list is in the range <code>[2, 100]</code>.</li>
+	<li>The number of nodes in the list is even.</li>
+	<li><code>1 &lt;= Node.val &lt;= 100</code></li>
+	<li>The value of each odd-indexed node is odd.</li>
+	<li>The value of each even-indexed node is even.</li>
+</ul>
+
+## Solutions
+
+### Solution 1
+
+<!-- tabs:start -->
+
+```python
+
+```
+
+```java
+
+```
+
+```cpp
+
+```
+
+```go
+
+```
+
+<!-- tabs:end -->
+
+<!-- end -->