LeetCode 题目描述 readme

Author: LjyYano

solution/1500-1599/1574.Shortest Subarray to be Removed to Make Array Sorted/README.md

@@ -0,0 +1,86 @@
+# [1574. 删除最短的子数组使剩余数组有序](https://leetcode-cn.com/problems/shortest-subarray-to-be-removed-to-make-array-sorted)
+
+[English Version](/solution/1500-1599/1574.Shortest%20Subarray%20to%20be%20Removed%20to%20Make%20Array%20Sorted/README_EN.md)
+
+## 题目描述
+
+<!-- 这里写题目描述 -->
+<p>给你一个整数数组 <code>arr</code>&nbsp;，请你删除一个子数组（可以为空），使得 <code>arr</code>&nbsp;中剩下的元素是 <strong>非递减</strong> 的。</p>
+
+<p>一个子数组指的是原数组中连续的一个子序列。</p>
+
+<p>请你返回满足题目要求的最短子数组的长度。</p>
+
+<p>&nbsp;</p>
+
+<p><strong>示例 1：</strong></p>
+
+<pre>
+<strong>输入：</strong>arr = [1,2,3,10,4,2,3,5]
+<strong>输出：</strong>3
+<strong>解释：</strong>我们需要删除的最短子数组是 [10,4,2] ，长度为 3 。剩余元素形成非递减数组 [1,2,3,3,5] 。
+另一个正确的解为删除子数组 [3,10,4] 。</pre>
+
+<p><strong>示例 2：</strong></p>
+
+<pre>
+<strong>输入：</strong>arr = [5,4,3,2,1]
+<strong>输出：</strong>4
+<strong>解释：</strong>由于数组是严格递减的，我们只能保留一个元素。所以我们需要删除长度为 4 的子数组，要么删除 [5,4,3,2]，要么删除 [4,3,2,1]。
+</pre>
+
+<p><strong>示例 3：</strong></p>
+
+<pre>
+<strong>输入：</strong>arr = [1,2,3]
+<strong>输出：</strong>0
+<strong>解释：</strong>数组已经是非递减的了，我们不需要删除任何元素。
+</pre>
+
+<p><strong>示例 4：</strong></p>
+
+<pre>
+<strong>输入：</strong>arr = [1]
+<strong>输出：</strong>0
+</pre>
+
+<p>&nbsp;</p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li><code>1 &lt;= arr.length &lt;= 10^5</code></li>
+	<li><code>0 &lt;= arr[i] &lt;= 10^9</code></li>
+</ul>
+
+
+
+## 解法
+
+<!-- 这里可写通用的实现逻辑 -->
+
+
+<!-- tabs:start -->
+
+### **Python3**
+
+<!-- 这里可写当前语言的特殊实现逻辑 -->
+
+```python
+
+```
+
+### **Java**
+
+<!-- 这里可写当前语言的特殊实现逻辑 -->
+
+```java
+
+```
+
+### **...**
+```
+
+```
+
+<!-- tabs:end -->

solution/1500-1599/1574.Shortest Subarray to be Removed to Make Array Sorted/README_EN.md

