feat: add new lc problems

Author: yanglbme

solution/2200-2299/2228.Users With Two Purchases Within Seven Days/README.md

@@ -0,0 +1,74 @@
+# [2228. Users With Two Purchases Within Seven Days](https://leetcode-cn.com/problems/users-with-two-purchases-within-seven-days)
+
+[English Version](/solution/2200-2299/2228.Users%20With%20Two%20Purchases%20Within%20Seven%20Days/README_EN.md)
+
+## 题目描述
+
+<!-- 这里写题目描述 -->
+
+<p>Table: <code>Purchases</code></p>
+
+<pre>
++---------------+------+
+| Column Name   | Type |
++---------------+------+
+| purchase_id   | int  |
+| user_id       | int  |
+| purchase_date | date |
++---------------+------+
+purchase_id is the primary key for this table.
+This table contains logs of the dates that users purchased from a certain retailer.
+</pre>
+
+<p>&nbsp;</p>
+
+<p>Write an SQL query to report the IDs of the users that made any two purchases <strong>at most</strong> <code>7</code> days apart.</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:
++-------------+---------+---------------+
+| purchase_id | user_id | purchase_date |
++-------------+---------+---------------+
+| 4           | 2       | 2022-03-13    |
+| 1           | 5       | 2022-02-11    |
+| 3           | 7       | 2022-06-19    |
+| 6           | 2       | 2022-03-20    |
+| 5           | 7       | 2022-06-19    |
+| 2           | 2       | 2022-06-08    |
++-------------+---------+---------------+
+<strong>Output:</strong> 
++---------+
+| user_id |
++---------+
+| 2       |
+| 7       |
++---------+
+<strong>Explanation:</strong> 
+User 2 had two purchases on 2022-03-13 and 2022-03-20. Since the second purchase is within 7 days of the first purchase, we add their ID.
+User 5 had only 1 purchase.
+User 7 had two purchases on the same day so we add their ID.
+</pre>
+
+## 解法
+
+<!-- 这里可写通用的实现逻辑 -->
+
+<!-- tabs:start -->
+
+### **SQL**
+
+<!-- 这里可写当前语言的特殊实现逻辑 -->
+
+```sql
+
+```
+
+<!-- tabs:end -->

solution/2200-2299/2228.Users With Two Purchases Within Seven Days/README_EN.md

@@ -0,0 +1,68 @@
+# [2228. Users With Two Purchases Within Seven Days](https://leetcode.com/problems/users-with-two-purchases-within-seven-days)
+
+[中文文档](/solution/2200-2299/2228.Users%20With%20Two%20Purchases%20Within%20Seven%20Days/README.md)
+
+## Description
+
+<p>Table: <code>Purchases</code></p>
+
+<pre>
++---------------+------+
+| Column Name   | Type |
++---------------+------+
+| purchase_id   | int  |
+| user_id       | int  |
+| purchase_date | date |
++---------------+------+
+purchase_id is the primary key for this table.
+This table contains logs of the dates that users purchased from a certain retailer.
+</pre>
+
+<p>&nbsp;</p>
+
+<p>Write an SQL query to report the IDs of the users that made any two purchases <strong>at most</strong> <code>7</code> days apart.</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:
++-------------+---------+---------------+
+| purchase_id | user_id | purchase_date |
++-------------+---------+---------------+
+| 4           | 2       | 2022-03-13    |
+| 1           | 5       | 2022-02-11    |
+| 3           | 7       | 2022-06-19    |
+| 6           | 2       | 2022-03-20    |
+| 5           | 7       | 2022-06-19    |
+| 2           | 2       | 2022-06-08    |
++-------------+---------+---------------+
+<strong>Output:</strong> 
++---------+
+| user_id |
++---------+
+| 2       |
+| 7       |
++---------+
+<strong>Explanation:</strong> 
+User 2 had two purchases on 2022-03-13 and 2022-03-20. Since the second purchase is within 7 days of the first purchase, we add their ID.
+User 5 had only 1 purchase.
+User 7 had two purchases on the same day so we add their ID.
+</pre>
+
+## Solutions
+
+<!-- tabs:start -->
+
+### **SQL**
+
+```sql
+
+```
+
+<!-- tabs:end -->

solution/2200-2299/2229.Check if an Array Is Consecutive/README.md

