feat: add new lc problems

Author: yanglbme

solution/2200-2299/2230.The Users That Are Eligible for Discount/README.md

@@ -0,0 +1,79 @@
+# [2230. The Users That Are Eligible for Discount](https://leetcode-cn.com/problems/the-users-that-are-eligible-for-discount)
+
+[English Version](/solution/2200-2299/2230.The%20Users%20That%20Are%20Eligible%20for%20Discount/README_EN.md)
+
+## 题目描述
+
+<!-- 这里写题目描述 -->
+
+<p>Table: <code>Purchases</code></p>
+
+<pre>
++-------------+----------+
+| Column Name | Type     |
++-------------+----------+
+| user_id     | int      |
+| time_stamp  | datetime |
+| amount      | int      |
++-------------+----------+
+(user_id, time_stamp) is the primary key for this table.
+Each row contains information about the purchase time and the amount paid for the user with ID user_id.
+</pre>
+
+<p>&nbsp;</p>
+
+<p>A user is eligible for a discount if they had a purchase in the inclusive interval of time <code>[startDate, endDate]</code> with at least <code>minAmount</code> amount.</p>
+
+<p>Write an SQL query to report the IDs of the users that are eligible for a discount.</p>
+
+<p>Return the result table ordered by <code>user_id</code>.</p>
+
+<p>The query result format is in the following example.</p>
+
+<p>&nbsp;</p>
+<p><strong>Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> 
+Purchases table:
++---------+---------------------+--------+
+| user_id | time_stamp          | amount |
++---------+---------------------+--------+
+| 1       | 2022-04-20 09:03:00 | 4416   |
+| 2       | 2022-03-19 19:24:02 | 678    |
+| 3       | 2022-03-18 12:03:09 | 4523   |
+| 3       | 2022-03-30 09:43:42 | 626    |
++---------+---------------------+--------+
+startDate = 2022-03-08, endDate = 2022-03-20, minAmount = 1000
+<strong>Output:</strong> 
++---------+
+| user_id |
++---------+
+| 3       |
++---------+
+<strong>Explanation:</strong>
+Out of the three users, only User 3 is eligible for a discount.
+ - User 1 had one purchase with at least minAmount amount, but not within the time interval.
+ - User 2 had one purchase within the time interval, but with less than minAmount amount.
+ - User 3 is the only user who had a purchase that satisfies both conditions.
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Important Note:</strong> This problem is basically the same as <a href="https://leetcode.com/problems/the-number-of-users-that-are-eligible-for-discount/">The Number of Users That Are Eligible for Discount</a>.</p>
+
+
+## 解法
+
+<!-- 这里可写通用的实现逻辑 -->
+
+<!-- tabs:start -->
+
+### **SQL**
+
+<!-- 这里可写当前语言的特殊实现逻辑 -->
+
+```sql
+
+```
+
+<!-- tabs:end -->

solution/2200-2299/2230.The Users That Are Eligible for Discount/README_EN.md

@@ -0,0 +1,73 @@
+# [2230. The Users That Are Eligible for Discount](https://leetcode.com/problems/the-users-that-are-eligible-for-discount)
+
+[中文文档](/solution/2200-2299/2230.The%20Users%20That%20Are%20Eligible%20for%20Discount/README.md)
+
+## Description
+
+<p>Table: <code>Purchases</code></p>
+
+<pre>
++-------------+----------+
+| Column Name | Type     |
++-------------+----------+
+| user_id     | int      |
+| time_stamp  | datetime |
+| amount      | int      |
++-------------+----------+
+(user_id, time_stamp) is the primary key for this table.
+Each row contains information about the purchase time and the amount paid for the user with ID user_id.
+</pre>
+
+<p>&nbsp;</p>
+
+<p>A user is eligible for a discount if they had a purchase in the inclusive interval of time <code>[startDate, endDate]</code> with at least <code>minAmount</code> amount.</p>
+
+<p>Write an SQL query to report the IDs of the users that are eligible for a discount.</p>
+
+<p>Return the result table ordered by <code>user_id</code>.</p>
+
+<p>The query result format is in the following example.</p>
+
+<p>&nbsp;</p>
+<p><strong>Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> 
+Purchases table:
++---------+---------------------+--------+
+| user_id | time_stamp          | amount |
++---------+---------------------+--------+
+| 1       | 2022-04-20 09:03:00 | 4416   |
+| 2       | 2022-03-19 19:24:02 | 678    |
+| 3       | 2022-03-18 12:03:09 | 4523   |
+| 3       | 2022-03-30 09:43:42 | 626    |
++---------+---------------------+--------+
+startDate = 2022-03-08, endDate = 2022-03-20, minAmount = 1000
+<strong>Output:</strong> 
++---------+
+| user_id |
++---------+
+| 3       |
++---------+
+<strong>Explanation:</strong>
+Out of the three users, only User 3 is eligible for a discount.
+ - User 1 had one purchase with at least minAmount amount, but not within the time interval.
+ - User 2 had one purchase within the time interval, but with less than minAmount amount.
+ - User 3 is the only user who had a purchase that satisfies both conditions.
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Important Note:</strong> This problem is basically the same as <a href="https://leetcode.com/problems/the-number-of-users-that-are-eligible-for-discount/">The Number of Users That Are Eligible for Discount</a>.</p>
+
+
+## Solutions
+
+<!-- tabs:start -->
+
+### **SQL**
+
+```sql
+
+```
+
+<!-- tabs:end -->

