feat: add new lc problems

Author: yanglbme

README_EN.md

@@ -14,7 +14,7 @@
 
 ## Introduction
 
-Complete solutions to [LeetCode](https://leetcode.com/problemset/all/), [LCOF](https://leetcode.cn/problemset/lcof/) and [LCCI](https://leetcode.cn/problemset/lcci/) problems, updated daily. Please give me a [star](https://github.com/doocs/leetcode) 🌟 if you like it.
+Complete solutions to LeetCode, LCOF and LCCI problems, updated daily. Please give me a [star](https://github.com/doocs/leetcode) 🌟 if you like it.
 
 [中文文档](/README.md)
 

solution/2300-2399/2387.Median of a Row Wise Sorted Matrix/README.md

@@ -0,0 +1,96 @@
+# [2387. Median of a Row Wise Sorted Matrix](https://leetcode.cn/problems/median-of-a-row-wise-sorted-matrix)
+
+
+[English Version](/solution/2300-2399/2387.Median%20of%20a%20Row%20Wise%20Sorted%20Matrix/README_EN.md)
+
+
+## 题目描述
+
+
+<!-- 这里写题目描述 -->
+
+
+<p>Given an <code>m x n</code> matrix <code>grid</code> containing an <strong>odd</strong> number of integers where each row is sorted in <strong>non-decreasing</strong> order, return <em>the <strong>median</strong> of the matrix</em>.</p>
+
+<p>You must solve the problem in <code>O(m * log(n))</code> time complexity.</p>
+
+<p>&nbsp;</p>
+<p><strong>Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> grid = [[1,1,2],[2,3,3],[1,3,4]]
+<strong>Output:</strong> 2
+<strong>Explanation:</strong> The elements of the matrix in sorted order are 1,1,1,2,<u>2</u>,3,3,3,4. The median is 2.
+</pre>
+
+<p><strong>Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> grid = [[1,1,3,3,4]]
+<strong>Output:</strong> 3
+<strong>Explanation:</strong> The elements of the matrix in sorted order are 1,1,<u>3</u>,3,4. The median is 3.
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</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;= 500</code></li>
+	<li><code>m</code> and <code>n</code> are both odd.</li>
+	<li><code>1 &lt;= grid[i][j] &lt;= 10<sup>6</sup></code></li>
+	<li><code>grid[i]</code> is sorted in non-decreasing order.</li>
+</ul>
+
+
+
+## 解法
+
+
+<!-- 这里可写通用的实现逻辑 -->
+
+
+<!-- tabs:start -->
+
+
+### **Python3**
+
+
+<!-- 这里可写当前语言的特殊实现逻辑 -->
+
+
+```python
+
+```
+
+
+### **Java**
+
+
+<!-- 这里可写当前语言的特殊实现逻辑 -->
+
+
+```java
+
+```
+
+
+### **TypeScript**
+
+
+```ts
+
+```
+
+
+### **...**
+
+
+```
+
+
+```
+
+
+<!-- tabs:end -->

solution/2300-2399/2387.Median of a Row Wise Sorted Matrix/README_EN.md

@@ -0,0 +1,84 @@
+# [2387. Median of a Row Wise Sorted Matrix](https://leetcode.com/problems/median-of-a-row-wise-sorted-matrix)
+
+
+[中文文档](/solution/2300-2399/2387.Median%20of%20a%20Row%20Wise%20Sorted%20Matrix/README.md)
+
+
+## Description
+
+
+<p>Given an <code>m x n</code> matrix <code>grid</code> containing an <strong>odd</strong> number of integers where each row is sorted in <strong>non-decreasing</strong> order, return <em>the <strong>median</strong> of the matrix</em>.</p>
+
+<p>You must solve the problem in <code>O(m * log(n))</code> time complexity.</p>
+
+<p>&nbsp;</p>
+<p><strong>Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> grid = [[1,1,2],[2,3,3],[1,3,4]]
+<strong>Output:</strong> 2
+<strong>Explanation:</strong> The elements of the matrix in sorted order are 1,1,1,2,<u>2</u>,3,3,3,4. The median is 2.
+</pre>
+
+<p><strong>Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> grid = [[1,1,3,3,4]]
+<strong>Output:</strong> 3
+<strong>Explanation:</strong> The elements of the matrix in sorted order are 1,1,<u>3</u>,3,4. The median is 3.
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</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;= 500</code></li>
+	<li><code>m</code> and <code>n</code> are both odd.</li>
+	<li><code>1 &lt;= grid[i][j] &lt;= 10<sup>6</sup></code></li>
+	<li><code>grid[i]</code> is sorted in non-decreasing order.</li>
+</ul>
+
+
+
+## Solutions
+
+
+<!-- tabs:start -->
+
+
+### **Python3**
+
+
+```python
+
+```
+
+
+### **Java**
+
+
+```java
+
+```
+
+
+### **TypeScript**
+
+
+```ts
+
+```
+
+
+### **...**
+
+
+```
+
+
+```
+
+
+<!-- tabs:end -->

solution/2300-2399/2393.Count Strictly Increasing Subarrays/README.md

@@ -0,0 +1,98 @@
+# [2393. Count Strictly Increasing Subarrays](https://leetcode.cn/problems/count-strictly-increasing-subarrays)
+
+
+[English Version](/solution/2300-2399/2393.Count%20Strictly%20Increasing%20Subarrays/README_EN.md)
+
+
+## 题目描述
+
+
+<!-- 这里写题目描述 -->
+
+
+<p>You are given an array <code>nums</code> consisting of <strong>positive</strong> integers.</p>
+
+<p>Return <em>the number of <strong>subarrays</strong> of </em><code>nums</code><em> that are in <strong>strictly increasing</strong> order.</em></p>
+
+<p>A <strong>subarray</strong> is a <strong>contiguous</strong> part of an array.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [1,3,5,4,4,6]
+<strong>Output:</strong> 10
+<strong>Explanation:</strong> The strictly increasing subarrays are the following:
+- Subarrays of length 1: [1], [3], [5], [4], [4], [6].
+- Subarrays of length 2: [1,3], [3,5], [4,6].
+- Subarrays of length 3: [1,3,5].
+The total number of subarrays is 6 + 3 + 1 = 10.
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [1,2,3,4,5]
+<strong>Output:</strong> 15
+<strong>Explanation:</strong> Every subarray is strictly increasing. There are 15 possible subarrays that we can take.
+</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>1 &lt;= nums[i] &lt;= 10<sup>6</sup></code></li>
+</ul>
+
+
+
+## 解法
+
+
+<!-- 这里可写通用的实现逻辑 -->
+
+
+<!-- tabs:start -->
+
+
+### **Python3**
+
+
+<!-- 这里可写当前语言的特殊实现逻辑 -->
+
+
+```python
+
+```
+
+
+### **Java**
+
+
+<!-- 这里可写当前语言的特殊实现逻辑 -->
+
+
+```java
+
+```
+
+
+### **TypeScript**
+
+
+```ts
+
+```
+
+
+### **...**
+
+
+```
+
+
+```
+
+
+<!-- tabs:end -->

solution/2300-2399/2393.Count Strictly Increasing Subarrays/README_EN.md

@@ -0,0 +1,86 @@
+# [2393. Count Strictly Increasing Subarrays](https://leetcode.com/problems/count-strictly-increasing-subarrays)
+
+
+[中文文档](/solution/2300-2399/2393.Count%20Strictly%20Increasing%20Subarrays/README.md)
+
+
+## Description
+
+
+<p>You are given an array <code>nums</code> consisting of <strong>positive</strong> integers.</p>
+
+<p>Return <em>the number of <strong>subarrays</strong> of </em><code>nums</code><em> that are in <strong>strictly increasing</strong> order.</em></p>
+
+<p>A <strong>subarray</strong> is a <strong>contiguous</strong> part of an array.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [1,3,5,4,4,6]
+<strong>Output:</strong> 10
+<strong>Explanation:</strong> The strictly increasing subarrays are the following:
+- Subarrays of length 1: [1], [3], [5], [4], [4], [6].
+- Subarrays of length 2: [1,3], [3,5], [4,6].
+- Subarrays of length 3: [1,3,5].
+The total number of subarrays is 6 + 3 + 1 = 10.
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [1,2,3,4,5]
+<strong>Output:</strong> 15
+<strong>Explanation:</strong> Every subarray is strictly increasing. There are 15 possible subarrays that we can take.
+</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>1 &lt;= nums[i] &lt;= 10<sup>6</sup></code></li>
+</ul>
+
+
+
+## Solutions
+
+
+<!-- tabs:start -->
+
+
+### **Python3**
+
+
+```python
+
+```
+
+
+### **Java**
+
+
+```java
+
+```
+
+
+### **TypeScript**
+
+
+```ts
+
+```
+
+
+### **...**
+
+
+```
+
+
+```
+
+
+<!-- tabs:end -->