@@ -0,0 +1,79 @@
+# [1574. Shortest Subarray to be Removed to Make Array Sorted](https://leetcode.com/problems/shortest-subarray-to-be-removed-to-make-array-sorted)
+
+[中文文档](/solution/1500-1599/1574.Shortest%20Subarray%20to%20be%20Removed%20to%20Make%20Array%20Sorted/README.md)
+
+## Description
+
+<p>Given an integer array&nbsp;<code>arr</code>, remove a&nbsp;subarray (can be empty) from&nbsp;<code>arr</code>&nbsp;such that the remaining elements in <code>arr</code>&nbsp;are <strong>non-decreasing</strong>.</p>
+
+<p>A subarray is a contiguous&nbsp;subsequence of the array.</p>
+
+<p>Return&nbsp;<em>the length of the shortest subarray to remove</em>.</p>
+
+<p>&nbsp;</p>
+<p><strong>Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> arr = [1,2,3,10,4,2,3,5]
+<strong>Output:</strong> 3
+<strong>Explanation: </strong>The shortest subarray we can remove is [10,4,2] of length 3. The remaining elements after that will be [1,2,3,3,5] which are sorted.
+Another correct solution is to remove the subarray [3,10,4].</pre>
+
+<p><strong>Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> arr = [5,4,3,2,1]
+<strong>Output:</strong> 4
+<strong>Explanation: </strong>Since the array is strictly decreasing, we can only keep a single element. Therefore we need to remove a subarray of length 4, either [5,4,3,2] or [4,3,2,1].
+</pre>
+
+<p><strong>Example 3:</strong></p>
+
+<pre>
+<strong>Input:</strong> arr = [1,2,3]
+<strong>Output:</strong> 0
+<strong>Explanation: </strong>The array is already non-decreasing. We do not need to remove any elements.
+</pre>
+
+<p><strong>Example 4:</strong></p>
+
+<pre>
+<strong>Input:</strong> arr = [1]
+<strong>Output:</strong> 0
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= arr.length &lt;= 10^5</code></li>
+	<li><code>0 &lt;= arr[i] &lt;= 10^9</code></li>
+</ul>
+
+
+## Solutions
+
+
+
+<!-- tabs:start -->
+
+### **Python3**
+
+
+```python
+
+```
+
+### **Java**
+
+
+```java
+
+```
+
+### **...**
+```
+
+```
+
+<!-- tabs:end -->

solution/1500-1599/1575.Count All Possible Routes/README.md