@@ -0,0 +1,89 @@
+# [2229. Check if an Array Is Consecutive](https://leetcode-cn.com/problems/check-if-an-array-is-consecutive)
+
+[English Version](/solution/2200-2299/2229.Check%20if%20an%20Array%20Is%20Consecutive/README_EN.md)
+
+## 题目描述
+
+<!-- 这里写题目描述 -->
+
+<p>Given an integer array <code>nums</code>, return <code>true</code> <em>if </em><code>nums</code><em> is <strong>consecutive</strong>, otherwise return </em><code>false</code><em>.</em></p>
+
+<p>An array is <strong>consecutive </strong>if it contains every number in the range <code>[x, x + n - 1]</code> (<strong>inclusive</strong>), where <code>x</code> is the minimum number in the array and <code>n</code> is the length of the array.</p>
+
+<p>&nbsp;</p>
+<p><strong>Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [1,3,4,2]
+<strong>Output:</strong> true
+<strong>Explanation:</strong>
+The minimum value is 1 and the length of nums is 4.
+All of the values in the range [x, x + n - 1] = [1, 1 + 4 - 1] = [1, 4] = (1, 2, 3, 4) occur in nums.
+Therefore, nums is consecutive.
+</pre>
+
+<p><strong>Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [1,3]
+<strong>Output:</strong> false
+<strong>Explanation:</strong>
+The minimum value is 1 and the length of nums is 2.
+The value 2 in the range [x, x + n - 1] = [1, 1 + 2 - 1], = [1, 2] = (1, 2) does not occur in nums.
+Therefore, nums is not consecutive.
+</pre>
+
+<p><strong>Example 3:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [3,5,4]
+<strong>Output:</strong> true
+<strong>Explanation:</strong>
+The minimum value is 3 and the length of nums is 3.
+All of the values in the range [x, x + n - 1] = [3, 3 + 3 - 1] = [3, 5] = (3, 4, 5) occur in nums.
+Therefore, nums is consecutive.
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= nums.length &lt;= 10<sup>5</sup></code></li>
+	<li><code>0 &lt;= nums[i] &lt;= 10<sup>5</sup></code></li>
+</ul>
+
+## 解法
+
+<!-- 这里可写通用的实现逻辑 -->
+
+<!-- tabs:start -->
+
+### **Python3**
+
+<!-- 这里可写当前语言的特殊实现逻辑 -->
+
+```python
+
+```
+
+### **Java**
+
+<!-- 这里可写当前语言的特殊实现逻辑 -->
+
+```java
+
+```
+
+### **TypeScript**
+
+```ts
+
+```
+
+### **...**
+
+```
+
+```
+
+<!-- tabs:end -->

solution/2200-2299/2229.Check if an Array Is Consecutive/README_EN.md

@@ -0,0 +1,81 @@
+# [2229. Check if an Array Is Consecutive](https://leetcode.com/problems/check-if-an-array-is-consecutive)
+
+[中文文档](/solution/2200-2299/2229.Check%20if%20an%20Array%20Is%20Consecutive/README.md)
+
+## Description
+
+<p>Given an integer array <code>nums</code>, return <code>true</code> <em>if </em><code>nums</code><em> is <strong>consecutive</strong>, otherwise return </em><code>false</code><em>.</em></p>
+
+<p>An array is <strong>consecutive </strong>if it contains every number in the range <code>[x, x + n - 1]</code> (<strong>inclusive</strong>), where <code>x</code> is the minimum number in the array and <code>n</code> is the length of the array.</p>
+
+<p>&nbsp;</p>
+<p><strong>Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [1,3,4,2]
+<strong>Output:</strong> true
+<strong>Explanation:</strong>
+The minimum value is 1 and the length of nums is 4.
+All of the values in the range [x, x + n - 1] = [1, 1 + 4 - 1] = [1, 4] = (1, 2, 3, 4) occur in nums.
+Therefore, nums is consecutive.
+</pre>
+
+<p><strong>Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [1,3]
+<strong>Output:</strong> false
+<strong>Explanation:</strong>
+The minimum value is 1 and the length of nums is 2.
+The value 2 in the range [x, x + n - 1] = [1, 1 + 2 - 1], = [1, 2] = (1, 2) does not occur in nums.
+Therefore, nums is not consecutive.
+</pre>
+
+<p><strong>Example 3:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [3,5,4]
+<strong>Output:</strong> true
+<strong>Explanation:</strong>
+The minimum value is 3 and the length of nums is 3.
+All of the values in the range [x, x + n - 1] = [3, 3 + 3 - 1] = [3, 5] = (3, 4, 5) occur in nums.
+Therefore, nums is consecutive.
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= nums.length &lt;= 10<sup>5</sup></code></li>
+	<li><code>0 &lt;= nums[i] &lt;= 10<sup>5</sup></code></li>
+</ul>
+
+## Solutions
+
+<!-- tabs:start -->
+
+### **Python3**
+
+```python
+
+```
+
+### **Java**
+
+```java
+
+```
+
+### **TypeScript**
+
+```ts
+
+```
+
+### **...**
+
+```
+
+```
+
+<!-- tabs:end -->