mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
update
This commit is contained in:
parent
a38bcc80d1
commit
396e839079
@ -1,6 +1,6 @@
|
||||
# 力扣题库（完整版）
|
||||
|
||||
> 最后更新日期： **2022.10.15**
|
||||
> 最后更新日期： **2022.10.20**
|
||||
>
|
||||
> 使用脚本前请务必仔细完整阅读本 `README.md` 文件
|
||||
|
||||
|
||||
File diff suppressed because it is too large
Load Diff
File diff suppressed because one or more lines are too long
File diff suppressed because one or more lines are too long
190
leetcode-cn/originData/count-subarrays-with-fixed-bounds.json
Normal file
190
leetcode-cn/originData/count-subarrays-with-fixed-bounds.json
Normal file
File diff suppressed because one or more lines are too long
194
leetcode-cn/originData/create-components-with-same-value.json
Normal file
194
leetcode-cn/originData/create-components-with-same-value.json
Normal file
File diff suppressed because one or more lines are too long
File diff suppressed because one or more lines are too long
196
leetcode-cn/originData/minimize-maximum-of-array.json
Normal file
196
leetcode-cn/originData/minimize-maximum-of-array.json
Normal file
File diff suppressed because one or more lines are too long
177
leetcode-cn/originData/number-of-valid-clock-times.json
Normal file
177
leetcode-cn/originData/number-of-valid-clock-times.json
Normal file
File diff suppressed because one or more lines are too long
183
leetcode-cn/originData/range-product-queries-of-powers.json
Normal file
183
leetcode-cn/originData/range-product-queries-of-powers.json
Normal file
File diff suppressed because one or more lines are too long
177
leetcode-cn/originData/sum-of-number-and-its-reverse.json
Normal file
177
leetcode-cn/originData/sum-of-number-and-its-reverse.json
Normal file
File diff suppressed because one or more lines are too long
@ -0,0 +1,39 @@
|
||||
<p>给你一个 <strong>不包含</strong> 任何零的整数数组 <code>nums</code> ，找出自身与对应的负数都在数组中存在的最大正整数 <code>k</code> 。</p>
|
||||
|
||||
<p>返回正整数<em> </em><code>k</code> ，如果不存在这样的整数，返回 <code>-1</code> 。</p>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong>示例 1：</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>输入：</strong>nums = [-1,2,-3,3]
|
||||
<strong>输出：</strong>3
|
||||
<strong>解释：</strong>3 是数组中唯一一个满足题目要求的 k 。
|
||||
</pre>
|
||||
|
||||
<p><strong>示例 2：</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>输入：</strong>nums = [-1,10,6,7,-7,1]
|
||||
<strong>输出：</strong>7
|
||||
<strong>解释：</strong>数组中存在 1 和 7 对应的负数，7 的值更大。
|
||||
</pre>
|
||||
|
||||
<p><strong>示例 3：</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>输入：</strong>nums = [-10,8,6,7,-2,-3]
|
||||
<strong>输出：</strong>-1
|
||||
<strong>解释：</strong>不存在满足题目要求的 k ，返回 -1 。
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong>提示：</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>1 <= nums.length <= 1000</code></li>
|
||||
<li><code>-1000 <= nums[i] <= 1000</code></li>
|
||||
<li><code>nums[i] != 0</code></li>
|
||||
</ul>
|
||||
@ -0,0 +1,38 @@
|
||||
<p>给你一个正整数 <code>n</code> ，你需要找到一个下标从 <strong>0</strong> 开始的数组 <code>powers</code> ，它包含 <strong>最少</strong> 数目的 <code>2</code> 的幂，且它们的和为 <code>n</code> 。<code>powers</code> 数组是 <strong>非递减</strong> 顺序的。根据前面描述，构造 <code>powers</code> 数组的方法是唯一的。</p>
|
||||
|
||||
<p>同时给你一个下标从 <strong>0</strong> 开始的二维整数数组 <code>queries</code> ，其中 <code>queries[i] = [left<sub>i</sub>, right<sub>i</sub>]</code> ，其中 <code>queries[i]</code> 表示请你求出满足 <code>left<sub>i</sub> <= j <= right<sub>i</sub></code> 的所有 <code>powers[j]</code> 的乘积。</p>
|
||||
|
||||
<p>请你返回一个数组<em> </em><code>answers</code> ，长度与<em> </em><code>queries</code> 的长度相同，其中<em> </em><code>answers[i]</code>是第<em> </em><code>i</code> 个查询的答案。由于查询的结果可能非常大，请你将每个 <code>answers[i]</code> 都对 <code>10<sup>9</sup> + 7</code> <strong>取余</strong> 。</p>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong>示例 1：</strong></p>
|
||||
|
||||
<pre><b>输入：</b>n = 15, queries = [[0,1],[2,2],[0,3]]
|
||||
<b>输出：</b>[2,4,64]
|
||||
<strong>解释：</strong>
|
||||
对于 n = 15 ，得到 powers = [1,2,4,8] 。没法得到元素数目更少的数组。
|
||||
第 1 个查询的答案：powers[0] * powers[1] = 1 * 2 = 2 。
|
||||
第 2 个查询的答案：powers[2] = 4 。
|
||||
第 3 个查询的答案：powers[0] * powers[1] * powers[2] * powers[3] = 1 * 2 * 4 * 8 = 64 。
|
||||
每个答案对 10<sup>9</sup> + 7 得到的结果都相同，所以返回 [2,4,64] 。
|
||||
</pre>
|
||||
|
||||
<p><strong>示例 2：</strong></p>
|
||||
|
||||
<pre><b>输入：</b>n = 2, queries = [[0,0]]
|
||||
<b>输出：</b>[2]
|
||||
<strong>解释：</strong>
|
||||
对于 n = 2, powers = [2] 。
|
||||
唯一一个查询的答案是 powers[0] = 2 。答案对 10<sup>9</sup> + 7 取余后结果相同，所以返回 [2] 。
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong>提示：</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>1 <= n <= 10<sup>9</sup></code></li>
|
||||
<li><code>1 <= queries.length <= 10<sup>5</sup></code></li>
|
||||
<li><code>0 <= start<sub>i</sub> <= end<sub>i</sub> < powers.length</code></li>
|
||||
</ul>
|
||||
@ -0,0 +1,39 @@
|
||||
<p>有一棵 <code>n</code> 个节点的无向树，节点编号为 <code>0</code> 到 <code>n - 1</code> 。</p>
|
||||
|
||||
<p>给你一个长度为 <code>n</code> 下标从 <strong>0</strong> 开始的整数数组 <code>nums</code> ，其中 <code>nums[i]</code> 表示第 <code>i</code> 个节点的值。同时给你一个长度为 <code>n - 1</code> 的二维整数数组 <code>edges</code> ，其中 <code>edges[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> 表示节点 <code>a<sub>i</sub></code> 与 <code>b<sub>i</sub></code> 之间有一条边。</p>
|
||||
|
||||
<p>你可以 <strong>删除</strong> 一些边，将这棵树分成几个连通块。一个连通块的 <strong>价值</strong> 定义为这个连通块中 <strong>所有</strong> 节点 <code>i</code> 对应的 <code>nums[i]</code> 之和。</p>
|
||||
|
||||
<p>你需要删除一些边，删除后得到的各个连通块的价值都相等。请返回你可以删除的边数 <strong>最多</strong> 为多少。</p>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong>示例 1：</strong></p>
|
||||
|
||||
<p><img alt="" src="https://assets.leetcode.com/uploads/2022/08/26/diagramdrawio.png" style="width: 441px; height: 351px;"></p>
|
||||
|
||||
<pre><b>输入：</b>nums = [6,2,2,2,6], edges = [[0,1],[1,2],[1,3],[3,4]]
|
||||
<b>输出：</b>2
|
||||
<b>解释：</b>上图展示了我们可以删除边 [0,1] 和 [3,4] 。得到的连通块为 [0] ，[1,2,3] 和 [4] 。每个连通块的价值都为 6 。可以证明没有别的更好的删除方案存在了，所以答案为 2 。
|
||||
</pre>
|
||||
|
||||
<p><strong>示例 2：</strong></p>
|
||||
|
||||
<pre><b>输入：</b>nums = [2], edges = []
|
||||
<b>输出：</b>0
|
||||
<b>解释：</b>没有任何边可以删除。
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong>提示：</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>1 <= n <= 2 * 10<sup>4</sup></code></li>
|
||||
<li><code>nums.length == n</code></li>
|
||||
<li><code>1 <= nums[i] <= 50</code></li>
|
||||
<li><code>edges.length == n - 1</code></li>
|
||||
<li><code>edges[i].length == 2</code></li>
|
||||
<li><code>0 <= edges[i][0], edges[i][1] <= n - 1</code></li>
|
||||
<li><code>edges</code> 表示一棵合法的树。</li>
|
||||
</ul>
|
||||
@ -0,0 +1,34 @@
|
||||
<p>给你一个由 <strong>正</strong> 整数组成的数组 <code>nums</code> 。</p>
|
||||
|
||||
<p>你必须取出数组中的每个整数，<strong>反转其中每个数位</strong>，并将反转后得到的数字添加到数组的末尾。这一操作只针对 <code>nums</code> 中原有的整数执行。</p>
|
||||
|
||||
<p>返回结果数组中 <strong>不同</strong> 整数的数目。</p>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong>示例 1：</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>输入：</strong>nums = [1,13,10,12,31]
|
||||
<strong>输出：</strong>6
|
||||
<strong>解释：</strong>反转每个数字后，结果数组是 [1,13,10,12,31,<em><strong>1,31,1,21,13</strong></em>] 。
|
||||
反转后得到的数字添加到数组的末尾并按斜体加粗表示。注意对于整数 10 ，反转之后会变成 01 ，即 1 。
|
||||
数组中不同整数的数目为 6（数字 1、10、12、13、21 和 31）。</pre>
|
||||
|
||||
<p><strong>示例 2：</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>输入：</strong>nums = [2,2,2]
|
||||
<strong>输出：</strong>1
|
||||
<strong>解释：</strong>反转每个数字后，结果数组是 [2,2,2,<em><strong>2,2,2</strong></em>] 。
|
||||
数组中不同整数的数目为 1（数字 2）。
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong>提示：</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>1 <= nums.length <= 10<sup>5</sup></code></li>
|
||||
<li><code>1 <= nums[i] <= 10<sup>6</sup></code></li>
|
||||
</ul>
|
||||
@ -0,0 +1,37 @@
|
||||
<p>给你一个 <strong>非负</strong> 整数 <code>num</code> 。如果存在某个 <strong>非负</strong> 整数 <code>k</code> 满足 <code>k + reverse(k) = num</code> ，则返回 <code>true</code> ；否则，返回<em> </em><code>false</code> 。</p>
|
||||
|
||||
<p><code>reverse(k)</code> 表示 <code>k</code> 反转每个数位后得到的数字。</p>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong>示例 1：</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>输入：</strong>num = 443
|
||||
<strong>输出：</strong>true
|
||||
<strong>解释：</strong>172 + 271 = 443 ，所以返回 true 。
|
||||
</pre>
|
||||
|
||||
<p><strong>示例 2：</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>输入：</strong>num = 63
|
||||
<strong>输出：</strong>false
|
||||
<strong>解释：</strong>63 不能表示为非负整数及其反转后数字之和，返回 false 。
|
||||
</pre>
|
||||
|
||||
<p><strong>示例 3：</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>输入：</strong>num = 181
|
||||
<strong>输出：</strong>true
|
||||
<strong>解释：</strong>140 + 041 = 181 ，所以返回 true 。注意，反转后的数字可能包含前导零。
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong>提示：</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>0 <= num <= 10<sup>5</sup></code></li>
|
||||
</ul>
|
||||
@ -0,0 +1,44 @@
|
||||
<p>给你一个下标从 <strong>0</strong> 开始的数组 <code>nums</code> ，它含有 <code>n</code> 个非负整数。</p>
|
||||
|
||||
<p>每一步操作中，你需要：</p>
|
||||
|
||||
<ul>
|
||||
<li>选择一个满足 <code>1 <= i < n</code> 的整数 <code>i</code> ，且 <code>nums[i] > 0</code> 。</li>
|
||||
<li>将 <code>nums[i]</code> 减 1 。</li>
|
||||
<li>将 <code>nums[i - 1]</code> 加 1 。</li>
|
||||
</ul>
|
||||
|
||||
<p>你可以对数组执行 <strong>任意</strong> 次上述操作，请你返回可以得到的 <code>nums</code> 数组中<b> 最大值</b> <strong>最小</strong> 为多少。</p>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong>示例 1：</strong></p>
|
||||
|
||||
<pre><b>输入：</b>nums = [3,7,1,6]
|
||||
<b>输出：</b>5
|
||||
<strong>解释：</strong>
|
||||
一串最优操作是：
|
||||
1. 选择 i = 1 ，nums 变为 [4,6,1,6] 。
|
||||
2. 选择 i = 3 ，nums 变为 [4,6,2,5] 。
|
||||
3. 选择 i = 1 ，nums 变为 [5,5,2,5] 。
|
||||
nums 中最大值为 5 。无法得到比 5 更小的最大值。
|
||||
所以我们返回 5 。
|
||||
</pre>
|
||||
|
||||
<p><strong>示例 2：</strong></p>
|
||||
|
||||
<pre><b>输入：</b>nums = [10,1]
|
||||
<b>输出：</b>10
|
||||
<strong>解释：</strong>
|
||||
最优解是不改动 nums ，10 是最大值，所以返回 10 。
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong>提示：</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>n == nums.length</code></li>
|
||||
<li><code>2 <= n <= 10<sup>5</sup></code></li>
|
||||
<li><code>0 <= nums[i] <= 10<sup>9</sup></code></li>
|
||||
</ul>
|
||||
@ -0,0 +1,39 @@
|
||||
<p>给你一个长度为 <code>5</code> 的字符串 <code>time</code> ，表示一个电子时钟当前的时间，格式为 <code>"hh:mm"</code> 。<strong>最早</strong> 可能的时间是 <code>"00:00"</code> ，<strong>最晚</strong> 可能的时间是 <code>"23:59"</code> 。</p>
|
||||
|
||||
<p>在字符串 <code>time</code> 中，被字符 <code>?</code> 替换掉的数位是 <strong>未知的</strong> ，被替换的数字可能是 <code>0</code> 到 <code>9</code> 中的任何一个。</p>
|
||||
|
||||
<p>请你返回一个整数<em> </em><code>answer</code> ，将每一个 <code>?</code> 都用<em> </em><code>0</code> 到<em> </em><code>9</code> 中一个数字替换后，可以得到的有效时间的数目。</p>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong>示例 1：</strong></p>
|
||||
|
||||
<pre><b>输入：</b>time = "?5:00"
|
||||
<b>输出：</b>2
|
||||
<b>解释：</b>我们可以将 ? 替换成 0 或 1 ，得到 "05:00" 或者 "15:00" 。注意我们不能替换成 2 ，因为时间 "25:00" 是无效时间。所以我们有两个选择。
|
||||
</pre>
|
||||
|
||||
<p><strong>示例 2：</strong></p>
|
||||
|
||||
<pre><b>输入：</b>time = "0?:0?"
|
||||
<b>输出：</b>100
|
||||
<b>解释：</b>两个 ? 都可以被 0 到 9 之间的任意数字替换，所以我们总共有 100 种选择。
|
||||
</pre>
|
||||
|
||||
<p><strong>示例 3：</strong></p>
|
||||
|
||||
<pre><b>输入：</b>time = "??:??"
|
||||
<b>输出：</b>1440
|
||||
<b>解释：</b>小时总共有 24 种选择，分钟总共有 60 种选择。所以总共有 24 * 60 = 1440 种选择。
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong>提示：</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>time</code> 是一个长度为 <code>5</code> 的有效字符串，格式为 <code>"hh:mm"</code> 。</li>
|
||||
<li><code>"00" <= hh <= "23"</code></li>
|
||||
<li><code>"00" <= mm <= "59"</code></li>
|
||||
<li>字符串中有的数位是 <code>'?'</code> ，需要用 <code>0</code> 到 <code>9</code> 之间的数字替换。</li>
|
||||
</ul>
|
||||
@ -0,0 +1,36 @@
|
||||
<p>给你一个整数数组 <code>nums</code> 和两个整数 <code>minK</code> 以及 <code>maxK</code> 。</p>
|
||||
|
||||
<p><code>nums</code> 的定界子数组是满足下述条件的一个子数组：</p>
|
||||
|
||||
<ul>
|
||||
<li>子数组中的 <strong>最小值</strong> 等于 <code>minK</code> 。</li>
|
||||
<li>子数组中的 <strong>最大值</strong> 等于 <code>maxK</code> 。</li>
|
||||
</ul>
|
||||
|
||||
<p>返回定界子数组的数目。</p>
|
||||
|
||||
<p>子数组是数组中的一个连续部分。</p>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong>示例 1：</strong></p>
|
||||
|
||||
<pre><strong>输入：</strong>nums = [1,3,5,2,7,5], minK = 1, maxK = 5
|
||||
<strong>输出：</strong>2
|
||||
<strong>解释：</strong>定界子数组是 [1,3,5] 和 [1,3,5,2] 。
|
||||
</pre>
|
||||
|
||||
<p><strong>示例 2：</strong></p>
|
||||
|
||||
<pre><strong>输入：</strong>nums = [1,1,1,1], minK = 1, maxK = 1
|
||||
<strong>输出：</strong>10
|
||||
<strong>解释：</strong>nums 的每个子数组都是一个定界子数组。共有 10 个子数组。</pre>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong>提示：</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>2 <= nums.length <= 10<sup>5</sup></code></li>
|
||||
<li><code>1 <= nums[i], minK, maxK <= 10<sup>6</sup></code></li>
|
||||
</ul>
|
||||
@ -0,0 +1,37 @@
|
||||
<p>Given an integer array <code>nums</code> that <strong>does not contain</strong> any zeros, find <strong>the largest positive</strong> integer <code>k</code> such that <code>-k</code> also exists in the array.</p>
|
||||
|
||||
<p>Return <em>the positive integer </em><code>k</code>. If there is no such integer, return <code>-1</code>.</p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> nums = [-1,2,-3,3]
|
||||
<strong>Output:</strong> 3
|
||||
<strong>Explanation:</strong> 3 is the only valid k we can find in the array.
|
||||
</pre>
|
||||
|
||||
<p><strong class="example">Example 2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> nums = [-1,10,6,7,-7,1]
|
||||
<strong>Output:</strong> 7
|
||||
<strong>Explanation:</strong> Both 1 and 7 have their corresponding negative values in the array. 7 has a larger value.
|
||||
</pre>
|
||||
|
||||
<p><strong class="example">Example 3:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> nums = [-10,8,6,7,-2,-3]
|
||||
<strong>Output:</strong> -1
|
||||
<strong>Explanation:</strong> There is no a single valid k, we return -1.
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Constraints:</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>1 <= nums.length <= 1000</code></li>
|
||||
<li><code>-1000 <= nums[i] <= 1000</code></li>
|
||||
<li><code>nums[i] != 0</code></li>
|
||||
</ul>
|
||||
@ -0,0 +1,38 @@
|
||||
<p>Given a positive integer <code>n</code>, there exists a <strong>0-indexed</strong> array called <code>powers</code>, composed of the <strong>minimum</strong> number of powers of <code>2</code> that sum to <code>n</code>. The array is sorted in <strong>non-decreasing</strong> order, and there is <strong>only one</strong> way to form the array.</p>
|
||||
|
||||
<p>You are also given a <strong>0-indexed</strong> 2D integer array <code>queries</code>, where <code>queries[i] = [left<sub>i</sub>, right<sub>i</sub>]</code>. Each <code>queries[i]</code> represents a query where you have to find the product of all <code>powers[j]</code> with <code>left<sub>i</sub> <= j <= right<sub>i</sub></code>.</p>
|
||||
|
||||
<p>Return<em> an array </em><code>answers</code><em>, equal in length to </em><code>queries</code><em>, where </em><code>answers[i]</code><em> is the answer to the </em><code>i<sup>th</sup></code><em> query</em>. Since the answer to the <code>i<sup>th</sup></code> query may be too large, each <code>answers[i]</code> should be returned <strong>modulo</strong> <code>10<sup>9</sup> + 7</code>.</p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> n = 15, queries = [[0,1],[2,2],[0,3]]
|
||||
<strong>Output:</strong> [2,4,64]
|
||||
<strong>Explanation:</strong>
|
||||
For n = 15, powers = [1,2,4,8]. It can be shown that powers cannot be a smaller size.
|
||||
Answer to 1st query: powers[0] * powers[1] = 1 * 2 = 2.
|
||||
Answer to 2nd query: powers[2] = 4.
|
||||
Answer to 3rd query: powers[0] * powers[1] * powers[2] * powers[3] = 1 * 2 * 4 * 8 = 64.
|
||||
Each answer modulo 10<sup>9</sup> + 7 yields the same answer, so [2,4,64] is returned.
|
||||
</pre>
|
||||
|
||||
<p><strong class="example">Example 2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> n = 2, queries = [[0,0]]
|
||||
<strong>Output:</strong> [2]
|
||||
<strong>Explanation:</strong>
|
||||
For n = 2, powers = [2].
|
||||
The answer to the only query is powers[0] = 2. The answer modulo 10<sup>9</sup> + 7 is the same, so [2] is returned.
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Constraints:</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>1 <= n <= 10<sup>9</sup></code></li>
|
||||
<li><code>1 <= queries.length <= 10<sup>5</sup></code></li>
|
||||
<li><code>0 <= start<sub>i</sub> <= end<sub>i</sub> < powers.length</code></li>
|
||||
</ul>
|
||||
@ -0,0 +1,37 @@
|
||||
<p>There is an undirected tree with <code>n</code> nodes labeled from <code>0</code> to <code>n - 1</code>.</p>
|
||||
|
||||
<p>You are given a <strong>0-indexed</strong> integer array <code><font face="monospace">nums</font></code> of length <code>n</code> where <code>nums[i]</code> represents the value of the <code>i<sup>th</sup></code> node. You are also given a 2D integer array <code>edges</code> of length <code>n - 1</code> where <code>edges[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that there is an edge between nodes <code>a<sub>i</sub></code> and <code>b<sub>i</sub></code> in the tree.</p>
|
||||
|
||||
<p>You are allowed to <strong>delete</strong> some edges, splitting the tree into multiple connected components. Let the <strong>value</strong> of a component be the sum of <strong>all</strong> <code>nums[i]</code> for which node <code>i</code> is in the component.</p>
|
||||
|
||||
<p>Return<em> the <strong>maximum</strong> number of edges you can delete, such that every connected component in the tree has the same value.</em></p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
<img alt="" src="https://assets.leetcode.com/uploads/2022/08/26/diagramdrawio.png" style="width: 441px; height: 351px;" />
|
||||
<pre>
|
||||
<strong>Input:</strong> nums = [6,2,2,2,6], edges = [[0,1],[1,2],[1,3],[3,4]]
|
||||
<strong>Output:</strong> 2
|
||||
<strong>Explanation:</strong> The above figure shows how we can delete the edges [0,1] and [3,4]. The created components are nodes [0], [1,2,3] and [4]. The sum of the values in each component equals 6. It can be proven that no better deletion exists, so the answer is 2.
|
||||
</pre>
|
||||
|
||||
<p><strong class="example">Example 2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> nums = [2], edges = []
|
||||
<strong>Output:</strong> 0
|
||||
<strong>Explanation:</strong> There are no edges to be deleted.
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Constraints:</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>1 <= n <= 2 * 10<sup>4</sup></code></li>
|
||||
<li><code>nums.length == n</code></li>
|
||||
<li><code>1 <= nums[i] <= 50</code></li>
|
||||
<li><code>edges.length == n - 1</code></li>
|
||||
<li><code>edges[i].length == 2</code></li>
|
||||
<li><code>0 <= edges[i][0], edges[i][1] <= n - 1</code></li>
|
||||
<li><code>edges</code> represents a valid tree.</li>
|
||||
</ul>
|
||||
@ -0,0 +1,32 @@
|
||||
<p>You are given an array <code>nums</code> consisting of <strong>positive</strong> integers.</p>
|
||||
|
||||
<p>You have to take each integer in the array, <strong>reverse its digits</strong>, and add it to the end of the array. You should apply this operation to the original integers in <code>nums</code>.</p>
|
||||
|
||||
<p>Return <em>the number of <strong>distinct</strong> integers in the final array</em>.</p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> nums = [1,13,10,12,31]
|
||||
<strong>Output:</strong> 6
|
||||
<strong>Explanation:</strong> After including the reverse of each number, the resulting array is [1,13,10,12,31,<u>1,31,1,21,13</u>].
|
||||
The reversed integers that were added to the end of the array are underlined. Note that for the integer 10, after reversing it, it becomes 01 which is just 1.
|
||||
The number of distinct integers in this array is 6 (The numbers 1, 10, 12, 13, 21, and 31).</pre>
|
||||
|
||||
<p><strong class="example">Example 2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> nums = [2,2,2]
|
||||
<strong>Output:</strong> 1
|
||||
<strong>Explanation:</strong> After including the reverse of each number, the resulting array is [2,2,2,<u>2,2,2</u>].
|
||||
The number of distinct integers in this array is 1 (The number 2).
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Constraints:</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>1 <= nums.length <= 10<sup>5</sup></code></li>
|
||||
<li><code>1 <= nums[i] <= 10<sup>6</sup></code></li>
|
||||
</ul>
|
||||
@ -0,0 +1,33 @@
|
||||
<p>Given a <strong>non-negative</strong> integer <code>num</code>, return <code>true</code><em> if </em><code>num</code><em> can be expressed as the sum of any <strong>non-negative</strong> integer and its reverse, or </em><code>false</code><em> otherwise.</em></p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> num = 443
|
||||
<strong>Output:</strong> true
|
||||
<strong>Explanation:</strong> 172 + 271 = 443 so we return true.
|
||||
</pre>
|
||||
|
||||
<p><strong class="example">Example 2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> num = 63
|
||||
<strong>Output:</strong> false
|
||||
<strong>Explanation:</strong> 63 cannot be expressed as the sum of a non-negative integer and its reverse so we return false.
|
||||
</pre>
|
||||
|
||||
<p><strong class="example">Example 3:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> num = 181
|
||||
<strong>Output:</strong> true
|
||||
<strong>Explanation:</strong> 140 + 041 = 181 so we return true. Note that when a number is reversed, there may be leading zeros.
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Constraints:</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>0 <= num <= 10<sup>5</sup></code></li>
|
||||
</ul>
|
||||
@ -0,0 +1,44 @@
|
||||
<p>You are given a <strong>0-indexed</strong> array <code>nums</code> comprising of <code>n</code> non-negative integers.</p>
|
||||
|
||||
<p>In one operation, you must:</p>
|
||||
|
||||
<ul>
|
||||
<li>Choose an integer <code>i</code> such that <code>1 <= i < n</code> and <code>nums[i] > 0</code>.</li>
|
||||
<li>Decrease <code>nums[i]</code> by 1.</li>
|
||||
<li>Increase <code>nums[i - 1]</code> by 1.</li>
|
||||
</ul>
|
||||
|
||||
<p>Return<em> the <strong>minimum</strong> possible value of the <strong>maximum</strong> integer of </em><code>nums</code><em> after performing <strong>any</strong> number of operations</em>.</p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> nums = [3,7,1,6]
|
||||
<strong>Output:</strong> 5
|
||||
<strong>Explanation:</strong>
|
||||
One set of optimal operations is as follows:
|
||||
1. Choose i = 1, and nums becomes [4,6,1,6].
|
||||
2. Choose i = 3, and nums becomes [4,6,2,5].
|
||||
3. Choose i = 1, and nums becomes [5,5,2,5].
|
||||
The maximum integer of nums is 5. It can be shown that the maximum number cannot be less than 5.
|
||||
Therefore, we return 5.
|
||||
</pre>
|
||||
|
||||
<p><strong class="example">Example 2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> nums = [10,1]
|
||||
<strong>Output:</strong> 10
|
||||
<strong>Explanation:</strong>
|
||||
It is optimal to leave nums as is, and since 10 is the maximum value, we return 10.
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Constraints:</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>n == nums.length</code></li>
|
||||
<li><code>2 <= n <= 10<sup>5</sup></code></li>
|
||||
<li><code>0 <= nums[i] <= 10<sup>9</sup></code></li>
|
||||
</ul>
|
||||
@ -0,0 +1,40 @@
|
||||
<p>You are given a string of length <code>5</code> called <code>time</code>, representing the current time on a digital clock in the format <code>"hh:mm"</code>. The <strong>earliest</strong> possible time is <code>"00:00"</code> and the <strong>latest</strong> possible time is <code>"23:59"</code>.</p>
|
||||
|
||||
<p>In the string <code>time</code>, the digits represented by the <code>?</code> symbol are <strong>unknown</strong>, and must be <strong>replaced</strong> with a digit from <code>0</code> to <code>9</code>.</p>
|
||||
|
||||
<p>Return<em> an integer </em><code>answer</code><em>, the number of valid clock times that can be created by replacing every </em><code>?</code><em> with a digit from </em><code>0</code><em> to </em><code>9</code>.</p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> time = "?5:00"
|
||||
<strong>Output:</strong> 2
|
||||
<strong>Explanation:</strong> We can replace the ? with either a 0 or 1, producing "05:00" or "15:00". Note that we cannot replace it with a 2, since the time "25:00" is invalid. In total, we have two choices.
|
||||
</pre>
|
||||
|
||||
<p><strong class="example">Example 2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> time = "0?:0?"
|
||||
<strong>Output:</strong> 100
|
||||
<strong>Explanation:</strong> Each ? can be replaced by any digit from 0 to 9, so we have 100 total choices.
|
||||
</pre>
|
||||
|
||||
<p><strong class="example">Example 3:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> time = "??:??"
|
||||
<strong>Output:</strong> 1440
|
||||
<strong>Explanation:</strong> There are 24 possible choices for the hours, and 60 possible choices for the minutes. In total, we have 24 * 60 = 1440 choices.
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Constraints:</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>time</code> is a valid string of length <code>5</code> in the format <code>"hh:mm"</code>.</li>
|
||||
<li><code>"00" <= hh <= "23"</code></li>
|
||||
<li><code>"00" <= mm <= "59"</code></li>
|
||||
<li>Some of the digits might be replaced with <code>'?'</code> and need to be replaced with digits from <code>0</code> to <code>9</code>.</li>
|
||||
</ul>
|
||||
@ -0,0 +1,37 @@
|
||||
<p>You are given an integer array <code>nums</code> and two integers <code>minK</code> and <code>maxK</code>.</p>
|
||||
|
||||
<p>A <strong>fixed-bound subarray</strong> of <code>nums</code> is a subarray that satisfies the following conditions:</p>
|
||||
|
||||
<ul>
|
||||
<li>The <strong>minimum</strong> value in the subarray is equal to <code>minK</code>.</li>
|
||||
<li>The <strong>maximum</strong> value in the subarray is equal to <code>maxK</code>.</li>
|
||||
</ul>
|
||||
|
||||
<p>Return <em>the <strong>number</strong> of fixed-bound subarrays</em>.</p>
|
||||
|
||||
<p>A <strong>subarray</strong> is a <strong>contiguous</strong> part of an array.</p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Example 1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> nums = [1,3,5,2,7,5], minK = 1, maxK = 5
|
||||
<strong>Output:</strong> 2
|
||||
<strong>Explanation:</strong> The fixed-bound subarrays are [1,3,5] and [1,3,5,2].
|
||||
</pre>
|
||||
|
||||
<p><strong>Example 2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> nums = [1,1,1,1], minK = 1, maxK = 1
|
||||
<strong>Output:</strong> 10
|
||||
<strong>Explanation:</strong> Every subarray of nums is a fixed-bound subarray. There are 10 possible subarrays.
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Constraints:</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>2 <= nums.length <= 10<sup>5</sup></code></li>
|
||||
<li><code>1 <= nums[i], minK, maxK <= 10<sup>6</sup></code></li>
|
||||
</ul>
|
||||
File diff suppressed because it is too large
Load Diff
File diff suppressed because one or more lines are too long
File diff suppressed because one or more lines are too long
187
leetcode/originData/count-subarrays-with-fixed-bounds.json
Normal file
187
leetcode/originData/count-subarrays-with-fixed-bounds.json
Normal file
File diff suppressed because one or more lines are too long
191
leetcode/originData/create-components-with-same-value.json
Normal file
191
leetcode/originData/create-components-with-same-value.json
Normal file
File diff suppressed because one or more lines are too long
File diff suppressed because one or more lines are too long
193
leetcode/originData/minimize-maximum-of-array.json
Normal file
193
leetcode/originData/minimize-maximum-of-array.json
Normal file
File diff suppressed because one or more lines are too long
174
leetcode/originData/number-of-valid-clock-times.json
Normal file
174
leetcode/originData/number-of-valid-clock-times.json
Normal file
File diff suppressed because one or more lines are too long
180
leetcode/originData/range-product-queries-of-powers.json
Normal file
180
leetcode/originData/range-product-queries-of-powers.json
Normal file
File diff suppressed because one or more lines are too long
174
leetcode/originData/sum-of-number-and-its-reverse.json
Normal file
174
leetcode/originData/sum-of-number-and-its-reverse.json
Normal file
File diff suppressed because one or more lines are too long
@ -0,0 +1,32 @@
|
||||
<p>You are given an array <code>nums</code> consisting of <strong>positive</strong> integers.</p>
|
||||
|
||||
<p>You have to take each integer in the array, <strong>reverse its digits</strong>, and add it to the end of the array. You should apply this operation to the original integers in <code>nums</code>.</p>
|
||||
|
||||
<p>Return <em>the number of <strong>distinct</strong> integers in the final array</em>.</p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> nums = [1,13,10,12,31]
|
||||
<strong>Output:</strong> 6
|
||||
<strong>Explanation:</strong> After including the reverse of each number, the resulting array is [1,13,10,12,31,<u>1,31,1,21,13</u>].
|
||||
The reversed integers that were added to the end of the array are underlined. Note that for the integer 10, after reversing it, it becomes 01 which is just 1.
|
||||
The number of distinct integers in this array is 6 (The numbers 1, 10, 12, 13, 21, and 31).</pre>
|
||||
|
||||
<p><strong class="example">Example 2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> nums = [2,2,2]
|
||||
<strong>Output:</strong> 1
|
||||
<strong>Explanation:</strong> After including the reverse of each number, the resulting array is [2,2,2,<u>2,2,2</u>].
|
||||
The number of distinct integers in this array is 1 (The number 2).
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Constraints:</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>1 <= nums.length <= 10<sup>5</sup></code></li>
|
||||
<li><code>1 <= nums[i] <= 10<sup>6</sup></code></li>
|
||||
</ul>
|
||||
37
leetcode/problem/count-subarrays-with-fixed-bounds.html
Normal file
37
leetcode/problem/count-subarrays-with-fixed-bounds.html
Normal file
@ -0,0 +1,37 @@
|
||||
<p>You are given an integer array <code>nums</code> and two integers <code>minK</code> and <code>maxK</code>.</p>
|
||||
|
||||
<p>A <strong>fixed-bound subarray</strong> of <code>nums</code> is a subarray that satisfies the following conditions:</p>
|
||||
|
||||
<ul>
|
||||
<li>The <strong>minimum</strong> value in the subarray is equal to <code>minK</code>.</li>
|
||||
<li>The <strong>maximum</strong> value in the subarray is equal to <code>maxK</code>.</li>
|
||||
</ul>
|
||||
|
||||
<p>Return <em>the <strong>number</strong> of fixed-bound subarrays</em>.</p>
|
||||
|
||||
<p>A <strong>subarray</strong> is a <strong>contiguous</strong> part of an array.</p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Example 1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> nums = [1,3,5,2,7,5], minK = 1, maxK = 5
|
||||
<strong>Output:</strong> 2
|
||||
<strong>Explanation:</strong> The fixed-bound subarrays are [1,3,5] and [1,3,5,2].
|
||||
</pre>
|
||||
|
||||
<p><strong>Example 2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> nums = [1,1,1,1], minK = 1, maxK = 1
|
||||
<strong>Output:</strong> 10
|
||||
<strong>Explanation:</strong> Every subarray of nums is a fixed-bound subarray. There are 10 possible subarrays.
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Constraints:</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>2 <= nums.length <= 10<sup>5</sup></code></li>
|
||||
<li><code>1 <= nums[i], minK, maxK <= 10<sup>6</sup></code></li>
|
||||
</ul>
|
||||
37
leetcode/problem/create-components-with-same-value.html
Normal file
37
leetcode/problem/create-components-with-same-value.html
Normal file
@ -0,0 +1,37 @@
|
||||
<p>There is an undirected tree with <code>n</code> nodes labeled from <code>0</code> to <code>n - 1</code>.</p>
|
||||
|
||||
<p>You are given a <strong>0-indexed</strong> integer array <code><font face="monospace">nums</font></code> of length <code>n</code> where <code>nums[i]</code> represents the value of the <code>i<sup>th</sup></code> node. You are also given a 2D integer array <code>edges</code> of length <code>n - 1</code> where <code>edges[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that there is an edge between nodes <code>a<sub>i</sub></code> and <code>b<sub>i</sub></code> in the tree.</p>
|
||||
|
||||
<p>You are allowed to <strong>delete</strong> some edges, splitting the tree into multiple connected components. Let the <strong>value</strong> of a component be the sum of <strong>all</strong> <code>nums[i]</code> for which node <code>i</code> is in the component.</p>
|
||||
|
||||
<p>Return<em> the <strong>maximum</strong> number of edges you can delete, such that every connected component in the tree has the same value.</em></p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
<img alt="" src="https://assets.leetcode.com/uploads/2022/08/26/diagramdrawio.png" style="width: 441px; height: 351px;" />
|
||||
<pre>
|
||||
<strong>Input:</strong> nums = [6,2,2,2,6], edges = [[0,1],[1,2],[1,3],[3,4]]
|
||||
<strong>Output:</strong> 2
|
||||
<strong>Explanation:</strong> The above figure shows how we can delete the edges [0,1] and [3,4]. The created components are nodes [0], [1,2,3] and [4]. The sum of the values in each component equals 6. It can be proven that no better deletion exists, so the answer is 2.
|
||||
</pre>
|
||||
|
||||
<p><strong class="example">Example 2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> nums = [2], edges = []
|
||||
<strong>Output:</strong> 0
|
||||
<strong>Explanation:</strong> There are no edges to be deleted.
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Constraints:</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>1 <= n <= 2 * 10<sup>4</sup></code></li>
|
||||
<li><code>nums.length == n</code></li>
|
||||
<li><code>1 <= nums[i] <= 50</code></li>
|
||||
<li><code>edges.length == n - 1</code></li>
|
||||
<li><code>edges[i].length == 2</code></li>
|
||||
<li><code>0 <= edges[i][0], edges[i][1] <= n - 1</code></li>
|
||||
<li><code>edges</code> represents a valid tree.</li>
|
||||
</ul>
|
||||
@ -0,0 +1,37 @@
|
||||
<p>Given an integer array <code>nums</code> that <strong>does not contain</strong> any zeros, find <strong>the largest positive</strong> integer <code>k</code> such that <code>-k</code> also exists in the array.</p>
|
||||
|
||||
<p>Return <em>the positive integer </em><code>k</code>. If there is no such integer, return <code>-1</code>.</p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> nums = [-1,2,-3,3]
|
||||
<strong>Output:</strong> 3
|
||||
<strong>Explanation:</strong> 3 is the only valid k we can find in the array.
|
||||
</pre>
|
||||
|
||||
<p><strong class="example">Example 2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> nums = [-1,10,6,7,-7,1]
|
||||
<strong>Output:</strong> 7
|
||||
<strong>Explanation:</strong> Both 1 and 7 have their corresponding negative values in the array. 7 has a larger value.
|
||||
</pre>
|
||||
|
||||
<p><strong class="example">Example 3:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> nums = [-10,8,6,7,-2,-3]
|
||||
<strong>Output:</strong> -1
|
||||
<strong>Explanation:</strong> There is no a single valid k, we return -1.
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Constraints:</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>1 <= nums.length <= 1000</code></li>
|
||||
<li><code>-1000 <= nums[i] <= 1000</code></li>
|
||||
<li><code>nums[i] != 0</code></li>
|
||||
</ul>
|
||||
44
leetcode/problem/minimize-maximum-of-array.html
Normal file
44
leetcode/problem/minimize-maximum-of-array.html
Normal file
@ -0,0 +1,44 @@
|
||||
<p>You are given a <strong>0-indexed</strong> array <code>nums</code> comprising of <code>n</code> non-negative integers.</p>
|
||||
|
||||
<p>In one operation, you must:</p>
|
||||
|
||||
<ul>
|
||||
<li>Choose an integer <code>i</code> such that <code>1 <= i < n</code> and <code>nums[i] > 0</code>.</li>
|
||||
<li>Decrease <code>nums[i]</code> by 1.</li>
|
||||
<li>Increase <code>nums[i - 1]</code> by 1.</li>
|
||||
</ul>
|
||||
|
||||
<p>Return<em> the <strong>minimum</strong> possible value of the <strong>maximum</strong> integer of </em><code>nums</code><em> after performing <strong>any</strong> number of operations</em>.</p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> nums = [3,7,1,6]
|
||||
<strong>Output:</strong> 5
|
||||
<strong>Explanation:</strong>
|
||||
One set of optimal operations is as follows:
|
||||
1. Choose i = 1, and nums becomes [4,6,1,6].
|
||||
2. Choose i = 3, and nums becomes [4,6,2,5].
|
||||
3. Choose i = 1, and nums becomes [5,5,2,5].
|
||||
The maximum integer of nums is 5. It can be shown that the maximum number cannot be less than 5.
|
||||
Therefore, we return 5.
|
||||
</pre>
|
||||
|
||||
<p><strong class="example">Example 2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> nums = [10,1]
|
||||
<strong>Output:</strong> 10
|
||||
<strong>Explanation:</strong>
|
||||
It is optimal to leave nums as is, and since 10 is the maximum value, we return 10.
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Constraints:</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>n == nums.length</code></li>
|
||||
<li><code>2 <= n <= 10<sup>5</sup></code></li>
|
||||
<li><code>0 <= nums[i] <= 10<sup>9</sup></code></li>
|
||||
</ul>
|
||||
40
leetcode/problem/number-of-valid-clock-times.html
Normal file
40
leetcode/problem/number-of-valid-clock-times.html
Normal file
@ -0,0 +1,40 @@
|
||||
<p>You are given a string of length <code>5</code> called <code>time</code>, representing the current time on a digital clock in the format <code>"hh:mm"</code>. The <strong>earliest</strong> possible time is <code>"00:00"</code> and the <strong>latest</strong> possible time is <code>"23:59"</code>.</p>
|
||||
|
||||
<p>In the string <code>time</code>, the digits represented by the <code>?</code> symbol are <strong>unknown</strong>, and must be <strong>replaced</strong> with a digit from <code>0</code> to <code>9</code>.</p>
|
||||
|
||||
<p>Return<em> an integer </em><code>answer</code><em>, the number of valid clock times that can be created by replacing every </em><code>?</code><em> with a digit from </em><code>0</code><em> to </em><code>9</code>.</p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> time = "?5:00"
|
||||
<strong>Output:</strong> 2
|
||||
<strong>Explanation:</strong> We can replace the ? with either a 0 or 1, producing "05:00" or "15:00". Note that we cannot replace it with a 2, since the time "25:00" is invalid. In total, we have two choices.
|
||||
</pre>
|
||||
|
||||
<p><strong class="example">Example 2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> time = "0?:0?"
|
||||
<strong>Output:</strong> 100
|
||||
<strong>Explanation:</strong> Each ? can be replaced by any digit from 0 to 9, so we have 100 total choices.
|
||||
</pre>
|
||||
|
||||
<p><strong class="example">Example 3:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> time = "??:??"
|
||||
<strong>Output:</strong> 1440
|
||||
<strong>Explanation:</strong> There are 24 possible choices for the hours, and 60 possible choices for the minutes. In total, we have 24 * 60 = 1440 choices.
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Constraints:</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>time</code> is a valid string of length <code>5</code> in the format <code>"hh:mm"</code>.</li>
|
||||
<li><code>"00" <= hh <= "23"</code></li>
|
||||
<li><code>"00" <= mm <= "59"</code></li>
|
||||
<li>Some of the digits might be replaced with <code>'?'</code> and need to be replaced with digits from <code>0</code> to <code>9</code>.</li>
|
||||
</ul>
|
||||
38
leetcode/problem/range-product-queries-of-powers.html
Normal file
38
leetcode/problem/range-product-queries-of-powers.html
Normal file
@ -0,0 +1,38 @@
|
||||
<p>Given a positive integer <code>n</code>, there exists a <strong>0-indexed</strong> array called <code>powers</code>, composed of the <strong>minimum</strong> number of powers of <code>2</code> that sum to <code>n</code>. The array is sorted in <strong>non-decreasing</strong> order, and there is <strong>only one</strong> way to form the array.</p>
|
||||
|
||||
<p>You are also given a <strong>0-indexed</strong> 2D integer array <code>queries</code>, where <code>queries[i] = [left<sub>i</sub>, right<sub>i</sub>]</code>. Each <code>queries[i]</code> represents a query where you have to find the product of all <code>powers[j]</code> with <code>left<sub>i</sub> <= j <= right<sub>i</sub></code>.</p>
|
||||
|
||||
<p>Return<em> an array </em><code>answers</code><em>, equal in length to </em><code>queries</code><em>, where </em><code>answers[i]</code><em> is the answer to the </em><code>i<sup>th</sup></code><em> query</em>. Since the answer to the <code>i<sup>th</sup></code> query may be too large, each <code>answers[i]</code> should be returned <strong>modulo</strong> <code>10<sup>9</sup> + 7</code>.</p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> n = 15, queries = [[0,1],[2,2],[0,3]]
|
||||
<strong>Output:</strong> [2,4,64]
|
||||
<strong>Explanation:</strong>
|
||||
For n = 15, powers = [1,2,4,8]. It can be shown that powers cannot be a smaller size.
|
||||
Answer to 1st query: powers[0] * powers[1] = 1 * 2 = 2.
|
||||
Answer to 2nd query: powers[2] = 4.
|
||||
Answer to 3rd query: powers[0] * powers[1] * powers[2] * powers[3] = 1 * 2 * 4 * 8 = 64.
|
||||
Each answer modulo 10<sup>9</sup> + 7 yields the same answer, so [2,4,64] is returned.
|
||||
</pre>
|
||||
|
||||
<p><strong class="example">Example 2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> n = 2, queries = [[0,0]]
|
||||
<strong>Output:</strong> [2]
|
||||
<strong>Explanation:</strong>
|
||||
For n = 2, powers = [2].
|
||||
The answer to the only query is powers[0] = 2. The answer modulo 10<sup>9</sup> + 7 is the same, so [2] is returned.
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Constraints:</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>1 <= n <= 10<sup>9</sup></code></li>
|
||||
<li><code>1 <= queries.length <= 10<sup>5</sup></code></li>
|
||||
<li><code>0 <= start<sub>i</sub> <= end<sub>i</sub> < powers.length</code></li>
|
||||
</ul>
|
||||
33
leetcode/problem/sum-of-number-and-its-reverse.html
Normal file
33
leetcode/problem/sum-of-number-and-its-reverse.html
Normal file
@ -0,0 +1,33 @@
|
||||
<p>Given a <strong>non-negative</strong> integer <code>num</code>, return <code>true</code><em> if </em><code>num</code><em> can be expressed as the sum of any <strong>non-negative</strong> integer and its reverse, or </em><code>false</code><em> otherwise.</em></p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> num = 443
|
||||
<strong>Output:</strong> true
|
||||
<strong>Explanation:</strong> 172 + 271 = 443 so we return true.
|
||||
</pre>
|
||||
|
||||
<p><strong class="example">Example 2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> num = 63
|
||||
<strong>Output:</strong> false
|
||||
<strong>Explanation:</strong> 63 cannot be expressed as the sum of a non-negative integer and its reverse so we return false.
|
||||
</pre>
|
||||
|
||||
<p><strong class="example">Example 3:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> num = 181
|
||||
<strong>Output:</strong> true
|
||||
<strong>Explanation:</strong> 140 + 041 = 181 so we return true. Note that when a number is reversed, there may be leading zeros.
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Constraints:</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>0 <= num <= 10<sup>5</sup></code></li>
|
||||
</ul>
|
||||
Loading…
Reference in New Issue
Block a user