@@ -0,0 +1,109 @@
+# [1575. 统计所有可行路径](https://leetcode-cn.com/problems/count-all-possible-routes)
+
+[English Version](/solution/1500-1599/1575.Count%20All%20Possible%20Routes/README_EN.md)
+
+## 题目描述
+
+<!-- 这里写题目描述 -->
+<p>给你一个 <strong>互不相同</strong>&nbsp;的整数数组，其中&nbsp;<code>locations[i]</code>&nbsp;表示第&nbsp;<code>i</code>&nbsp;个城市的位置。同时给你&nbsp;<code>start</code>，<code>finish</code>&nbsp;和&nbsp;<code>fuel</code>&nbsp;分别表示出发城市、目的地城市和你初始拥有的汽油总量</p>
+
+<p>每一步中，如果你在城市 <code>i</code>&nbsp;，你可以选择任意一个城市 <code>j</code>&nbsp;，满足 &nbsp;<code>j != i</code>&nbsp;且&nbsp;<code>0 &lt;= j &lt; locations.length</code>&nbsp;，并移动到城市&nbsp;<code>j</code>&nbsp;。从城市&nbsp;<code>i</code>&nbsp;移动到&nbsp;<code>j</code>&nbsp;消耗的汽油量为&nbsp;<code>|locations[i] - locations[j]|</code>，<code>|x|</code>&nbsp;表示&nbsp;<code>x</code>&nbsp;的绝对值。</p>
+
+<p>请注意，&nbsp;<code>fuel</code>&nbsp;任何时刻都&nbsp;<strong>不能</strong>&nbsp;为负，且你&nbsp;<strong>可以</strong>&nbsp;经过任意城市超过一次（包括&nbsp;<code>start</code>&nbsp;和&nbsp;<code>finish</code>&nbsp;）。</p>
+
+<p>请你返回从<em>&nbsp;</em><code>start</code>&nbsp;到&nbsp;<code>finish</code>&nbsp;所有可能路径的数目。</p>
+
+<p>由于答案可能很大， 请将它对&nbsp;<code>10^9 + 7</code>&nbsp;取余后返回。</p>
+
+<p>&nbsp;</p>
+
+<p><strong>示例 1：</strong></p>
+
+<pre>
+<strong>输入：</strong>locations = [2,3,6,8,4], start = 1, finish = 3, fuel = 5
+<strong>输出：</strong>4
+<strong>解释：</strong>以下为所有可能路径，每一条都用了 5 单位的汽油：
+1 -&gt; 3
+1 -&gt; 2 -&gt; 3
+1 -&gt; 4 -&gt; 3
+1 -&gt; 4 -&gt; 2 -&gt; 3
+</pre>
+
+<p><strong>示例 2：</strong></p>
+
+<pre>
+<strong>输入：</strong>locations = [4,3,1], start = 1, finish = 0, fuel = 6
+<strong>输出：</strong>5
+<strong>解释：</strong>以下为所有可能的路径：
+1 -&gt; 0，使用汽油量为 fuel = 1
+1 -&gt; 2 -&gt; 0，使用汽油量为 fuel = 5
+1 -&gt; 2 -&gt; 1 -&gt; 0，使用汽油量为 fuel = 5
+1 -&gt; 0 -&gt; 1 -&gt; 0，使用汽油量为 fuel = 3
+1 -&gt; 0 -&gt; 1 -&gt; 0 -&gt; 1 -&gt; 0，使用汽油量为 fuel = 5
+</pre>
+
+<p><strong>示例 3：</strong></p>
+
+<pre>
+<strong>输入：</strong>locations = [5,2,1], start = 0, finish = 2, fuel = 3
+<strong>输出：</strong>0
+<strong>解释：</strong>没有办法只用 3 单位的汽油从 0 到达 2 。因为最短路径需要 4 单位的汽油。</pre>
+
+<p><strong>示例 4 ：</strong></p>
+
+<pre>
+<strong>输入：</strong>locations = [2,1,5], start = 0, finish = 0, fuel = 3
+<strong>输出：</strong>2
+<strong>解释：</strong>总共有两条可行路径，0 和 0 -&gt; 1 -&gt; 0 。</pre>
+
+<p><strong>示例 5：</strong></p>
+
+<pre>
+<strong>输入：</strong>locations = [1,2,3], start = 0, finish = 2, fuel = 40
+<strong>输出：</strong>615088286
+<strong>解释：</strong>路径总数为 2615088300 。将结果对 10^9 + 7 取余，得到 615088286 。
+</pre>
+
+<p>&nbsp;</p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li><code>2 &lt;= locations.length &lt;= 100</code></li>
+	<li><code>1 &lt;= locations[i] &lt;= 10^9</code></li>
+	<li>所有&nbsp;<code>locations</code>&nbsp;中的整数 <strong>互不相同</strong>&nbsp;。</li>
+	<li><code>0 &lt;= start, finish &lt;&nbsp;locations.length</code></li>
+	<li><code>1 &lt;= fuel &lt;= 200</code></li>
+</ul>
+
+
+
+## 解法
+
+<!-- 这里可写通用的实现逻辑 -->
+
+
+<!-- tabs:start -->
+
+### **Python3**
+
+<!-- 这里可写当前语言的特殊实现逻辑 -->
+
+```python
+
+```
+
+### **Java**
+
+<!-- 这里可写当前语言的特殊实现逻辑 -->
+
+```java
+
+```
+
+### **...**
+```
+
+```
+
+<!-- tabs:end -->

solution/1500-1599/1575.Count All Possible Routes/README_EN.md