solution/2200-2299/2231.Largest Number After Digit Swaps by Parity/README.md

@@ -0,0 +1,77 @@
+# [2231. 按奇偶性交换后的最大数字](https://leetcode-cn.com/problems/largest-number-after-digit-swaps-by-parity)
+
+[English Version](/solution/2200-2299/2231.Largest%20Number%20After%20Digit%20Swaps%20by%20Parity/README_EN.md)
+
+## 题目描述
+
+<!-- 这里写题目描述 -->
+
+<p>给你一个正整数 <code>num</code> 。你可以交换 <code>num</code> 中 <strong>奇偶性</strong> 相同的任意两位数字（即，都是奇数或者偶数）。</p>
+
+<p>返回交换 <strong>任意</strong> 次之后 <code>num</code> 的 <strong>最大</strong> 可能值<em>。</em></p>
+
+<p>&nbsp;</p>
+
+<p><strong>示例 1：</strong></p>
+
+<pre><strong>输入：</strong>num = 1234
+<strong>输出：</strong>3412
+<strong>解释：</strong>交换数字 3 和数字 1 ，结果得到 3214 。
+交换数字 2 和数字 4 ，结果得到 3412 。
+注意，可能存在其他交换序列，但是可以证明 3412 是最大可能值。
+注意，不能交换数字 4 和数字 1 ，因为它们奇偶性不同。
+</pre>
+
+<p><strong>示例 2：</strong></p>
+
+<pre><strong>输入：</strong>num = 65875
+<strong>输出：</strong>87655
+<strong>解释：</strong>交换数字 8 和数字 6 ，结果得到 85675 。
+交换数字 5 和数字 7 ，结果得到 87655 。
+注意，可能存在其他交换序列，但是可以证明 87655 是最大可能值。
+</pre>
+
+<p>&nbsp;</p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li><code>1 &lt;= num &lt;= 10<sup>9</sup></code></li>
+</ul>
+
+
+## 解法
+
+<!-- 这里可写通用的实现逻辑 -->
+
+<!-- tabs:start -->
+
+### **Python3**
+
+<!-- 这里可写当前语言的特殊实现逻辑 -->
+
+```python
+
+```
+
+### **Java**
+
+<!-- 这里可写当前语言的特殊实现逻辑 -->
+
+```java
+
+```
+
+### **TypeScript**
+
+```ts
+
+```
+
+### **...**
+
+```
+
+```
+
+<!-- tabs:end -->

solution/2200-2299/2231.Largest Number After Digit Swaps by Parity/README_EN.md

@@ -0,0 +1,69 @@
+# [2231. Largest Number After Digit Swaps by Parity](https://leetcode.com/problems/largest-number-after-digit-swaps-by-parity)
+
+[中文文档](/solution/2200-2299/2231.Largest%20Number%20After%20Digit%20Swaps%20by%20Parity/README.md)
+
+## Description
+
+<p>You are given a positive integer <code>num</code>. You may swap any two digits of <code>num</code> that have the same <strong>parity</strong> (i.e. both odd digits or both even digits).</p>
+
+<p>Return<em> the <strong>largest</strong> possible value of </em><code>num</code><em> after <strong>any</strong> number of swaps.</em></p>
+
+<p>&nbsp;</p>
+<p><strong>Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> num = 1234
+<strong>Output:</strong> 3412
+<strong>Explanation:</strong> Swap the digit 3 with the digit 1, this results in the number 3214.
+Swap the digit 2 with the digit 4, this results in the number 3412.
+Note that there may be other sequences of swaps but it can be shown that 3412 is the largest possible number.
+Also note that we may not swap the digit 4 with the digit 1 since they are of different parities.
+</pre>
+
+<p><strong>Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> num = 65875
+<strong>Output:</strong> 87655
+<strong>Explanation:</strong> Swap the digit 8 with the digit 6, this results in the number 85675.
+Swap the first digit 5 with the digit 7, this results in the number 87655.
+Note that there may be other sequences of swaps but it can be shown that 87655 is the largest possible number.
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= num &lt;= 10<sup>9</sup></code></li>
+</ul>
+
+
+## Solutions
+
+<!-- tabs:start -->
+
+### **Python3**
+
+```python
+
+```
+
+### **Java**
+
+```java
+
+```
+
+### **TypeScript**
+
+```ts
+
+```
+
+### **...**
+
+```
+
+```
+
+<!-- tabs:end -->

solution/2200-2299/2232.Minimize Result by Adding Parentheses to Expression/README.md

@@ -0,0 +1,89 @@
+# [2232. 向表达式添加括号后的最小结果](https://leetcode-cn.com/problems/minimize-result-by-adding-parentheses-to-expression)
+
+[English Version](/solution/2200-2299/2232.Minimize%20Result%20by%20Adding%20Parentheses%20to%20Expression/README_EN.md)
+
+## 题目描述
+
+<!-- 这里写题目描述 -->
+
+<p>给你一个下标从 <strong>0</strong> 开始的字符串 <code>expression</code> ，格式为 <code>"&lt;num1&gt;+&lt;num2&gt;"</code> ，其中 <code>&lt;num1&gt;</code> 和 <code>&lt;num2&gt;</code> 表示正整数。</p>
+
+<p>请你向 <code>expression</code> 中添加一对括号，使得在添加之后， <code>expression</code> 仍然是一个有效的数学表达式，并且计算后可以得到 <strong>最小</strong> 可能值。左括号 <strong>必须</strong> 添加在 <code>'+'</code> 的左侧，而右括号必须添加在 <code>'+'</code> 的右侧。</p>
+
+<p>返回添加一对括号后形成的表达式&nbsp;<code>expression</code> ，且满足<em> </em><code>expression</code><em> </em>计算得到 <strong>最小</strong> 可能值<em>。</em>如果存在多个答案都能产生相同结果，返回任意一个答案。</p>
+
+<p>生成的输入满足：<code>expression</code> 的原始值和添加满足要求的任一对括号之后 <code>expression</code> 的值，都符合 32-bit 带符号整数范围。</p>
+
+<p>&nbsp;</p>
+
+<p><strong>示例 1：</strong></p>
+
+<pre><strong>输入：</strong>expression = "247+38"
+<strong>输出：</strong>"2(47+38)"
+<strong>解释：</strong>表达式计算得到 2 * (47 + 38) = 2 * 85 = 170 。
+注意 "2(4)7+38" 不是有效的结果，因为右括号必须添加在 <code>'+' 的右侧。</code>
+可以证明 170 是最小可能值。
+</pre>
+
+<p><strong>示例 2：</strong></p>
+
+<pre><strong>输入：</strong>expression = "12+34"
+<strong>输出：</strong>"1(2+3)4"
+<strong>解释：</strong>表达式计算得到 1 * (2 + 3) * 4 = 1 * 5 * 4 = 20 。
+</pre>
+
+<p><strong>示例 3：</strong></p>
+
+<pre><strong>输入：</strong>expression = "999+999"
+<strong>输出：</strong>"(999+999)"
+<strong>解释：</strong>表达式计算得到 999 + 999 = 1998 。
+</pre>
+
+<p>&nbsp;</p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li><code>3 &lt;= expression.length &lt;= 10</code></li>
+	<li><code>expression</code> 仅由数字 <code>'1'</code> 到 <code>'9'</code> 和 <code>'+'</code> 组成</li>
+	<li><code>expression</code> 由数字开始和结束</li>
+	<li><code>expression</code> 恰好仅含有一个 <code>'+'</code>.</li>
+	<li><code>expression</code> 的原始值和添加满足要求的任一对括号之后 <code>expression</code> 的值，都符合 32-bit 带符号整数范围</li>
+</ul>
+
+
+## 解法
+
+<!-- 这里可写通用的实现逻辑 -->
+
+<!-- tabs:start -->
+
+### **Python3**
+
+<!-- 这里可写当前语言的特殊实现逻辑 -->
+
+```python
+
+```
+
+### **Java**
+
+<!-- 这里可写当前语言的特殊实现逻辑 -->
+
+```java
+
+```
+
+### **TypeScript**
+
+```ts
+
+```
+
+### **...**
+
+```
+
+```
+
+<!-- tabs:end -->