@@ -0,0 +1,102 @@
+# [1575. Count All Possible Routes](https://leetcode.com/problems/count-all-possible-routes)
+
+[中文文档](/solution/1500-1599/1575.Count%20All%20Possible%20Routes/README.md)
+
+## Description
+
+<p>You are given an array of <strong>distinct</strong> positive integers locations&nbsp;where <code>locations[i]</code> represents the position of city <code>i</code>. You are also given&nbsp;integers&nbsp;<code>start</code>,&nbsp;<code>finish</code>&nbsp;and&nbsp;<code>fuel</code>&nbsp;representing the starting city, ending city, and the initial amount of fuel you have, respectively.</p>
+
+<p>At each step, if you are at city&nbsp;<code>i</code>, you can pick any city&nbsp;<code>j</code>&nbsp;such that <code>j != i</code>&nbsp;and&nbsp;<code>0 &lt;= j &lt; locations.length</code>&nbsp;and move to city <code>j</code>.&nbsp;Moving from city <code>i</code> to city <code>j</code> reduces the amount of fuel you have by&nbsp;<code>|locations[i] - locations[j]|</code>.&nbsp;Please notice that <code>|x|</code>&nbsp;denotes the absolute value of <code>x</code>.</p>
+
+<p>Notice that&nbsp;<code>fuel</code>&nbsp;<strong>cannot</strong> become negative at any point in time, and that you are <strong>allowed</strong> to visit any city more than once (including <code>start</code>&nbsp;and&nbsp;<code>finish</code>).</p>
+
+<p>Return <em>the count of all possible routes from&nbsp;</em><code>start</code>&nbsp;<em>to</em>&nbsp;<code>finish</code>.</p>
+
+<p>Since the answer&nbsp;may be too large,&nbsp;return it modulo&nbsp;<code>10^9 + 7</code>.</p>
+
+<p>&nbsp;</p>
+<p><strong>Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> locations = [2,3,6,8,4], start = 1, finish = 3, fuel = 5
+<strong>Output:</strong> 4
+<strong>Explanation:</strong>&nbsp;The following are all possible routes, each uses 5 units of fuel:
+1 -&gt; 3
+1 -&gt; 2 -&gt; 3
+1 -&gt; 4 -&gt; 3
+1 -&gt; 4 -&gt; 2 -&gt; 3
+</pre>
+
+<p><strong>Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> locations = [4,3,1], start = 1, finish = 0, fuel = 6
+<strong>Output:</strong> 5
+<strong>Explanation: </strong>The following are all possible routes:
+1 -&gt; 0, used fuel = 1
+1 -&gt; 2 -&gt; 0, used fuel = 5
+1 -&gt; 2 -&gt; 1 -&gt; 0, used fuel = 5
+1 -&gt; 0 -&gt; 1 -&gt; 0, used fuel = 3
+1 -&gt; 0 -&gt; 1 -&gt; 0 -&gt; 1 -&gt; 0, used fuel = 5
+</pre>
+
+<p><strong>Example 3:</strong></p>
+
+<pre>
+<strong>Input:</strong> locations = [5,2,1], start = 0, finish = 2, fuel = 3
+<strong>Output:</strong> 0
+<b>Explanation: </b>It&#39;s impossible to get from 0 to 2 using only 3 units of fuel since the shortest route needs 4 units of fuel.</pre>
+
+<p><strong>Example 4:</strong></p>
+
+<pre>
+<strong>Input:</strong> locations = [2,1,5], start = 0, finish = 0, fuel = 3
+<strong>Output:</strong> 2
+<strong>Explanation:</strong>&nbsp;There are two possible routes, 0 and 0 -&gt; 1 -&gt; 0.</pre>
+
+<p><strong>Example 5:</strong></p>
+
+<pre>
+<strong>Input:</strong> locations = [1,2,3], start = 0, finish = 2, fuel = 40
+<strong>Output:</strong> 615088286
+<strong>Explanation: </strong>The total number of possible routes is 2615088300. Taking this number modulo 10^9 + 7 gives us 615088286.
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>2 &lt;= locations.length &lt;= 100</code></li>
+	<li><code>1 &lt;= locations[i] &lt;= 10^9</code></li>
+	<li>All integers in&nbsp;<code>locations</code>&nbsp;are&nbsp;<strong>distinct</strong>.</li>
+	<li><code>0 &lt;= start, finish &lt;&nbsp;locations.length</code></li>
+	<li><code><font face="monospace">1 &lt;= fuel &lt;= 200</font></code></li>
+</ul>
+
+
+## Solutions
+
+
+
+<!-- tabs:start -->
+
+### **Python3**
+
+
+```python
+
+```
+
+### **Java**
+
+
+```java
+
+```
+
+### **...**
+```
+
+```
+
+<!-- tabs:end -->