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
bdec4f9224
commit
83a5997ef9
@ -1,6 +1,6 @@
|
||||
# 力扣题库（完整版）
|
||||
|
||||
> 最后更新日期： **2023.09.09**
|
||||
> 最后更新日期： **2023.09.20**
|
||||
>
|
||||
> 使用脚本前请务必仔细完整阅读本 `README.md` 文件
|
||||
|
||||
|
||||
File diff suppressed because it is too large
Load Diff
@ -0,0 +1,66 @@
|
||||
{
|
||||
"data": {
|
||||
"question": {
|
||||
"questionId": "3155",
|
||||
"questionFrontendId": "2853",
|
||||
"categoryTitle": "Database",
|
||||
"boundTopicId": 2443538,
|
||||
"title": "Highest Salaries Difference",
|
||||
"titleSlug": "highest-salaries-difference",
|
||||
"content": null,
|
||||
"translatedTitle": null,
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": true,
|
||||
"difficulty": "Easy",
|
||||
"likes": 0,
|
||||
"dislikes": 0,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[]",
|
||||
"contributors": [],
|
||||
"langToValidPlayground": null,
|
||||
"topicTags": [
|
||||
{
|
||||
"name": "Database",
|
||||
"slug": "database",
|
||||
"translatedName": "数据库",
|
||||
"__typename": "TopicTagNode"
|
||||
}
|
||||
],
|
||||
"companyTagStats": null,
|
||||
"codeSnippets": null,
|
||||
"stats": "{\"totalAccepted\": \"47\", \"totalSubmission\": \"66\", \"totalAcceptedRaw\": 47, \"totalSubmissionRaw\": 66, \"acRate\": \"71.2%\"}",
|
||||
"hints": [],
|
||||
"solution": null,
|
||||
"status": null,
|
||||
"sampleTestCase": "{\"headers\": {\"Salaries\": [\"emp_name\", \"department\", \"salary\"]},\"rows\": {\"Salaries\": [[\"Kathy\",\"Engineering\",50000],[\"Roy\",\"Marketing\",30000],[\"Charles\",\"Engineering\",45000],[\"Jack\",\"Engineering\",85000],[\"Benjamin\",\"Marketing\",34000],[\"Anthony\",\"Marketing\",42000],[\"Edward\",\"Engineering\",102000],[\"Terry\",\"Engineering\",44000],[\"Evelyn\",\"Marketing\",53000],[\"Arthur\",\"Engineering\",32000]]}}",
|
||||
"metaData": "{\"mysql\":[\"Create table if not exists Salaries(emp_name varchar(30), department varchar(30),salary int)\"],\"mssql\":[\"Create table Salaries(emp_name varchar(30), department varchar(30),salary int)\"],\"oraclesql\":[\"Create table Salaries(emp_name varchar(30), department varchar(30),salary int)\"],\"database\":true,\"languages\":[\"mysql\",\"mssql\",\"oraclesql\"],\"database_schema\":{\"Salaries\":{\"emp_name\":\"VARCHAR(30)\",\"department\":\"VARCHAR(30)\",\"salary\":\"INT\"}}}",
|
||||
"judgerAvailable": true,
|
||||
"judgeType": "large",
|
||||
"mysqlSchemas": [
|
||||
"Create table if not exists Salaries(emp_name varchar(30), department varchar(30),salary int)",
|
||||
"Truncate table Salaries",
|
||||
"insert into Salaries (emp_name, department, salary) values ('Kathy', 'Engineering', '50000')",
|
||||
"insert into Salaries (emp_name, department, salary) values ('Roy', 'Marketing', '30000')",
|
||||
"insert into Salaries (emp_name, department, salary) values ('Charles', 'Engineering', '45000')",
|
||||
"insert into Salaries (emp_name, department, salary) values ('Jack', 'Engineering', '85000')",
|
||||
"insert into Salaries (emp_name, department, salary) values ('Benjamin', 'Marketing', '34000')",
|
||||
"insert into Salaries (emp_name, department, salary) values ('Anthony', 'Marketing', '42000')",
|
||||
"insert into Salaries (emp_name, department, salary) values ('Edward', 'Engineering', '102000')",
|
||||
"insert into Salaries (emp_name, department, salary) values ('Terry', 'Engineering', '44000')",
|
||||
"insert into Salaries (emp_name, department, salary) values ('Evelyn', 'Marketing', '53000')",
|
||||
"insert into Salaries (emp_name, department, salary) values ('Arthur', 'Engineering', '32000')"
|
||||
],
|
||||
"enableRunCode": true,
|
||||
"envInfo": "{\"mysql\":[\"MySQL\",\"<p>\\u7248\\u672c\\uff1a<code>MySQL 8.0<\\/code><\\/p>\"],\"mssql\":[\"MS SQL Server\",\"<p>mssql server 2019.<\\/p>\"],\"oraclesql\":[\"Oracle\",\"<p>Oracle Sql 11.2.<\\/p>\"]}",
|
||||
"book": null,
|
||||
"isSubscribed": false,
|
||||
"isDailyQuestion": false,
|
||||
"dailyRecordStatus": null,
|
||||
"editorType": "CKEDITOR",
|
||||
"ugcQuestionId": null,
|
||||
"style": "LEETCODE",
|
||||
"exampleTestcases": "{\"headers\": {\"Salaries\": [\"emp_name\", \"department\", \"salary\"]},\"rows\": {\"Salaries\": [[\"Kathy\",\"Engineering\",50000],[\"Roy\",\"Marketing\",30000],[\"Charles\",\"Engineering\",45000],[\"Jack\",\"Engineering\",85000],[\"Benjamin\",\"Marketing\",34000],[\"Anthony\",\"Marketing\",42000],[\"Edward\",\"Engineering\",102000],[\"Terry\",\"Engineering\",44000],[\"Evelyn\",\"Marketing\",53000],[\"Arthur\",\"Engineering\",32000]]}}",
|
||||
"__typename": "QuestionNode"
|
||||
}
|
||||
}
|
||||
}
|
||||
@ -0,0 +1,73 @@
|
||||
{
|
||||
"data": {
|
||||
"question": {
|
||||
"questionId": "3156",
|
||||
"questionFrontendId": "2854",
|
||||
"categoryTitle": "Database",
|
||||
"boundTopicId": 2444194,
|
||||
"title": "Rolling Average Steps",
|
||||
"titleSlug": "rolling-average-steps",
|
||||
"content": null,
|
||||
"translatedTitle": null,
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": true,
|
||||
"difficulty": "Medium",
|
||||
"likes": 0,
|
||||
"dislikes": 0,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[]",
|
||||
"contributors": [],
|
||||
"langToValidPlayground": null,
|
||||
"topicTags": [
|
||||
{
|
||||
"name": "Database",
|
||||
"slug": "database",
|
||||
"translatedName": "数据库",
|
||||
"__typename": "TopicTagNode"
|
||||
}
|
||||
],
|
||||
"companyTagStats": null,
|
||||
"codeSnippets": null,
|
||||
"stats": "{\"totalAccepted\": \"44\", \"totalSubmission\": \"59\", \"totalAcceptedRaw\": 44, \"totalSubmissionRaw\": 59, \"acRate\": \"74.6%\"}",
|
||||
"hints": [],
|
||||
"solution": null,
|
||||
"status": null,
|
||||
"sampleTestCase": "{\"headers\": {\"Steps\": [\"user_id\", \"steps_count\", \"steps_date\"]}, \"rows\": {\"Steps\": [[1,687,\"2021-09-02\"],[1,395,\"2021-09-04\"],[1,499,\"2021-09-05\"],[1,712,\"2021-09-06\"],[1,576,\"2021-09-07\"],[2,153,\"2021-09-06\"],[2,171,\"2021-09-07\"],[2,530,\"2021-09-08\"],[3,945,\"2021-09-04\"],[3,120,\"2021-09-07\"],[3,557,\"2021-09-08\"],[3,840,\"2021-09-09\"],[3,627,\"2021-09-10\"],[5,382,\"2021-09-05\"],[6,480,\"2021-09-01\"],[6,191,\"2021-09-02\"],[6,303,\"2021-09-05\"]]}}",
|
||||
"metaData": "{\"mysql\":[\"Create table if not exists Steps(user_id int, steps_count int, steps_date date)\"],\"mssql\":[\"Create table Steps(user_id int, steps_count int, steps_date date)\"],\"oraclesql\":[\"Create table Steps(user_id int, steps_count int, steps_date date)\",\"ALTER SESSION SET nls_date_format='YYYY-MM-DD'\"],\"database\":true,\"name\":\"rolling_average\",\"pythondata\":[\"Steps = pd.DataFrame([], columns=['user_id', 'steps_count', 'steps_date']).astype({'user_id':'Int64', 'steps_count':'Int64', 'steps_date':'datetime64[ns]'})\"],\"database_schema\":{\"Steps\":{\"user_id\":\"INT\",\"steps_count\":\"INT\",\"steps_date\":\"DATE\"}}}",
|
||||
"judgerAvailable": true,
|
||||
"judgeType": "large",
|
||||
"mysqlSchemas": [
|
||||
"Create table if not exists Steps(user_id int, steps_count int, steps_date date)",
|
||||
"Truncate table Steps",
|
||||
"insert into Steps (user_id, steps_count, steps_date) values ('1', '687', '2021-09-02')",
|
||||
"insert into Steps (user_id, steps_count, steps_date) values ('1', '395', '2021-09-04')",
|
||||
"insert into Steps (user_id, steps_count, steps_date) values ('1', '499', '2021-09-05')",
|
||||
"insert into Steps (user_id, steps_count, steps_date) values ('1', '712', '2021-09-06')",
|
||||
"insert into Steps (user_id, steps_count, steps_date) values ('1', '576', '2021-09-07')",
|
||||
"insert into Steps (user_id, steps_count, steps_date) values ('2', '153', '2021-09-06')",
|
||||
"insert into Steps (user_id, steps_count, steps_date) values ('2', '171', '2021-09-07')",
|
||||
"insert into Steps (user_id, steps_count, steps_date) values ('2', '530', '2021-09-08')",
|
||||
"insert into Steps (user_id, steps_count, steps_date) values ('3', '945', '2021-09-04')",
|
||||
"insert into Steps (user_id, steps_count, steps_date) values ('3', '120', '2021-09-07')",
|
||||
"insert into Steps (user_id, steps_count, steps_date) values ('3', '557', '2021-09-08')",
|
||||
"insert into Steps (user_id, steps_count, steps_date) values ('3', '840', '2021-09-09')",
|
||||
"insert into Steps (user_id, steps_count, steps_date) values ('3', '627', '2021-09-10')",
|
||||
"insert into Steps (user_id, steps_count, steps_date) values ('5', '382', '2021-09-05')",
|
||||
"insert into Steps (user_id, steps_count, steps_date) values ('6', '480', '2021-09-01')",
|
||||
"insert into Steps (user_id, steps_count, steps_date) values ('6', '191', '2021-09-02')",
|
||||
"insert into Steps (user_id, steps_count, steps_date) values ('6', '303', '2021-09-05')"
|
||||
],
|
||||
"enableRunCode": true,
|
||||
"envInfo": "{\"mysql\":[\"MySQL\",\"<p>\\u7248\\u672c\\uff1a<code>MySQL 8.0<\\/code><\\/p>\"],\"mssql\":[\"MS SQL Server\",\"<p>mssql server 2019.<\\/p>\"],\"oraclesql\":[\"Oracle\",\"<p>Oracle Sql 11.2.<\\/p>\"],\"pythondata\":[\"Pandas\",\"<p>Python 3.10 with Pandas 2.0.2 and NumPy 1.25.0<\\/p>\"]}",
|
||||
"book": null,
|
||||
"isSubscribed": false,
|
||||
"isDailyQuestion": false,
|
||||
"dailyRecordStatus": null,
|
||||
"editorType": "CKEDITOR",
|
||||
"ugcQuestionId": null,
|
||||
"style": "LEETCODE",
|
||||
"exampleTestcases": "{\"headers\": {\"Steps\": [\"user_id\", \"steps_count\", \"steps_date\"]}, \"rows\": {\"Steps\": [[1,687,\"2021-09-02\"],[1,395,\"2021-09-04\"],[1,499,\"2021-09-05\"],[1,712,\"2021-09-06\"],[1,576,\"2021-09-07\"],[2,153,\"2021-09-06\"],[2,171,\"2021-09-07\"],[2,530,\"2021-09-08\"],[3,945,\"2021-09-04\"],[3,120,\"2021-09-07\"],[3,557,\"2021-09-08\"],[3,840,\"2021-09-09\"],[3,627,\"2021-09-10\"],[5,382,\"2021-09-05\"],[6,480,\"2021-09-01\"],[6,191,\"2021-09-02\"],[6,303,\"2021-09-05\"]]}}",
|
||||
"__typename": "QuestionNode"
|
||||
}
|
||||
}
|
||||
}
|
||||
File diff suppressed because one or more lines are too long
File diff suppressed because one or more lines are too long
File diff suppressed because one or more lines are too long
184
leetcode-cn/originData/happy-students.json
Normal file
184
leetcode-cn/originData/happy-students.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
176
leetcode-cn/originData/maximum-number-of-alloys.json
Normal file
176
leetcode-cn/originData/maximum-number-of-alloys.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
File diff suppressed because one or more lines are too long
File diff suppressed because one or more lines are too long
File diff suppressed because one or more lines are too long
182
leetcode-cn/originData/points-that-intersect-with-cars.json
Normal file
182
leetcode-cn/originData/points-that-intersect-with-cars.json
Normal file
File diff suppressed because one or more lines are too long
190
leetcode-cn/originData/string-transformation.json
Normal file
190
leetcode-cn/originData/string-transformation.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
@ -0,0 +1,31 @@
|
||||
<p>给你一个下标从 <strong>0</strong> 开始的二维整数数组 <code>nums</code> 表示汽车停放在数轴上的坐标。对于任意下标 <code>i</code>，<code>nums[i] = [start<sub>i</sub>, end<sub>i</sub>]</code> ，其中 <code>start<sub>i</sub></code> 是第 <code>i</code> 辆车的起点，<code>end<sub>i</sub></code> 是第 <code>i</code> 辆车的终点。</p>
|
||||
|
||||
<p>返回数轴上被车 <strong>任意部分</strong> 覆盖的整数点的数目。</p>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong class="example">示例 1：</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>输入：</strong>nums = [[3,6],[1,5],[4,7]]
|
||||
<strong>输出：</strong>7
|
||||
<strong>解释：</strong>从 1 到 7 的所有点都至少与一辆车相交，因此答案为 7 。
|
||||
</pre>
|
||||
|
||||
<p><strong class="example">示例 2：</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>输入：</strong>nums = [[1,3],[5,8]]
|
||||
<strong>输出：</strong>7
|
||||
<strong>解释：</strong>1、2、3、5、6、7、8 共计 7 个点满足至少与一辆车相交，因此答案为 7 。
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong>提示：</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>1 <= nums.length <= 100</code></li>
|
||||
<li><code>nums[i].length == 2</code></li>
|
||||
<li><code><font face="monospace">1 <= start<sub>i</sub> <= end<sub>i</sub> <= 100</font></code></li>
|
||||
</ul>
|
||||
@ -0,0 +1,41 @@
|
||||
<p>给你一个长度为 <code>n</code> 下标从 <strong>0</strong> 开始的数组 <code>nums</code> ，数组中的元素为 <strong>互不相同</strong> 的正整数。请你返回让 <code>nums</code> 成为递增数组的 <strong>最少右移</strong> 次数，如果无法得到递增数组，返回 <code>-1</code> 。</p>
|
||||
|
||||
<p>一次 <strong>右移</strong> 指的是同时对所有下标进行操作，将下标为 <code>i</code> 的元素移动到下标 <code>(i + 1) % n</code> 处。</p>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong class="example">示例 1：</strong></p>
|
||||
|
||||
<pre>
|
||||
<b>输入：</b>nums = [3,4,5,1,2]
|
||||
<b>输出：</b>2
|
||||
<b>解释：</b>
|
||||
第一次右移后，nums = [2,3,4,5,1] 。
|
||||
第二次右移后，nums = [1,2,3,4,5] 。
|
||||
现在 nums 是递增数组了，所以答案为 2 。
|
||||
</pre>
|
||||
|
||||
<p><strong class="example">示例 2：</strong></p>
|
||||
|
||||
<pre>
|
||||
<b>输入：</b>nums = [1,3,5]
|
||||
<b>输出：</b>0
|
||||
<b>解释：</b>nums 已经是递增数组了，所以答案为 0 。</pre>
|
||||
|
||||
<p><strong class="example">示例 3：</strong></p>
|
||||
|
||||
<pre>
|
||||
<b>输入：</b>nums = [2,1,4]
|
||||
<b>输出：</b>-1
|
||||
<b>解释：</b>无法将数组变为递增数组。
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong>提示：</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>1 <= nums.length <= 100</code></li>
|
||||
<li><code>1 <= nums[i] <= 100</code></li>
|
||||
<li><code>nums</code> 中的整数互不相同。</li>
|
||||
</ul>
|
||||
@ -0,0 +1,59 @@
|
||||
<p>给你一个下标从 <strong>0</strong> 开始的 <strong>非递减</strong> 整数数组 <code>nums</code> 。</p>
|
||||
|
||||
<p>你可以执行以下操作任意次：</p>
|
||||
|
||||
<ul>
|
||||
<li>选择 <strong>两个 </strong>下标 <code>i</code> 和 <code>j</code> ，满足 <code>i < j</code> 且 <code>nums[i] < nums[j]</code> 。</li>
|
||||
<li>将 <code>nums</code> 中下标在 <code>i</code> 和 <code>j</code> 处的元素删除。剩余元素按照原来的顺序组成新的数组，下标也重新从 <strong>0</strong> 开始编号。</li>
|
||||
</ul>
|
||||
|
||||
<p>请你返回一个整数，表示执行以上操作任意次后（可以执行 <strong>0</strong> 次），<code>nums</code> 数组的 <strong>最小</strong> 数组长度。</p>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong class="example">示例 1：</strong></p>
|
||||
|
||||
<pre>
|
||||
<b>输入：</b>nums = [1,3,4,9]
|
||||
<b>输出：</b>0
|
||||
<b>解释：</b>一开始，nums = [1, 3, 4, 9] 。
|
||||
第一次操作，我们选择下标 0 和 1 ，满足 nums[0] < nums[1] <=> 1 < 3 。
|
||||
删除下标 0 和 1 处的元素，nums 变成 [4, 9] 。
|
||||
下一次操作，我们选择下标 0 和 1 ，满足 nums[0] < nums[1] <=> 4 < 9 。
|
||||
删除下标 0 和 1 处的元素，nums 变成空数组 [] 。
|
||||
所以，可以得到的最小数组长度为 0 。</pre>
|
||||
|
||||
<p><strong class="example">示例 2：</strong></p>
|
||||
|
||||
<pre>
|
||||
<b>输入：</b>nums = [2,3,6,9]
|
||||
<b>输出：</b>0
|
||||
<b>解释：</b>一开始，nums = [2, 3, 6, 9] 。
|
||||
第一次操作，我们选择下标 0 和 2 ，满足 nums[0] < nums[2] <=> 2 < 6 。
|
||||
删除下标 0 和 2 处的元素，nums 变成 [3, 9] 。
|
||||
下一次操作，我们选择下标 0 和 1 ，满足 nums[0] < nums[1] <=> 3 < 9 。
|
||||
删除下标 0 和 1 处的元素，nums 变成空数组 [] 。
|
||||
所以，可以得到的最小数组长度为 0 。
|
||||
</pre>
|
||||
|
||||
<p><strong class="example">示例 3：</strong></p>
|
||||
|
||||
<pre>
|
||||
<b>输入：</b>nums = [1,1,2]
|
||||
<b>输出：</b>1
|
||||
<b>解释：</b>一开始，nums = [1, 1, 2] 。
|
||||
第一次操作，我们选择下标 0 和 2 ，满足 nums[0] < nums[2] <=> 1 < 2 。
|
||||
删除下标 0 和 2 处的元素，nums 变成 [1] 。
|
||||
无法对数组再执行操作。
|
||||
所以，可以得到的最小数组长度为 1 。
|
||||
</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>9</sup></code></li>
|
||||
<li><code>nums</code> 是 <strong>非递减</strong> 数组。</li>
|
||||
</ul>
|
||||
@ -0,0 +1,34 @@
|
||||
<p>给你四个整数 <code>sx</code>、<code>sy</code>、<code>fx</code>、<code>fy</code> 以及一个 <strong>非负整数</strong> <code>t</code> 。</p>
|
||||
|
||||
<p>在一个无限的二维网格中，你从单元格 <code>(sx, sy)</code> 开始出发。每一秒，你 <strong>必须</strong> 移动到任一与之前所处单元格相邻的单元格中。</p>
|
||||
|
||||
<p>如果你能在 <strong>恰好 </strong><code>t</code><strong> 秒</strong> 后到达单元格<em> </em><code>(fx, fy)</code> ，返回 <code>true</code> ；否则，返回 <code>false</code> 。</p>
|
||||
|
||||
<p>单元格的 <strong>相邻单元格</strong> 是指该单元格周围与其至少共享一个角的 8 个单元格。你可以多次访问同一个单元格。</p>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong class="example">示例 1：</strong></p>
|
||||
<img alt="" src="https://assets.leetcode.com/uploads/2023/08/05/example2.svg" style="width: 443px; height: 243px;" />
|
||||
<pre>
|
||||
<strong>输入：</strong>sx = 2, sy = 4, fx = 7, fy = 7, t = 6
|
||||
<strong>输出：</strong>true
|
||||
<strong>解释：</strong>从单元格 (2, 4) 开始出发，穿过上图标注的单元格，可以在恰好 6 秒后到达单元格 (7, 7) 。
|
||||
</pre>
|
||||
|
||||
<p><strong class="example">示例 2：</strong></p>
|
||||
<img alt="" src="https://assets.leetcode.com/uploads/2023/08/05/example1.svg" style="width: 383px; height: 202px;" />
|
||||
<pre>
|
||||
<strong>输入：</strong>sx = 3, sy = 1, fx = 7, fy = 3, t = 3
|
||||
<strong>输出：</strong>false
|
||||
<strong>解释：</strong>从单元格 (3, 1) 开始出发，穿过上图标注的单元格，至少需要 4 秒后到达单元格 (7, 3) 。 因此，无法在 3 秒后到达单元格 (7, 3) 。
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong>提示：</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>1 <= sx, sy, fx, fy <= 10<sup>9</sup></code></li>
|
||||
<li><code>0 <= t <= 10<sup>9</sup></code></li>
|
||||
</ul>
|
||||
@ -0,0 +1,59 @@
|
||||
<p>给你一个 <code>n</code> 个点的 <strong>简单有向图</strong> （没有重复边的有向图），节点编号为 <code>0</code> 到 <code>n - 1</code> 。如果这些边是双向边，那么这个图形成一棵 <strong>树</strong> 。</p>
|
||||
|
||||
<p>给你一个整数 <code>n</code> 和一个 <strong>二维</strong> 整数数组 <code>edges</code> ，其中 <code>edges[i] = [u<sub>i</sub>, v<sub>i</sub>]</code> 表示从节点 <code>u<sub>i</sub></code> 到节点 <code>v<sub>i</sub></code> 有一条 <strong>有向边</strong> 。</p>
|
||||
|
||||
<p><strong>边反转</strong> 指的是将一条边的方向反转，也就是说一条从节点 <code>u<sub>i</sub></code> 到节点 <code>v<sub>i</sub></code> 的边会变为一条从节点 <code>v<sub>i</sub></code> 到节点 <code>u<sub>i</sub></code> 的边。</p>
|
||||
|
||||
<p>对于范围 <code>[0, n - 1]</code> 中的每一个节点 <code>i</code> ，你的任务是分别 <strong>独立</strong> 计算 <strong>最少</strong> 需要多少次 <strong>边反转</strong> ，从节点 <code>i</code> 出发经过 <strong>一系列有向边</strong> ，可以到达所有的节点。</p>
|
||||
|
||||
<p>请你返回一个长度为 <code>n</code> 的整数数组<em> </em><code>answer</code><em> </em>，其中<em> </em><code>answer[i]</code>表示从节点 <code>i</code> 出发，可以到达所有节点的 <strong>最少边反转</strong> 次数。</p>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong class="example">示例 1：</strong></p>
|
||||
|
||||
<p><img height="246" src="https://assets.leetcode.com/uploads/2023/08/26/image-20230826221104-3.png" width="312" /></p>
|
||||
|
||||
<pre>
|
||||
<b>输入：</b>n = 4, edges = [[2,0],[2,1],[1,3]]
|
||||
<b>输出：</b>[1,1,0,2]
|
||||
<b>解释：</b>上图表示了与输入对应的简单有向图。
|
||||
对于节点 0 ：反转 [2,0] ，从节点 0 出发可以到达所有节点。
|
||||
所以 answer[0] = 1 。
|
||||
对于节点 1 ：反转 [2,1] ，从节点 1 出发可以到达所有节点。
|
||||
所以 answer[1] = 1 。
|
||||
对于节点 2 ：不需要反转就可以从节点 2 出发到达所有节点。
|
||||
所以 answer[2] = 0 。
|
||||
对于节点 3 ：反转 [1,3] 和 [2,1] ，从节点 3 出发可以到达所有节点。
|
||||
所以 answer[3] = 2 。
|
||||
</pre>
|
||||
|
||||
<p><strong class="example">示例 2：</strong></p>
|
||||
|
||||
<p><img height="217" src="https://assets.leetcode.com/uploads/2023/08/26/image-20230826225541-2.png" width="322" /></p>
|
||||
|
||||
<pre>
|
||||
<b>输入：</b>n = 3, edges = [[1,2],[2,0]]
|
||||
<b>输出：</b>[2,0,1]
|
||||
<b>解释：</b>上图表示了与输入对应的简单有向图。
|
||||
对于节点 0 ：反转 [2,0] 和 [1,2] ，从节点 0 出发可以到达所有节点。
|
||||
所以 answer[0] = 2 。
|
||||
对于节点 1 ：不需要反转就可以从节点 2 出发到达所有节点。
|
||||
所以 answer[1] = 0 。
|
||||
对于节点 2 ：反转 [1,2] ，从节点 2 出发可以到达所有节点。
|
||||
所以 answer[2] = 1 。
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong>提示：</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>2 <= n <= 10<sup>5</sup></code></li>
|
||||
<li><code>edges.length == n - 1</code></li>
|
||||
<li><code>edges[i].length == 2</code></li>
|
||||
<li><code>0 <= u<sub>i</sub> == edges[i][0] < n</code></li>
|
||||
<li><code>0 <= v<sub>i</sub> == edges[i][1] < n</code></li>
|
||||
<li><code>u<sub>i</sub> != v<sub>i</sub></code></li>
|
||||
<li>输入保证如果边是双向边，可以得到一棵树。</li>
|
||||
</ul>
|
||||
@ -0,0 +1,51 @@
|
||||
<p>给你两个长度都为 <code>n</code> 的字符串 <code>s</code> 和 <code>t</code> 。你可以对字符串 <code>s</code> 执行以下操作：</p>
|
||||
|
||||
<ul>
|
||||
<li>将 <code>s</code> 长度为 <code>l</code> （<code>0 < l < n</code>）的 <strong>后缀字符串</strong> 删除，并将它添加在 <code>s</code> 的开头。<br />
|
||||
比方说，<code>s = 'abcd'</code> ，那么一次操作中，你可以删除后缀 <code>'cd'</code> ，并将它添加到 <code>s</code> 的开头，得到 <code>s = 'cdab'</code> 。</li>
|
||||
</ul>
|
||||
|
||||
<p>给你一个整数 <code>k</code> ，请你返回 <strong>恰好</strong> <code>k</code> 次操作将<em> </em><code>s</code> 变为<em> </em><code>t</code> 的方案数。</p>
|
||||
|
||||
<p>由于答案可能很大，返回答案对 <code>10<sup>9</sup> + 7</code> <strong>取余</strong> 后的结果。</p>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong class="example">示例 1：</strong></p>
|
||||
|
||||
<pre>
|
||||
<b>输入：</b>s = "abcd", t = "cdab", k = 2
|
||||
<b>输出：</b>2
|
||||
<b>解释：</b>
|
||||
第一种方案：
|
||||
第一次操作，选择 index = 3 开始的后缀，得到 s = "dabc" 。
|
||||
第二次操作，选择 index = 3 开始的后缀，得到 s = "cdab" 。
|
||||
|
||||
第二种方案：
|
||||
第一次操作，选择 index = 1 开始的后缀，得到 s = "bcda" 。
|
||||
第二次操作，选择 index = 1 开始的后缀，得到 s = "cdab" 。
|
||||
</pre>
|
||||
|
||||
<p><strong class="example">示例 2：</strong></p>
|
||||
|
||||
<pre>
|
||||
<b>输入：</b>s = "ababab", t = "ababab", k = 1
|
||||
<b>输出：</b>2
|
||||
<b>解释：</b>
|
||||
第一种方案：
|
||||
选择 index = 2 开始的后缀，得到 s = "ababab" 。
|
||||
|
||||
第二种方案：
|
||||
选择 index = 4 开始的后缀，得到 s = "ababab" 。
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong>提示：</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>2 <= s.length <= 5 * 10<sup>5</sup></code></li>
|
||||
<li><code>1 <= k <= 10<sup>15</sup></code></li>
|
||||
<li><code>s.length == t.length</code></li>
|
||||
<li><code>s</code> 和 <code>t</code> 都只包含小写英文字母。</li>
|
||||
</ul>
|
||||
@ -0,0 +1,45 @@
|
||||
<p>给你一个下标从 <strong>1</strong> 开始、由 <code>n</code> 个整数组成的数组。</p>
|
||||
|
||||
<p>如果一组数字中每对元素的乘积都是一个完全平方数，则称这组数字是一个 <strong>完全集</strong> 。</p>
|
||||
|
||||
<p>下标集 <code>{1, 2, ..., n}</code> 的子集可以表示为 <code>{i<sub>1</sub>, i<sub>2</sub>, ..., i<sub>k</sub>}</code>，我们定义对应该子集的 <strong>元素和</strong> 为 <code>nums[i<sub>1</sub>] + nums[i<sub>2</sub>] + ... + nums[i<sub>k</sub>]</code> 。</p>
|
||||
|
||||
<p>返回下标集 <code>{1, 2, ..., n}</code> 的 <strong>完全子集</strong> 所能取到的 <strong>最大元素和</strong> 。</p>
|
||||
|
||||
<p>完全平方数是指可以表示为一个整数和其自身相乘的数。</p>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong>示例 1：</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>输入：</strong>nums = [8,7,3,5,7,2,4,9]
|
||||
<strong>输出：</strong>16
|
||||
<strong>解释：</strong>除了由单个下标组成的子集之外，还有两个下标集的完全子集：{1,4} 和 {2,8} 。
|
||||
与下标 1 和 4 对应的元素和等于 nums[1] + nums[4] = 8 + 5 = 13 。
|
||||
与下标 2 和 8 对应的元素和等于 nums[2] + nums[8] = 7 + 9 = 16 。
|
||||
因此，下标集的完全子集可以取到的最大元素和为 16 。
|
||||
</pre>
|
||||
|
||||
<p><strong>示例 2：</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>输入：</strong>nums = [5,10,3,10,1,13,7,9,4]
|
||||
<strong>输出：</strong>19
|
||||
<strong>解释：</strong>除了由单个下标组成的子集之外，还有四个下标集的完全子集：{1,4}、{1,9}、{2,8}、{4,9} 和 {1,4,9} 。
|
||||
与下标 1 和 4 对应的元素和等于 nums[1] + nums[4] = 5 + 10 = 15 。
|
||||
与下标 1 和 9 对应的元素和等于 nums[1] + nums[9] = 5 + 4 = 9 。
|
||||
与下标 2 和 8 对应的元素和等于 nums[2] + nums[8] = 10 + 9 = 19 。
|
||||
与下标 4 和 9 对应的元素和等于 nums[4] + nums[9] = 10 + 4 = 14 。
|
||||
与下标 1、4 和 9 对应的元素和等于 nums[1] + nums[4] + nums[9] = 5 + 10 + 4 = 19 。
|
||||
因此，下标集的完全子集可以取到的最大元素和为 19 。
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong>提示：</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>1 <= n == nums.length <= 10<sup>4</sup></code></li>
|
||||
<li><code>1 <= nums[i] <= 10<sup>9</sup></code></li>
|
||||
</ul>
|
||||
@ -0,0 +1,48 @@
|
||||
<p>给你一个大小为 <code>3 * 3</code> ，下标从 <strong>0</strong> 开始的二维整数矩阵 <code>grid</code> ，分别表示每一个格子里石头的数目。网格图中总共恰好有 <code>9</code> 个石头，一个格子里可能会有 <strong>多个</strong> 石头。</p>
|
||||
|
||||
<p>每一次操作中，你可以将一个石头从它当前所在格子移动到一个至少有一条公共边的相邻格子。</p>
|
||||
|
||||
<p>请你返回每个格子恰好有一个石头的 <strong>最少移动次数</strong> 。</p>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong class="example">示例 1：</strong></p>
|
||||
|
||||
<p><img alt="" src="https://assets.leetcode.com/uploads/2023/08/23/example1-3.svg" style="width: 401px; height: 281px;" /></p>
|
||||
|
||||
<pre>
|
||||
<b>输入：</b>grid = [[1,1,0],[1,1,1],[1,2,1]]
|
||||
<b>输出：</b>3
|
||||
<b>解释：</b>让每个格子都有一个石头的一个操作序列为：
|
||||
1 - 将一个石头从格子 (2,1) 移动到 (2,2) 。
|
||||
2 - 将一个石头从格子 (2,2) 移动到 (1,2) 。
|
||||
3 - 将一个石头从格子 (1,2) 移动到 (0,2) 。
|
||||
总共需要 3 次操作让每个格子都有一个石头。
|
||||
让每个格子都有一个石头的最少操作次数为 3 。
|
||||
</pre>
|
||||
|
||||
<p><strong class="example">示例 2：</strong></p>
|
||||
|
||||
<p><img alt="" src="https://assets.leetcode.com/uploads/2023/08/23/example2-2.svg" style="width: 401px; height: 281px;" /></p>
|
||||
|
||||
<pre>
|
||||
<b>输入：</b>grid = [[1,3,0],[1,0,0],[1,0,3]]
|
||||
<b>输出：</b>4
|
||||
<b>解释：</b>让每个格子都有一个石头的一个操作序列为：
|
||||
1 - 将一个石头从格子 (0,1) 移动到 (0,2) 。
|
||||
2 - 将一个石头从格子 (0,1) 移动到 (1,1) 。
|
||||
3 - 将一个石头从格子 (2,2) 移动到 (1,2) 。
|
||||
4 - 将一个石头从格子 (2,2) 移动到 (2,1) 。
|
||||
总共需要 4 次操作让每个格子都有一个石头。
|
||||
让每个格子都有一个石头的最少操作次数为 4 。
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong>提示：</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>grid.length == grid[i].length == 3</code></li>
|
||||
<li><code>0 <= grid[i][j] <= 9</code></li>
|
||||
<li><code>grid</code> 中元素之和为 <code>9</code> 。</li>
|
||||
</ul>
|
||||
@ -0,0 +1,68 @@
|
||||
<p>假设你是一家合金制造公司的老板，你的公司使用多种金属来制造合金。现在共有 <code>n</code> 种不同类型的金属可以使用，并且你可以使用 <code>k</code> 台机器来制造合金。每台机器都需要特定数量的每种金属来创建合金。</p>
|
||||
|
||||
<p>对于第 <code>i</code> 台机器而言，创建合金需要 <code>composition[i][j]</code> 份 <code>j</code> 类型金属。最初，你拥有 <code>stock[i]</code> 份 <code>i</code> 类型金属，而每购入一份 <code>i</code> 类型金属需要花费 <code>cost[i]</code> 的金钱。</p>
|
||||
|
||||
<p>给你整数 <code>n</code>、<code>k</code>、<code>budget</code>，下标从 <strong>1</strong> 开始的二维数组 <code>composition</code>，两个下标从 <strong>1</strong> 开始的数组 <code>stock</code> 和 <code>cost</code>，请你在预算不超过 <code>budget</code> 金钱的前提下，<strong>最大化</strong> 公司制造合金的数量。</p>
|
||||
|
||||
<p><strong>所有合金都需要由同一台机器制造。</strong></p>
|
||||
|
||||
<p>返回公司可以制造的最大合金数。</p>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong class="example">示例 1：</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>输入：</strong>n = 3, k = 2, budget = 15, composition = [[1,1,1],[1,1,10]], stock = [0,0,0], cost = [1,2,3]
|
||||
<strong>输出：</strong>2
|
||||
<strong>解释：</strong>最优的方法是使用第 1 台机器来制造合金。
|
||||
要想制造 2 份合金，我们需要购买：
|
||||
- 2 份第 1 类金属。
|
||||
- 2 份第 2 类金属。
|
||||
- 2 份第 3 类金属。
|
||||
总共需要 2 * 1 + 2 * 2 + 2 * 3 = 12 的金钱，小于等于预算 15 。
|
||||
注意，我们最开始时候没有任何一类金属，所以必须买齐所有需要的金属。
|
||||
可以证明在示例条件下最多可以制造 2 份合金。
|
||||
</pre>
|
||||
|
||||
<p><strong class="example">示例 2：</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>输入：</strong>n = 3, k = 2, budget = 15, composition = [[1,1,1],[1,1,10]], stock = [0,0,100], cost = [1,2,3]
|
||||
<strong>输出：</strong>5
|
||||
<strong>解释：</strong>最优的方法是使用第 2 台机器来制造合金。
|
||||
要想制造 5 份合金，我们需要购买：
|
||||
- 5 份第 1 类金属。
|
||||
- 5 份第 2 类金属。
|
||||
- 0 份第 3 类金属。
|
||||
总共需要 5 * 1 + 5 * 2 + 0 * 3 = 15 的金钱，小于等于预算 15 。
|
||||
可以证明在示例条件下最多可以制造 5 份合金。
|
||||
</pre>
|
||||
|
||||
<p><strong class="example">示例 3：</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>输入：</strong>n = 2, k = 3, budget = 10, composition = [[2,1],[1,2],[1,1]], stock = [1,1], cost = [5,5]
|
||||
<strong>输出：</strong>2
|
||||
<strong>解释：</strong>最优的方法是使用第 3 台机器来制造合金。
|
||||
要想制造 2 份合金，我们需要购买：
|
||||
- 1 份第 1 类金属。
|
||||
- 1 份第 2 类金属。
|
||||
总共需要 1 * 5 + 1 * 5 = 10 的金钱，小于等于预算 10 。
|
||||
可以证明在示例条件下最多可以制造 2 份合金。
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong>提示：</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>1 <= n, k <= 100</code></li>
|
||||
<li><code>0 <= budget <= 10<sup>8</sup></code></li>
|
||||
<li><code>composition.length == k</code></li>
|
||||
<li><code>composition[i].length == n</code></li>
|
||||
<li><code>1 <= composition[i][j] <= 100</code></li>
|
||||
<li><code>stock.length == cost.length == n</code></li>
|
||||
<li><code>0 <= stock[i] <= 10<sup>8</sup></code></li>
|
||||
<li><code>1 <= cost[i] <= 100</code></li>
|
||||
</ul>
|
||||
@ -0,0 +1,35 @@
|
||||
<p>给你一个 <strong>二维</strong> 整数数组 <code>coordinates</code> 和一个整数 <code>k</code> ，其中 <code>coordinates[i] = [x<sub>i</sub>, y<sub>i</sub>]</code> 是第 <code>i</code> 个点在二维平面里的坐标。</p>
|
||||
|
||||
<p>我们定义两个点 <code>(x<sub>1</sub>, y<sub>1</sub>)</code> 和 <code>(x<sub>2</sub>, y<sub>2</sub>)</code> 的 <strong>距离</strong> 为 <code>(x1 XOR x2) + (y1 XOR y2)</code> ，<code>XOR</code> 指的是按位异或运算。</p>
|
||||
|
||||
<p>请你返回满足<em> </em><code>i < j</code><em> </em>且点<em> </em><code>i</code><em> </em>和点<em> </em><code>j</code>之间距离为<em> </em><code>k</code> 的点对数目。</p>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong class="example">示例 1：</strong></p>
|
||||
|
||||
<pre>
|
||||
<b>输入：</b>coordinates = [[1,2],[4,2],[1,3],[5,2]], k = 5
|
||||
<b>输出：</b>2
|
||||
<b>解释：</b>以下点对距离为 k ：
|
||||
- (0, 1)：(1 XOR 4) + (2 XOR 2) = 5 。
|
||||
- (2, 3)：(1 XOR 5) + (3 XOR 2) = 5 。
|
||||
</pre>
|
||||
|
||||
<p><strong class="example">示例 2：</strong></p>
|
||||
|
||||
<pre>
|
||||
<b>输入：</b>coordinates = [[1,3],[1,3],[1,3],[1,3],[1,3]], k = 0
|
||||
<b>输出：</b>10
|
||||
<b>解释：</b>任何两个点之间的距离都为 0 ，所以总共有 10 组点对。
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong>提示：</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>2 <= coordinates.length <= 50000</code></li>
|
||||
<li><code>0 <= x<sub>i</sub>, y<sub>i</sub> <= 10<sup>6</sup></code></li>
|
||||
<li><code>0 <= k <= 100</code></li>
|
||||
</ul>
|
||||
@ -0,0 +1,47 @@
|
||||
<p>给你一个下标从 <strong>0</strong> 开始的整数数组 <code>nums</code> 和一个整数 <code>k</code> 。</p>
|
||||
|
||||
<p>请你用整数形式返回 <code>nums</code> 中的特定元素之 <strong>和</strong> ，这些特定元素满足：其对应下标的二进制表示中恰存在 <code>k</code> 个置位。</p>
|
||||
|
||||
<p>整数的二进制表示中的 1 就是这个整数的 <strong>置位</strong> 。</p>
|
||||
|
||||
<p>例如，<code>21</code> 的二进制表示为 <code>10101</code> ，其中有 <code>3</code> 个置位。</p>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong class="example">示例 1：</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>输入：</strong>nums = [5,10,1,5,2], k = 1
|
||||
<strong>输出：</strong>13
|
||||
<strong>解释：</strong>下标的二进制表示是：
|
||||
0 = 000<sub>2</sub>
|
||||
1 = 001<sub>2</sub>
|
||||
2 = 010<sub>2</sub>
|
||||
3 = 011<sub>2</sub>
|
||||
4 = 100<sub>2
|
||||
</sub>下标 1、2 和 4 在其二进制表示中都存在 k = 1 个置位。
|
||||
因此，答案为 nums[1] + nums[2] + nums[4] = 13 。</pre>
|
||||
|
||||
<p><strong class="example">示例 2：</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>输入：</strong>nums = [4,3,2,1], k = 2
|
||||
<strong>输出：</strong>1
|
||||
<strong>解释：</strong>下标的二进制表示是：
|
||||
0 = 00<sub>2</sub>
|
||||
1 = 01<sub>2</sub>
|
||||
2 = 10<sub>2</sub>
|
||||
3 = 11<sub>2
|
||||
</sub>只有下标 3 的二进制表示中存在 k = 2 个置位。
|
||||
因此，答案为 nums[3] = 1 。
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong>提示：</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>1 <= nums.length <= 1000</code></li>
|
||||
<li><code>1 <= nums[i] <= 10<sup>5</sup></code></li>
|
||||
<li><code>0 <= k <= 10</code></li>
|
||||
</ul>
|
||||
@ -0,0 +1,45 @@
|
||||
<p>给你一个下标从 <strong>0</strong> 开始、长度为 <code>n</code> 的整数数组 <code>nums</code> ，其中 <code>n</code> 是班级中学生的总数。班主任希望能够在让所有学生保持开心的情况下选出一组学生：</p>
|
||||
|
||||
<p>如果能够满足下述两个条件之一，则认为第 <code>i</code> 位学生将会保持开心：</p>
|
||||
|
||||
<ul>
|
||||
<li>这位学生被选中，并且被选中的学生人数 <strong>严格大于</strong> <code>nums[i]</code> 。</li>
|
||||
<li>这位学生没有被选中，并且被选中的学生人数 <strong>严格小于</strong> <code>nums[i]</code> 。</li>
|
||||
</ul>
|
||||
|
||||
<p>返回能够满足让所有学生保持开心的分组方法的数目。</p>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong class="example">示例 1：</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>输入：</strong>nums = [1,1]
|
||||
<strong>输出：</strong>2
|
||||
<strong>解释：</strong>
|
||||
有两种可行的方法：
|
||||
班主任没有选中学生。
|
||||
班主任选中所有学生形成一组。
|
||||
如果班主任仅选中一个学生来完成分组，那么两个学生都无法保持开心。因此，仅存在两种可行的方法。
|
||||
</pre>
|
||||
|
||||
<p><strong class="example">示例 2：</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>输入：</strong>nums = [6,0,3,3,6,7,2,7]
|
||||
<strong>输出：</strong>3
|
||||
<strong>解释：</strong>
|
||||
存在三种可行的方法：
|
||||
班主任选中下标为 1 的学生形成一组。
|
||||
班主任选中下标为 1、2、3、6 的学生形成一组。
|
||||
班主任选中所有学生形成一组。
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong>提示：</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>1 <= nums.length <= 10<sup>5</sup></code></li>
|
||||
<li><code>0 <= nums[i] < nums.length</code></li>
|
||||
</ul>
|
||||
@ -0,0 +1,29 @@
|
||||
<p>You are given a <strong>0-indexed</strong> 2D integer array <code>nums</code> representing the coordinates of the cars parking on a number line. For any index <code>i</code>, <code>nums[i] = [start<sub>i</sub>, end<sub>i</sub>]</code> where <code>start<sub>i</sub></code> is the starting point of the <code>i<sup>th</sup></code> car and <code>end<sub>i</sub></code> is the ending point of the <code>i<sup>th</sup></code> car.</p>
|
||||
|
||||
<p>Return <em>the number of integer points on the line that are covered with <strong>any part</strong> of a car.</em></p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> nums = [[3,6],[1,5],[4,7]]
|
||||
<strong>Output:</strong> 7
|
||||
<strong>Explanation:</strong> All the points from 1 to 7 intersect at least one car, therefore the answer would be 7.
|
||||
</pre>
|
||||
|
||||
<p><strong class="example">Example 2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> nums = [[1,3],[5,8]]
|
||||
<strong>Output:</strong> 7
|
||||
<strong>Explanation:</strong> Points intersecting at least one car are 1, 2, 3, 5, 6, 7, 8. There are a total of 7 points, therefore the answer would be 7.
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Constraints:</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>1 <= nums.length <= 100</code></li>
|
||||
<li><code>nums[i].length == 2</code></li>
|
||||
<li><code><font face="monospace">1 <= start<sub>i</sub> <= end<sub>i</sub> <= 100</font></code></li>
|
||||
</ul>
|
||||
@ -0,0 +1,39 @@
|
||||
<p>You are given a <strong>0-indexed</strong> array <code>nums</code> of length <code>n</code> containing <strong>distinct</strong> positive integers. Return <em>the <strong>minimum</strong> number of <strong>right shifts</strong> required to sort </em><code>nums</code><em> and </em><code>-1</code><em> if this is not possible.</em></p>
|
||||
|
||||
<p>A <strong>right shift</strong> is defined as shifting the element at index <code>i</code> to index <code>(i + 1) % n</code>, for all indices.</p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> nums = [3,4,5,1,2]
|
||||
<strong>Output:</strong> 2
|
||||
<strong>Explanation:</strong>
|
||||
After the first right shift, nums = [2,3,4,5,1].
|
||||
After the second right shift, nums = [1,2,3,4,5].
|
||||
Now nums is sorted; therefore the answer is 2.
|
||||
</pre>
|
||||
|
||||
<p><strong class="example">Example 2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> nums = [1,3,5]
|
||||
<strong>Output:</strong> 0
|
||||
<strong>Explanation:</strong> nums is already sorted therefore, the answer is 0.</pre>
|
||||
|
||||
<p><strong class="example">Example 3:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> nums = [2,1,4]
|
||||
<strong>Output:</strong> -1
|
||||
<strong>Explanation:</strong> It's impossible to sort the array using right shifts.
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Constraints:</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>1 <= nums.length <= 100</code></li>
|
||||
<li><code>1 <= nums[i] <= 100</code></li>
|
||||
<li><code>nums</code> contains distinct integers.</li>
|
||||
</ul>
|
||||
@ -0,0 +1,59 @@
|
||||
<p>You are given a <strong>0-indexed</strong> <strong>sorted</strong> array of integers <code>nums</code>.</p>
|
||||
|
||||
<p>You can perform the following operation any number of times:</p>
|
||||
|
||||
<ul>
|
||||
<li>Choose <strong>two</strong> indices, <code>i</code> and <code>j</code>, where <code>i < j</code>, such that <code>nums[i] < nums[j]</code>.</li>
|
||||
<li>Then, remove the elements at indices <code>i</code> and <code>j</code> from <code>nums</code>. The remaining elements retain their original order, and the array is re-indexed.</li>
|
||||
</ul>
|
||||
|
||||
<p>Return <em>an integer that denotes the <strong>minimum</strong> length of </em><code>nums</code><em> after performing the operation any number of times (<strong>including zero</strong>).</em></p>
|
||||
|
||||
<p>Note that <code>nums</code> is sorted in <strong>non-decreasing</strong> order.</p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> nums = [1,3,4,9]
|
||||
<strong>Output:</strong> 0
|
||||
<strong>Explanation:</strong> Initially, nums = [1, 3, 4, 9].
|
||||
In the first operation, we can choose index 0 and 1 because nums[0] < nums[1] <=> 1 < 3.
|
||||
Remove indices 0 and 1, and nums becomes [4, 9].
|
||||
For the next operation, we can choose index 0 and 1 because nums[0] < nums[1] <=> 4 < 9.
|
||||
Remove indices 0 and 1, and nums becomes an empty array [].
|
||||
Hence, the minimum length achievable is 0.</pre>
|
||||
|
||||
<p><strong class="example">Example 2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> nums = [2,3,6,9]
|
||||
<strong>Output:</strong> 0
|
||||
<strong>Explanation:</strong> Initially, nums = [2, 3, 6, 9].
|
||||
In the first operation, we can choose index 0 and 2 because nums[0] < nums[2] <=> 2 < 6.
|
||||
Remove indices 0 and 2, and nums becomes [3, 9].
|
||||
For the next operation, we can choose index 0 and 1 because nums[0] < nums[1] <=> 3 < 9.
|
||||
Remove indices 0 and 1, and nums becomes an empty array [].
|
||||
Hence, the minimum length achievable is 0.
|
||||
</pre>
|
||||
|
||||
<p><strong class="example">Example 3:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> nums = [1,1,2]
|
||||
<strong>Output:</strong> 1
|
||||
<strong>Explanation:</strong> Initially, nums = [1, 1, 2].
|
||||
In an operation, we can choose index 0 and 2 because nums[0] < nums[2] <=> 1 < 2.
|
||||
Remove indices 0 and 2, and nums becomes [1].
|
||||
It is no longer possible to perform an operation on the array.
|
||||
Hence, the minimum achievable length is 1.
|
||||
</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>9</sup></code></li>
|
||||
<li><code>nums</code> is sorted in <strong>non-decreasing</strong> order.</li>
|
||||
</ul>
|
||||
@ -0,0 +1,32 @@
|
||||
<p>You are given four integers <code>sx</code>, <code>sy</code>, <code>fx</code>, <code>fy</code>, and a <strong>non-negative</strong> integer <code>t</code>.</p>
|
||||
|
||||
<p>In an infinite 2D grid, you start at the cell <code>(sx, sy)</code>. Each second, you <strong>must</strong> move to any of its adjacent cells.</p>
|
||||
|
||||
<p>Return <code>true</code> <em>if you can reach cell </em><code>(fx, fy)</code> <em>after<strong> exactly</strong></em> <code>t</code> <strong><em>seconds</em></strong>, <em>or</em> <code>false</code> <em>otherwise</em>.</p>
|
||||
|
||||
<p>A cell's <strong>adjacent cells</strong> are the 8 cells around it that share at least one corner with it. You can visit the same cell several times.</p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
<img alt="" src="https://assets.leetcode.com/uploads/2023/08/05/example2.svg" style="width: 443px; height: 243px;" />
|
||||
<pre>
|
||||
<strong>Input:</strong> sx = 2, sy = 4, fx = 7, fy = 7, t = 6
|
||||
<strong>Output:</strong> true
|
||||
<strong>Explanation:</strong> Starting at cell (2, 4), we can reach cell (7, 7) in exactly 6 seconds by going through the cells depicted in the picture above.
|
||||
</pre>
|
||||
|
||||
<p><strong class="example">Example 2:</strong></p>
|
||||
<img alt="" src="https://assets.leetcode.com/uploads/2023/08/05/example1.svg" style="width: 383px; height: 202px;" />
|
||||
<pre>
|
||||
<strong>Input:</strong> sx = 3, sy = 1, fx = 7, fy = 3, t = 3
|
||||
<strong>Output:</strong> false
|
||||
<strong>Explanation:</strong> Starting at cell (3, 1), it takes at least 4 seconds to reach cell (7, 3) by going through the cells depicted in the picture above. Hence, we cannot reach cell (7, 3) at the third second.
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Constraints:</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>1 <= sx, sy, fx, fy <= 10<sup>9</sup></code></li>
|
||||
<li><code>0 <= t <= 10<sup>9</sup></code></li>
|
||||
</ul>
|
||||
@ -0,0 +1,57 @@
|
||||
<p>There is a <strong>simple directed graph</strong> with <code>n</code> nodes labeled from <code>0</code> to <code>n - 1</code>. The graph would form a <strong>tree</strong> if its edges were bi-directional.</p>
|
||||
|
||||
<p>You are given an integer <code>n</code> and a <strong>2D</strong> integer array <code>edges</code>, where <code>edges[i] = [u<sub>i</sub>, v<sub>i</sub>]</code> represents a <strong>directed edge</strong> going from node <code>u<sub>i</sub></code> to node <code>v<sub>i</sub></code>.</p>
|
||||
|
||||
<p>An <strong>edge reversal</strong> changes the direction of an edge, i.e., a directed edge going from node <code>u<sub>i</sub></code> to node <code>v<sub>i</sub></code> becomes a directed edge going from node <code>v<sub>i</sub></code> to node <code>u<sub>i</sub></code>.</p>
|
||||
|
||||
<p>For every node <code>i</code> in the range <code>[0, n - 1]</code>, your task is to <strong>independently</strong> calculate the <strong>minimum</strong> number of <strong>edge reversals</strong> required so it is possible to reach any other node starting from node <code>i</code> through a <strong>sequence</strong> of <strong>directed edges</strong>.</p>
|
||||
|
||||
<p>Return <em>an integer array </em><code>answer</code><em>, where </em><code>answer[i]</code><em> is the</em><em> </em> <em><strong>minimum</strong> number of <strong>edge reversals</strong> required so it is possible to reach any other node starting from node </em><code>i</code><em> through a <strong>sequence</strong> of <strong>directed edges</strong>.</em></p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
|
||||
<p><img height="246" src="https://assets.leetcode.com/uploads/2023/08/26/image-20230826221104-3.png" width="312" /></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> n = 4, edges = [[2,0],[2,1],[1,3]]
|
||||
<strong>Output:</strong> [1,1,0,2]
|
||||
<strong>Explanation:</strong> The image above shows the graph formed by the edges.
|
||||
For node 0: after reversing the edge [2,0], it is possible to reach any other node starting from node 0.
|
||||
So, answer[0] = 1.
|
||||
For node 1: after reversing the edge [2,1], it is possible to reach any other node starting from node 1.
|
||||
So, answer[1] = 1.
|
||||
For node 2: it is already possible to reach any other node starting from node 2.
|
||||
So, answer[2] = 0.
|
||||
For node 3: after reversing the edges [1,3] and [2,1], it is possible to reach any other node starting from node 3.
|
||||
So, answer[3] = 2.
|
||||
</pre>
|
||||
|
||||
<p><strong class="example">Example 2:</strong></p>
|
||||
|
||||
<p><img height="217" src="https://assets.leetcode.com/uploads/2023/08/26/image-20230826225541-2.png" width="322" /></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> n = 3, edges = [[1,2],[2,0]]
|
||||
<strong>Output:</strong> [2,0,1]
|
||||
<strong>Explanation:</strong> The image above shows the graph formed by the edges.
|
||||
For node 0: after reversing the edges [2,0] and [1,2], it is possible to reach any other node starting from node 0.
|
||||
So, answer[0] = 2.
|
||||
For node 1: it is already possible to reach any other node starting from node 1.
|
||||
So, answer[1] = 0.
|
||||
For node 2: after reversing the edge [1, 2], it is possible to reach any other node starting from node 2.
|
||||
So, answer[2] = 1.
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Constraints:</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>2 <= n <= 10<sup>5</sup></code></li>
|
||||
<li><code>edges.length == n - 1</code></li>
|
||||
<li><code>edges[i].length == 2</code></li>
|
||||
<li><code>0 <= u<sub>i</sub> == edges[i][0] < n</code></li>
|
||||
<li><code>0 <= v<sub>i</sub> == edges[i][1] < n</code></li>
|
||||
<li><code>u<sub>i</sub> != v<sub>i</sub></code></li>
|
||||
<li>The input is generated such that if the edges were bi-directional, the graph would be a tree.</li>
|
||||
</ul>
|
||||
@ -0,0 +1,49 @@
|
||||
<p>You are given two strings <code>s</code> and <code>t</code> of equal length <code>n</code>. You can perform the following operation on the string <code>s</code>:</p>
|
||||
|
||||
<ul>
|
||||
<li>Remove a <strong>suffix</strong> of <code>s</code> of length <code>l</code> where <code>0 < l < n</code> and append it at the start of <code>s</code>.<br />
|
||||
For example, let <code>s = 'abcd'</code> then in one operation you can remove the suffix <code>'cd'</code> and append it in front of <code>s</code> making <code>s = 'cdab'</code>.</li>
|
||||
</ul>
|
||||
|
||||
<p>You are also given an integer <code>k</code>. Return <em>the number of ways in which </em><code>s</code> <em>can be transformed into </em><code>t</code><em> in <strong>exactly</strong> </em><code>k</code><em> operations.</em></p>
|
||||
|
||||
<p>Since the answer can be large, return it <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> s = "abcd", t = "cdab", k = 2
|
||||
<strong>Output:</strong> 2
|
||||
<strong>Explanation:</strong>
|
||||
First way:
|
||||
In first operation, choose suffix from index = 3, so resulting s = "dabc".
|
||||
In second operation, choose suffix from index = 3, so resulting s = "cdab".
|
||||
|
||||
Second way:
|
||||
In first operation, choose suffix from index = 1, so resulting s = "bcda".
|
||||
In second operation, choose suffix from index = 1, so resulting s = "cdab".
|
||||
</pre>
|
||||
|
||||
<p><strong class="example">Example 2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> s = "ababab", t = "ababab", k = 1
|
||||
<strong>Output:</strong> 2
|
||||
<strong>Explanation:</strong>
|
||||
First way:
|
||||
Choose suffix from index = 2, so resulting s = "ababab".
|
||||
|
||||
Second way:
|
||||
Choose suffix from index = 4, so resulting s = "ababab".
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Constraints:</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>2 <= s.length <= 5 * 10<sup>5</sup></code></li>
|
||||
<li><code>1 <= k <= 10<sup>15</sup></code></li>
|
||||
<li><code>s.length == t.length</code></li>
|
||||
<li><code>s</code> and <code>t</code> consist of only lowercase English alphabets.</li>
|
||||
</ul>
|
||||
@ -0,0 +1,43 @@
|
||||
<p>You are given a <strong>1</strong><strong>-indexed</strong> array <code>nums</code> of <code>n</code> integers.</p>
|
||||
|
||||
<p>A set of numbers is <strong>complete</strong> if the product of every pair of its elements is a perfect square.</p>
|
||||
|
||||
<p>For a subset of the indices set <code>{1, 2, ..., n}</code> represented as <code>{i<sub>1</sub>, i<sub>2</sub>, ..., i<sub>k</sub>}</code>, we define its <strong>element-sum</strong> as: <code>nums[i<sub>1</sub>] + nums[i<sub>2</sub>] + ... + nums[i<sub>k</sub>]</code>.</p>
|
||||
|
||||
<p>Return <em>the <strong>maximum element-sum</strong> of a <strong>complete</strong> subset of the indices set</em> <code>{1, 2, ..., n}</code>.</p>
|
||||
|
||||
<p>A perfect square is a number that can be expressed as the product of an integer by itself.</p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> nums = [8,7,3,5,7,2,4,9]
|
||||
<strong>Output:</strong> 16
|
||||
<strong>Explanation:</strong> Apart from the subsets consisting of a single index, there are two other complete subsets of indices: {1,4} and {2,8}.
|
||||
The sum of the elements corresponding to indices 1 and 4 is equal to nums[1] + nums[4] = 8 + 5 = 13.
|
||||
The sum of the elements corresponding to indices 2 and 8 is equal to nums[2] + nums[8] = 7 + 9 = 16.
|
||||
Hence, the maximum element-sum of a complete subset of indices is 16.
|
||||
</pre>
|
||||
|
||||
<p><strong class="example">Example 2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> nums = [5,10,3,10,1,13,7,9,4]
|
||||
<strong>Output:</strong> 19
|
||||
<strong>Explanation:</strong> Apart from the subsets consisting of a single index, there are four other complete subsets of indices: {1,4}, {1,9}, {2,8}, {4,9}, and {1,4,9}.
|
||||
The sum of the elements corresponding to indices 1 and 4 is equal to nums[1] + nums[4] = 5 + 10 = 15.
|
||||
The sum of the elements corresponding to indices 1 and 9 is equal to nums[1] + nums[9] = 5 + 4 = 9.
|
||||
The sum of the elements corresponding to indices 2 and 8 is equal to nums[2] + nums[8] = 10 + 9 = 19.
|
||||
The sum of the elements corresponding to indices 4 and 9 is equal to nums[4] + nums[9] = 10 + 4 = 14.
|
||||
The sum of the elements corresponding to indices 1, 4, and 9 is equal to nums[1] + nums[4] + nums[9] = 5 + 10 + 4 = 19.
|
||||
Hence, the maximum element-sum of a complete subset of indices is 19.
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Constraints:</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>1 <= n == nums.length <= 10<sup>4</sup></code></li>
|
||||
<li><code>1 <= nums[i] <= 10<sup>9</sup></code></li>
|
||||
</ul>
|
||||
@ -0,0 +1,42 @@
|
||||
<p>You are given a <strong>0-indexed</strong> 2D integer matrix <code>grid</code> of size <code>3 * 3</code>, representing the number of stones in each cell. The grid contains exactly <code>9</code> stones, and there can be <strong>multiple</strong> stones in a single cell.</p>
|
||||
|
||||
<p>In one move, you can move a single stone from its current cell to any other cell if the two cells share a side.</p>
|
||||
|
||||
<p>Return <em>the <strong>minimum number of moves</strong> required to place one stone in each cell</em>.</p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
<img alt="" src="https://assets.leetcode.com/uploads/2023/08/23/example1-3.svg" style="width: 401px; height: 281px;" />
|
||||
<pre>
|
||||
<strong>Input:</strong> grid = [[1,1,0],[1,1,1],[1,2,1]]
|
||||
<strong>Output:</strong> 3
|
||||
<strong>Explanation:</strong> One possible sequence of moves to place one stone in each cell is:
|
||||
1- Move one stone from cell (2,1) to cell (2,2).
|
||||
2- Move one stone from cell (2,2) to cell (1,2).
|
||||
3- Move one stone from cell (1,2) to cell (0,2).
|
||||
In total, it takes 3 moves to place one stone in each cell of the grid.
|
||||
It can be shown that 3 is the minimum number of moves required to place one stone in each cell.
|
||||
</pre>
|
||||
|
||||
<p><strong class="example">Example 2:</strong></p>
|
||||
<img alt="" src="https://assets.leetcode.com/uploads/2023/08/23/example2-2.svg" style="width: 401px; height: 281px;" />
|
||||
<pre>
|
||||
<strong>Input:</strong> grid = [[1,3,0],[1,0,0],[1,0,3]]
|
||||
<strong>Output:</strong> 4
|
||||
<strong>Explanation:</strong> One possible sequence of moves to place one stone in each cell is:
|
||||
1- Move one stone from cell (0,1) to cell (0,2).
|
||||
2- Move one stone from cell (0,1) to cell (1,1).
|
||||
3- Move one stone from cell (2,2) to cell (1,2).
|
||||
4- Move one stone from cell (2,2) to cell (2,1).
|
||||
In total, it takes 4 moves to place one stone in each cell of the grid.
|
||||
It can be shown that 4 is the minimum number of moves required to place one stone in each cell.
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Constraints:</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>grid.length == grid[i].length == 3</code></li>
|
||||
<li><code>0 <= grid[i][j] <= 9</code></li>
|
||||
<li>Sum of <code>grid</code> is equal to <code>9</code>.</li>
|
||||
</ul>
|
||||
@ -0,0 +1,66 @@
|
||||
<p>You are the owner of a company that creates alloys using various types of metals. There are <code>n</code> different types of metals available, and you have access to <code>k</code> machines that can be used to create alloys. Each machine requires a specific amount of each metal type to create an alloy.</p>
|
||||
|
||||
<p>For the <code>i<sup>th</sup></code> machine to create an alloy, it needs <code>composition[i][j]</code> units of metal of type <code>j</code>. Initially, you have <code>stock[i]</code> units of metal type <code>i</code>, and purchasing one unit of metal type <code>i</code> costs <code>cost[i]</code> coins.</p>
|
||||
|
||||
<p>Given integers <code>n</code>, <code>k</code>, <code>budget</code>, a <strong>1-indexed</strong> 2D array <code>composition</code>, and <strong>1-indexed</strong> arrays <code>stock</code> and <code>cost</code>, your goal is to <strong>maximize</strong> the number of alloys the company can create while staying within the budget of <code>budget</code> coins.</p>
|
||||
|
||||
<p><strong>All alloys must be created with the same machine.</strong></p>
|
||||
|
||||
<p>Return <em>the maximum number of alloys that the company can create</em>.</p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> n = 3, k = 2, budget = 15, composition = [[1,1,1],[1,1,10]], stock = [0,0,0], cost = [1,2,3]
|
||||
<strong>Output:</strong> 2
|
||||
<strong>Explanation:</strong> It is optimal to use the 1<sup>st</sup> machine to create alloys.
|
||||
To create 2 alloys we need to buy the:
|
||||
- 2 units of metal of the 1<sup>st</sup> type.
|
||||
- 2 units of metal of the 2<sup>nd</sup> type.
|
||||
- 2 units of metal of the 3<sup>rd</sup> type.
|
||||
In total, we need 2 * 1 + 2 * 2 + 2 * 3 = 12 coins, which is smaller than or equal to budget = 15.
|
||||
Notice that we have 0 units of metal of each type and we have to buy all the required units of metal.
|
||||
It can be proven that we can create at most 2 alloys.
|
||||
</pre>
|
||||
|
||||
<p><strong class="example">Example 2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> n = 3, k = 2, budget = 15, composition = [[1,1,1],[1,1,10]], stock = [0,0,100], cost = [1,2,3]
|
||||
<strong>Output:</strong> 5
|
||||
<strong>Explanation:</strong> It is optimal to use the 2<sup>nd</sup> machine to create alloys.
|
||||
To create 5 alloys we need to buy:
|
||||
- 5 units of metal of the 1<sup>st</sup> type.
|
||||
- 5 units of metal of the 2<sup>nd</sup> type.
|
||||
- 0 units of metal of the 3<sup>rd</sup> type.
|
||||
In total, we need 5 * 1 + 5 * 2 + 0 * 3 = 15 coins, which is smaller than or equal to budget = 15.
|
||||
It can be proven that we can create at most 5 alloys.
|
||||
</pre>
|
||||
|
||||
<p><strong class="example">Example 3:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> n = 2, k = 3, budget = 10, composition = [[2,1],[1,2],[1,1]], stock = [1,1], cost = [5,5]
|
||||
<strong>Output:</strong> 2
|
||||
<strong>Explanation:</strong> It is optimal to use the 3<sup>rd</sup> machine to create alloys.
|
||||
To create 2 alloys we need to buy the:
|
||||
- 1 unit of metal of the 1<sup>st</sup> type.
|
||||
- 1 unit of metal of the 2<sup>nd</sup> type.
|
||||
In total, we need 1 * 5 + 1 * 5 = 10 coins, which is smaller than or equal to budget = 10.
|
||||
It can be proven that we can create at most 2 alloys.
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Constraints:</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>1 <= n, k <= 100</code></li>
|
||||
<li><code>0 <= budget <= 10<sup>8</sup></code></li>
|
||||
<li><code>composition.length == k</code></li>
|
||||
<li><code>composition[i].length == n</code></li>
|
||||
<li><code>1 <= composition[i][j] <= 100</code></li>
|
||||
<li><code>stock.length == cost.length == n</code></li>
|
||||
<li><code>0 <= stock[i] <= 10<sup>8</sup></code></li>
|
||||
<li><code>1 <= cost[i] <= 100</code></li>
|
||||
</ul>
|
||||
@ -0,0 +1,33 @@
|
||||
<p>You are given a <strong>2D</strong> integer array <code>coordinates</code> and an integer <code>k</code>, where <code>coordinates[i] = [x<sub>i</sub>, y<sub>i</sub>]</code> are the coordinates of the <code>i<sup>th</sup></code> point in a 2D plane.</p>
|
||||
|
||||
<p>We define the <strong>distance</strong> between two points <code>(x<sub>1</sub>, y<sub>1</sub>)</code> and <code>(x<sub>2</sub>, y<sub>2</sub>)</code> as <code>(x1 XOR x2) + (y1 XOR y2)</code> where <code>XOR</code> is the bitwise <code>XOR</code> operation.</p>
|
||||
|
||||
<p>Return <em>the number of pairs </em><code>(i, j)</code><em> such that </em><code>i < j</code><em> and the distance between points </em><code>i</code><em> and </em><code>j</code><em> is equal to </em><code>k</code>.</p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> coordinates = [[1,2],[4,2],[1,3],[5,2]], k = 5
|
||||
<strong>Output:</strong> 2
|
||||
<strong>Explanation:</strong> We can choose the following pairs:
|
||||
- (0,1): Because we have (1 XOR 4) + (2 XOR 2) = 5.
|
||||
- (2,3): Because we have (1 XOR 5) + (3 XOR 2) = 5.
|
||||
</pre>
|
||||
|
||||
<p><strong class="example">Example 2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> coordinates = [[1,3],[1,3],[1,3],[1,3],[1,3]], k = 0
|
||||
<strong>Output:</strong> 10
|
||||
<strong>Explanation:</strong> Any two chosen pairs will have a distance of 0. There are 10 ways to choose two pairs.
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Constraints:</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>2 <= coordinates.length <= 50000</code></li>
|
||||
<li><code>0 <= x<sub>i</sub>, y<sub>i</sub> <= 10<sup>6</sup></code></li>
|
||||
<li><code>0 <= k <= 100</code></li>
|
||||
</ul>
|
||||
@ -0,0 +1,47 @@
|
||||
<p>You are given a <strong>0-indexed</strong> integer array <code>nums</code> and an integer <code>k</code>.</p>
|
||||
|
||||
<p>Return <em>an integer that denotes the <strong>sum</strong> of elements in </em><code>nums</code><em> whose corresponding <strong>indices</strong> have <strong>exactly</strong> </em><code>k</code><em> set bits in their binary representation.</em></p>
|
||||
|
||||
<p>The <strong>set bits</strong> in an integer are the <code>1</code>'s present when it is written in binary.</p>
|
||||
|
||||
<ul>
|
||||
<li>For example, the binary representation of <code>21</code> is <code>10101</code>, which has <code>3</code> set bits.</li>
|
||||
</ul>
|
||||
|
||||
<p> </p>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> nums = [5,10,1,5,2], k = 1
|
||||
<strong>Output:</strong> 13
|
||||
<strong>Explanation:</strong> The binary representation of the indices are:
|
||||
0 = 000<sub>2</sub>
|
||||
1 = 001<sub>2</sub>
|
||||
2 = 010<sub>2</sub>
|
||||
3 = 011<sub>2</sub>
|
||||
4 = 100<sub>2
|
||||
</sub>Indices 1, 2, and 4 have k = 1 set bits in their binary representation.
|
||||
Hence, the answer is nums[1] + nums[2] + nums[4] = 13.</pre>
|
||||
|
||||
<p><strong class="example">Example 2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> nums = [4,3,2,1], k = 2
|
||||
<strong>Output:</strong> 1
|
||||
<strong>Explanation:</strong> The binary representation of the indices are:
|
||||
0 = 00<sub>2</sub>
|
||||
1 = 01<sub>2</sub>
|
||||
2 = 10<sub>2</sub>
|
||||
3 = 11<sub>2
|
||||
</sub>Only index 3 has k = 2 set bits in its binary representation.
|
||||
Hence, the answer is nums[3] = 1.
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Constraints:</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>1 <= nums.length <= 1000</code></li>
|
||||
<li><code>1 <= nums[i] <= 10<sup>5</sup></code></li>
|
||||
<li><code>0 <= k <= 10</code></li>
|
||||
</ul>
|
||||
@ -0,0 +1,43 @@
|
||||
<p>You are given a <strong>0-indexed</strong> integer array <code>nums</code> of length <code>n</code> where <code>n</code> is the total number of students in the class. The class teacher tries to select a group of students so that all the students remain happy.</p>
|
||||
|
||||
<p>The <code>i<sup>th</sup></code> student will become happy if one of these two conditions is met:</p>
|
||||
|
||||
<ul>
|
||||
<li>The student is selected and the total number of selected students is<strong> strictly greater than</strong> <code>nums[i]</code>.</li>
|
||||
<li>The student is not selected and the total number of selected students is <strong>strictly</strong> <strong>less than</strong> <code>nums[i]</code>.</li>
|
||||
</ul>
|
||||
|
||||
<p>Return <em>the number of ways to select a group of students so that everyone remains happy.</em></p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> nums = [1,1]
|
||||
<strong>Output:</strong> 2
|
||||
<strong>Explanation:</strong>
|
||||
The two possible ways are:
|
||||
The class teacher selects no student.
|
||||
The class teacher selects both students to form the group.
|
||||
If the class teacher selects just one student to form a group then the both students will not be happy. Therefore, there are only two possible ways.
|
||||
</pre>
|
||||
|
||||
<p><strong class="example">Example 2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> nums = [6,0,3,3,6,7,2,7]
|
||||
<strong>Output:</strong> 3
|
||||
<strong>Explanation:</strong>
|
||||
The three possible ways are:
|
||||
The class teacher selects the student with index = 1 to form the group.
|
||||
The class teacher selects the students with index = 1, 2, 3, 6 to form the group.
|
||||
The class teacher selects all the students to form the group.
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Constraints:</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>1 <= nums.length <= 10<sup>5</sup></code></li>
|
||||
<li><code>0 <= nums[i] < nums.length</code></li>
|
||||
</ul>
|
||||
File diff suppressed because it is too large
Load Diff
@ -0,0 +1,63 @@
|
||||
{
|
||||
"data": {
|
||||
"question": {
|
||||
"questionId": "3155",
|
||||
"questionFrontendId": "2853",
|
||||
"boundTopicId": null,
|
||||
"title": "Highest Salaries Difference",
|
||||
"titleSlug": "highest-salaries-difference",
|
||||
"content": null,
|
||||
"translatedTitle": null,
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": true,
|
||||
"difficulty": "Easy",
|
||||
"likes": 2,
|
||||
"dislikes": 1,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[]",
|
||||
"exampleTestcases": "{\"headers\": {\"Salaries\": [\"emp_name\", \"department\", \"salary\"]},\"rows\": {\"Salaries\": [[\"Kathy\",\"Engineering\",50000],[\"Roy\",\"Marketing\",30000],[\"Charles\",\"Engineering\",45000],[\"Jack\",\"Engineering\",85000],[\"Benjamin\",\"Marketing\",34000],[\"Anthony\",\"Marketing\",42000],[\"Edward\",\"Engineering\",102000],[\"Terry\",\"Engineering\",44000],[\"Evelyn\",\"Marketing\",53000],[\"Arthur\",\"Engineering\",32000]]}}",
|
||||
"categoryTitle": "Database",
|
||||
"contributors": [],
|
||||
"topicTags": [
|
||||
{
|
||||
"name": "Database",
|
||||
"slug": "database",
|
||||
"translatedName": null,
|
||||
"__typename": "TopicTagNode"
|
||||
}
|
||||
],
|
||||
"companyTagStats": null,
|
||||
"codeSnippets": null,
|
||||
"stats": "{\"totalAccepted\": \"176\", \"totalSubmission\": \"208\", \"totalAcceptedRaw\": 176, \"totalSubmissionRaw\": 208, \"acRate\": \"84.6%\"}",
|
||||
"hints": [],
|
||||
"solution": null,
|
||||
"status": null,
|
||||
"sampleTestCase": "{\"headers\": {\"Salaries\": [\"emp_name\", \"department\", \"salary\"]},\"rows\": {\"Salaries\": [[\"Kathy\",\"Engineering\",50000],[\"Roy\",\"Marketing\",30000],[\"Charles\",\"Engineering\",45000],[\"Jack\",\"Engineering\",85000],[\"Benjamin\",\"Marketing\",34000],[\"Anthony\",\"Marketing\",42000],[\"Edward\",\"Engineering\",102000],[\"Terry\",\"Engineering\",44000],[\"Evelyn\",\"Marketing\",53000],[\"Arthur\",\"Engineering\",32000]]}}",
|
||||
"metaData": "{\"mysql\": [\"Create table if not exists Salaries(emp_name varchar(30), department varchar(30),salary int)\"], \"mssql\": [\"Create table Salaries(emp_name varchar(30), department varchar(30),salary int)\"], \"oraclesql\": [\"Create table Salaries(emp_name varchar(30), department varchar(30),salary int)\"], \"database\": true, \"languages\": [\"mysql\", \"mssql\", \"oraclesql\"], \"database_schema\": {\"Salaries\": {\"emp_name\": \"VARCHAR(30)\", \"department\": \"VARCHAR(30)\", \"salary\": \"INT\"}}}",
|
||||
"judgerAvailable": true,
|
||||
"judgeType": "large",
|
||||
"mysqlSchemas": [
|
||||
"Create table if not exists Salaries(emp_name varchar(30), department varchar(30),salary int)",
|
||||
"Truncate table Salaries",
|
||||
"insert into Salaries (emp_name, department, salary) values ('Kathy', 'Engineering', '50000')",
|
||||
"insert into Salaries (emp_name, department, salary) values ('Roy', 'Marketing', '30000')",
|
||||
"insert into Salaries (emp_name, department, salary) values ('Charles', 'Engineering', '45000')",
|
||||
"insert into Salaries (emp_name, department, salary) values ('Jack', 'Engineering', '85000')",
|
||||
"insert into Salaries (emp_name, department, salary) values ('Benjamin', 'Marketing', '34000')",
|
||||
"insert into Salaries (emp_name, department, salary) values ('Anthony', 'Marketing', '42000')",
|
||||
"insert into Salaries (emp_name, department, salary) values ('Edward', 'Engineering', '102000')",
|
||||
"insert into Salaries (emp_name, department, salary) values ('Terry', 'Engineering', '44000')",
|
||||
"insert into Salaries (emp_name, department, salary) values ('Evelyn', 'Marketing', '53000')",
|
||||
"insert into Salaries (emp_name, department, salary) values ('Arthur', 'Engineering', '32000')"
|
||||
],
|
||||
"enableRunCode": true,
|
||||
"enableTestMode": false,
|
||||
"enableDebugger": false,
|
||||
"envInfo": "{\"mysql\": [\"MySQL\", \"<p><code>MySQL 8.0</code>.</p>\"], \"mssql\": [\"MS SQL Server\", \"<p><code>mssql server 2019</code>.</p>\"], \"oraclesql\": [\"Oracle\", \"<p><code>Oracle Sql 11.2</code>.</p>\"]}",
|
||||
"libraryUrl": null,
|
||||
"adminUrl": null,
|
||||
"challengeQuestion": null,
|
||||
"__typename": "QuestionNode"
|
||||
}
|
||||
}
|
||||
}
|
||||
70
leetcode/originData/[no content]rolling-average-steps.json
Normal file
70
leetcode/originData/[no content]rolling-average-steps.json
Normal file
@ -0,0 +1,70 @@
|
||||
{
|
||||
"data": {
|
||||
"question": {
|
||||
"questionId": "3156",
|
||||
"questionFrontendId": "2854",
|
||||
"boundTopicId": null,
|
||||
"title": "Rolling Average Steps",
|
||||
"titleSlug": "rolling-average-steps",
|
||||
"content": null,
|
||||
"translatedTitle": null,
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": true,
|
||||
"difficulty": "Medium",
|
||||
"likes": 4,
|
||||
"dislikes": 1,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[]",
|
||||
"exampleTestcases": "{\"headers\": {\"Steps\": [\"user_id\", \"steps_count\", \"steps_date\"]}, \"rows\": {\"Steps\": [[1,687,\"2021-09-02\"],[1,395,\"2021-09-04\"],[1,499,\"2021-09-05\"],[1,712,\"2021-09-06\"],[1,576,\"2021-09-07\"],[2,153,\"2021-09-06\"],[2,171,\"2021-09-07\"],[2,530,\"2021-09-08\"],[3,945,\"2021-09-04\"],[3,120,\"2021-09-07\"],[3,557,\"2021-09-08\"],[3,840,\"2021-09-09\"],[3,627,\"2021-09-10\"],[5,382,\"2021-09-05\"],[6,480,\"2021-09-01\"],[6,191,\"2021-09-02\"],[6,303,\"2021-09-05\"]]}}",
|
||||
"categoryTitle": "Database",
|
||||
"contributors": [],
|
||||
"topicTags": [
|
||||
{
|
||||
"name": "Database",
|
||||
"slug": "database",
|
||||
"translatedName": null,
|
||||
"__typename": "TopicTagNode"
|
||||
}
|
||||
],
|
||||
"companyTagStats": null,
|
||||
"codeSnippets": null,
|
||||
"stats": "{\"totalAccepted\": \"121\", \"totalSubmission\": \"208\", \"totalAcceptedRaw\": 121, \"totalSubmissionRaw\": 208, \"acRate\": \"58.2%\"}",
|
||||
"hints": [],
|
||||
"solution": null,
|
||||
"status": null,
|
||||
"sampleTestCase": "{\"headers\": {\"Steps\": [\"user_id\", \"steps_count\", \"steps_date\"]}, \"rows\": {\"Steps\": [[1,687,\"2021-09-02\"],[1,395,\"2021-09-04\"],[1,499,\"2021-09-05\"],[1,712,\"2021-09-06\"],[1,576,\"2021-09-07\"],[2,153,\"2021-09-06\"],[2,171,\"2021-09-07\"],[2,530,\"2021-09-08\"],[3,945,\"2021-09-04\"],[3,120,\"2021-09-07\"],[3,557,\"2021-09-08\"],[3,840,\"2021-09-09\"],[3,627,\"2021-09-10\"],[5,382,\"2021-09-05\"],[6,480,\"2021-09-01\"],[6,191,\"2021-09-02\"],[6,303,\"2021-09-05\"]]}}",
|
||||
"metaData": "{\"mysql\": [\"Create table if not exists Steps(user_id int, steps_count int, steps_date date)\"], \"mssql\": [\"Create table Steps(user_id int, steps_count int, steps_date date)\"], \"oraclesql\": [\"Create table Steps(user_id int, steps_count int, steps_date date)\", \"ALTER SESSION SET nls_date_format='YYYY-MM-DD'\"], \"database\": true, \"name\": \"rolling_average\", \"pythondata\": [\"Steps = pd.DataFrame([], columns=['user_id', 'steps_count', 'steps_date']).astype({'user_id':'Int64', 'steps_count':'Int64', 'steps_date':'datetime64[ns]'})\"], \"database_schema\": {\"Steps\": {\"user_id\": \"INT\", \"steps_count\": \"INT\", \"steps_date\": \"DATE\"}}}",
|
||||
"judgerAvailable": true,
|
||||
"judgeType": "large",
|
||||
"mysqlSchemas": [
|
||||
"Create table if not exists Steps(user_id int, steps_count int, steps_date date)",
|
||||
"Truncate table Steps",
|
||||
"insert into Steps (user_id, steps_count, steps_date) values ('1', '687', '2021-09-02')",
|
||||
"insert into Steps (user_id, steps_count, steps_date) values ('1', '395', '2021-09-04')",
|
||||
"insert into Steps (user_id, steps_count, steps_date) values ('1', '499', '2021-09-05')",
|
||||
"insert into Steps (user_id, steps_count, steps_date) values ('1', '712', '2021-09-06')",
|
||||
"insert into Steps (user_id, steps_count, steps_date) values ('1', '576', '2021-09-07')",
|
||||
"insert into Steps (user_id, steps_count, steps_date) values ('2', '153', '2021-09-06')",
|
||||
"insert into Steps (user_id, steps_count, steps_date) values ('2', '171', '2021-09-07')",
|
||||
"insert into Steps (user_id, steps_count, steps_date) values ('2', '530', '2021-09-08')",
|
||||
"insert into Steps (user_id, steps_count, steps_date) values ('3', '945', '2021-09-04')",
|
||||
"insert into Steps (user_id, steps_count, steps_date) values ('3', '120', '2021-09-07')",
|
||||
"insert into Steps (user_id, steps_count, steps_date) values ('3', '557', '2021-09-08')",
|
||||
"insert into Steps (user_id, steps_count, steps_date) values ('3', '840', '2021-09-09')",
|
||||
"insert into Steps (user_id, steps_count, steps_date) values ('3', '627', '2021-09-10')",
|
||||
"insert into Steps (user_id, steps_count, steps_date) values ('5', '382', '2021-09-05')",
|
||||
"insert into Steps (user_id, steps_count, steps_date) values ('6', '480', '2021-09-01')",
|
||||
"insert into Steps (user_id, steps_count, steps_date) values ('6', '191', '2021-09-02')",
|
||||
"insert into Steps (user_id, steps_count, steps_date) values ('6', '303', '2021-09-05')"
|
||||
],
|
||||
"enableRunCode": true,
|
||||
"enableTestMode": false,
|
||||
"enableDebugger": false,
|
||||
"envInfo": "{\"mysql\": [\"MySQL\", \"<p><code>MySQL 8.0</code>.</p>\"], \"mssql\": [\"MS SQL Server\", \"<p><code>mssql server 2019</code>.</p>\"], \"oraclesql\": [\"Oracle\", \"<p><code>Oracle Sql 11.2</code>.</p>\"], \"pythondata\": [\"Pandas\", \"<p>Python 3.10 with Pandas 2.0.2 and NumPy 1.25.0</p>\"]}",
|
||||
"libraryUrl": null,
|
||||
"adminUrl": null,
|
||||
"challengeQuestion": null,
|
||||
"__typename": "QuestionNode"
|
||||
}
|
||||
}
|
||||
}
|
||||
File diff suppressed because one or more lines are too long
181
leetcode/originData/count-pairs-of-points-with-distance-k.json
Normal file
181
leetcode/originData/count-pairs-of-points-with-distance-k.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
181
leetcode/originData/happy-students.json
Normal file
181
leetcode/originData/happy-students.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
173
leetcode/originData/maximum-number-of-alloys.json
Normal file
173
leetcode/originData/maximum-number-of-alloys.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
File diff suppressed because one or more lines are too long
File diff suppressed because one or more lines are too long
168
leetcode/originData/minimum-right-shifts-to-sort-the-array.json
Normal file
168
leetcode/originData/minimum-right-shifts-to-sort-the-array.json
Normal file
File diff suppressed because one or more lines are too long
179
leetcode/originData/points-that-intersect-with-cars.json
Normal file
179
leetcode/originData/points-that-intersect-with-cars.json
Normal file
File diff suppressed because one or more lines are too long
187
leetcode/originData/string-transformation.json
Normal file
187
leetcode/originData/string-transformation.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
33
leetcode/problem/count-pairs-of-points-with-distance-k.html
Normal file
33
leetcode/problem/count-pairs-of-points-with-distance-k.html
Normal file
@ -0,0 +1,33 @@
|
||||
<p>You are given a <strong>2D</strong> integer array <code>coordinates</code> and an integer <code>k</code>, where <code>coordinates[i] = [x<sub>i</sub>, y<sub>i</sub>]</code> are the coordinates of the <code>i<sup>th</sup></code> point in a 2D plane.</p>
|
||||
|
||||
<p>We define the <strong>distance</strong> between two points <code>(x<sub>1</sub>, y<sub>1</sub>)</code> and <code>(x<sub>2</sub>, y<sub>2</sub>)</code> as <code>(x1 XOR x2) + (y1 XOR y2)</code> where <code>XOR</code> is the bitwise <code>XOR</code> operation.</p>
|
||||
|
||||
<p>Return <em>the number of pairs </em><code>(i, j)</code><em> such that </em><code>i < j</code><em> and the distance between points </em><code>i</code><em> and </em><code>j</code><em> is equal to </em><code>k</code>.</p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> coordinates = [[1,2],[4,2],[1,3],[5,2]], k = 5
|
||||
<strong>Output:</strong> 2
|
||||
<strong>Explanation:</strong> We can choose the following pairs:
|
||||
- (0,1): Because we have (1 XOR 4) + (2 XOR 2) = 5.
|
||||
- (2,3): Because we have (1 XOR 5) + (3 XOR 2) = 5.
|
||||
</pre>
|
||||
|
||||
<p><strong class="example">Example 2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> coordinates = [[1,3],[1,3],[1,3],[1,3],[1,3]], k = 0
|
||||
<strong>Output:</strong> 10
|
||||
<strong>Explanation:</strong> Any two chosen pairs will have a distance of 0. There are 10 ways to choose two pairs.
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Constraints:</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>2 <= coordinates.length <= 50000</code></li>
|
||||
<li><code>0 <= x<sub>i</sub>, y<sub>i</sub> <= 10<sup>6</sup></code></li>
|
||||
<li><code>0 <= k <= 100</code></li>
|
||||
</ul>
|
||||
@ -0,0 +1,32 @@
|
||||
<p>You are given four integers <code>sx</code>, <code>sy</code>, <code>fx</code>, <code>fy</code>, and a <strong>non-negative</strong> integer <code>t</code>.</p>
|
||||
|
||||
<p>In an infinite 2D grid, you start at the cell <code>(sx, sy)</code>. Each second, you <strong>must</strong> move to any of its adjacent cells.</p>
|
||||
|
||||
<p>Return <code>true</code> <em>if you can reach cell </em><code>(fx, fy)</code> <em>after<strong> exactly</strong></em> <code>t</code> <strong><em>seconds</em></strong>, <em>or</em> <code>false</code> <em>otherwise</em>.</p>
|
||||
|
||||
<p>A cell's <strong>adjacent cells</strong> are the 8 cells around it that share at least one corner with it. You can visit the same cell several times.</p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
<img alt="" src="https://assets.leetcode.com/uploads/2023/08/05/example2.svg" style="width: 443px; height: 243px;" />
|
||||
<pre>
|
||||
<strong>Input:</strong> sx = 2, sy = 4, fx = 7, fy = 7, t = 6
|
||||
<strong>Output:</strong> true
|
||||
<strong>Explanation:</strong> Starting at cell (2, 4), we can reach cell (7, 7) in exactly 6 seconds by going through the cells depicted in the picture above.
|
||||
</pre>
|
||||
|
||||
<p><strong class="example">Example 2:</strong></p>
|
||||
<img alt="" src="https://assets.leetcode.com/uploads/2023/08/05/example1.svg" style="width: 383px; height: 202px;" />
|
||||
<pre>
|
||||
<strong>Input:</strong> sx = 3, sy = 1, fx = 7, fy = 3, t = 3
|
||||
<strong>Output:</strong> false
|
||||
<strong>Explanation:</strong> Starting at cell (3, 1), it takes at least 4 seconds to reach cell (7, 3) by going through the cells depicted in the picture above. Hence, we cannot reach cell (7, 3) at the third second.
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Constraints:</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>1 <= sx, sy, fx, fy <= 10<sup>9</sup></code></li>
|
||||
<li><code>0 <= t <= 10<sup>9</sup></code></li>
|
||||
</ul>
|
||||
43
leetcode/problem/happy-students.html
Normal file
43
leetcode/problem/happy-students.html
Normal file
@ -0,0 +1,43 @@
|
||||
<p>You are given a <strong>0-indexed</strong> integer array <code>nums</code> of length <code>n</code> where <code>n</code> is the total number of students in the class. The class teacher tries to select a group of students so that all the students remain happy.</p>
|
||||
|
||||
<p>The <code>i<sup>th</sup></code> student will become happy if one of these two conditions is met:</p>
|
||||
|
||||
<ul>
|
||||
<li>The student is selected and the total number of selected students is<strong> strictly greater than</strong> <code>nums[i]</code>.</li>
|
||||
<li>The student is not selected and the total number of selected students is <strong>strictly</strong> <strong>less than</strong> <code>nums[i]</code>.</li>
|
||||
</ul>
|
||||
|
||||
<p>Return <em>the number of ways to select a group of students so that everyone remains happy.</em></p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> nums = [1,1]
|
||||
<strong>Output:</strong> 2
|
||||
<strong>Explanation:</strong>
|
||||
The two possible ways are:
|
||||
The class teacher selects no student.
|
||||
The class teacher selects both students to form the group.
|
||||
If the class teacher selects just one student to form a group then the both students will not be happy. Therefore, there are only two possible ways.
|
||||
</pre>
|
||||
|
||||
<p><strong class="example">Example 2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> nums = [6,0,3,3,6,7,2,7]
|
||||
<strong>Output:</strong> 3
|
||||
<strong>Explanation:</strong>
|
||||
The three possible ways are:
|
||||
The class teacher selects the student with index = 1 to form the group.
|
||||
The class teacher selects the students with index = 1, 2, 3, 6 to form the group.
|
||||
The class teacher selects all the students to form the group.
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Constraints:</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>1 <= nums.length <= 10<sup>5</sup></code></li>
|
||||
<li><code>0 <= nums[i] < nums.length</code></li>
|
||||
</ul>
|
||||
@ -0,0 +1,43 @@
|
||||
<p>You are given a <strong>1</strong><strong>-indexed</strong> array <code>nums</code> of <code>n</code> integers.</p>
|
||||
|
||||
<p>A set of numbers is <strong>complete</strong> if the product of every pair of its elements is a perfect square.</p>
|
||||
|
||||
<p>For a subset of the indices set <code>{1, 2, ..., n}</code> represented as <code>{i<sub>1</sub>, i<sub>2</sub>, ..., i<sub>k</sub>}</code>, we define its <strong>element-sum</strong> as: <code>nums[i<sub>1</sub>] + nums[i<sub>2</sub>] + ... + nums[i<sub>k</sub>]</code>.</p>
|
||||
|
||||
<p>Return <em>the <strong>maximum element-sum</strong> of a <strong>complete</strong> subset of the indices set</em> <code>{1, 2, ..., n}</code>.</p>
|
||||
|
||||
<p>A perfect square is a number that can be expressed as the product of an integer by itself.</p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> nums = [8,7,3,5,7,2,4,9]
|
||||
<strong>Output:</strong> 16
|
||||
<strong>Explanation:</strong> Apart from the subsets consisting of a single index, there are two other complete subsets of indices: {1,4} and {2,8}.
|
||||
The sum of the elements corresponding to indices 1 and 4 is equal to nums[1] + nums[4] = 8 + 5 = 13.
|
||||
The sum of the elements corresponding to indices 2 and 8 is equal to nums[2] + nums[8] = 7 + 9 = 16.
|
||||
Hence, the maximum element-sum of a complete subset of indices is 16.
|
||||
</pre>
|
||||
|
||||
<p><strong class="example">Example 2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> nums = [5,10,3,10,1,13,7,9,4]
|
||||
<strong>Output:</strong> 19
|
||||
<strong>Explanation:</strong> Apart from the subsets consisting of a single index, there are four other complete subsets of indices: {1,4}, {1,9}, {2,8}, {4,9}, and {1,4,9}.
|
||||
The sum of the elements corresponding to indices 1 and 4 is equal to nums[1] + nums[4] = 5 + 10 = 15.
|
||||
The sum of the elements corresponding to indices 1 and 9 is equal to nums[1] + nums[9] = 5 + 4 = 9.
|
||||
The sum of the elements corresponding to indices 2 and 8 is equal to nums[2] + nums[8] = 10 + 9 = 19.
|
||||
The sum of the elements corresponding to indices 4 and 9 is equal to nums[4] + nums[9] = 10 + 4 = 14.
|
||||
The sum of the elements corresponding to indices 1, 4, and 9 is equal to nums[1] + nums[4] + nums[9] = 5 + 10 + 4 = 19.
|
||||
Hence, the maximum element-sum of a complete subset of indices is 19.
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Constraints:</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>1 <= n == nums.length <= 10<sup>4</sup></code></li>
|
||||
<li><code>1 <= nums[i] <= 10<sup>9</sup></code></li>
|
||||
</ul>
|
||||
66
leetcode/problem/maximum-number-of-alloys.html
Normal file
66
leetcode/problem/maximum-number-of-alloys.html
Normal file
@ -0,0 +1,66 @@
|
||||
<p>You are the owner of a company that creates alloys using various types of metals. There are <code>n</code> different types of metals available, and you have access to <code>k</code> machines that can be used to create alloys. Each machine requires a specific amount of each metal type to create an alloy.</p>
|
||||
|
||||
<p>For the <code>i<sup>th</sup></code> machine to create an alloy, it needs <code>composition[i][j]</code> units of metal of type <code>j</code>. Initially, you have <code>stock[i]</code> units of metal type <code>i</code>, and purchasing one unit of metal type <code>i</code> costs <code>cost[i]</code> coins.</p>
|
||||
|
||||
<p>Given integers <code>n</code>, <code>k</code>, <code>budget</code>, a <strong>1-indexed</strong> 2D array <code>composition</code>, and <strong>1-indexed</strong> arrays <code>stock</code> and <code>cost</code>, your goal is to <strong>maximize</strong> the number of alloys the company can create while staying within the budget of <code>budget</code> coins.</p>
|
||||
|
||||
<p><strong>All alloys must be created with the same machine.</strong></p>
|
||||
|
||||
<p>Return <em>the maximum number of alloys that the company can create</em>.</p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> n = 3, k = 2, budget = 15, composition = [[1,1,1],[1,1,10]], stock = [0,0,0], cost = [1,2,3]
|
||||
<strong>Output:</strong> 2
|
||||
<strong>Explanation:</strong> It is optimal to use the 1<sup>st</sup> machine to create alloys.
|
||||
To create 2 alloys we need to buy the:
|
||||
- 2 units of metal of the 1<sup>st</sup> type.
|
||||
- 2 units of metal of the 2<sup>nd</sup> type.
|
||||
- 2 units of metal of the 3<sup>rd</sup> type.
|
||||
In total, we need 2 * 1 + 2 * 2 + 2 * 3 = 12 coins, which is smaller than or equal to budget = 15.
|
||||
Notice that we have 0 units of metal of each type and we have to buy all the required units of metal.
|
||||
It can be proven that we can create at most 2 alloys.
|
||||
</pre>
|
||||
|
||||
<p><strong class="example">Example 2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> n = 3, k = 2, budget = 15, composition = [[1,1,1],[1,1,10]], stock = [0,0,100], cost = [1,2,3]
|
||||
<strong>Output:</strong> 5
|
||||
<strong>Explanation:</strong> It is optimal to use the 2<sup>nd</sup> machine to create alloys.
|
||||
To create 5 alloys we need to buy:
|
||||
- 5 units of metal of the 1<sup>st</sup> type.
|
||||
- 5 units of metal of the 2<sup>nd</sup> type.
|
||||
- 0 units of metal of the 3<sup>rd</sup> type.
|
||||
In total, we need 5 * 1 + 5 * 2 + 0 * 3 = 15 coins, which is smaller than or equal to budget = 15.
|
||||
It can be proven that we can create at most 5 alloys.
|
||||
</pre>
|
||||
|
||||
<p><strong class="example">Example 3:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> n = 2, k = 3, budget = 10, composition = [[2,1],[1,2],[1,1]], stock = [1,1], cost = [5,5]
|
||||
<strong>Output:</strong> 2
|
||||
<strong>Explanation:</strong> It is optimal to use the 3<sup>rd</sup> machine to create alloys.
|
||||
To create 2 alloys we need to buy the:
|
||||
- 1 unit of metal of the 1<sup>st</sup> type.
|
||||
- 1 unit of metal of the 2<sup>nd</sup> type.
|
||||
In total, we need 1 * 5 + 1 * 5 = 10 coins, which is smaller than or equal to budget = 10.
|
||||
It can be proven that we can create at most 2 alloys.
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Constraints:</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>1 <= n, k <= 100</code></li>
|
||||
<li><code>0 <= budget <= 10<sup>8</sup></code></li>
|
||||
<li><code>composition.length == k</code></li>
|
||||
<li><code>composition[i].length == n</code></li>
|
||||
<li><code>1 <= composition[i][j] <= 100</code></li>
|
||||
<li><code>stock.length == cost.length == n</code></li>
|
||||
<li><code>0 <= stock[i] <= 10<sup>8</sup></code></li>
|
||||
<li><code>1 <= cost[i] <= 100</code></li>
|
||||
</ul>
|
||||
@ -0,0 +1,59 @@
|
||||
<p>You are given a <strong>0-indexed</strong> <strong>sorted</strong> array of integers <code>nums</code>.</p>
|
||||
|
||||
<p>You can perform the following operation any number of times:</p>
|
||||
|
||||
<ul>
|
||||
<li>Choose <strong>two</strong> indices, <code>i</code> and <code>j</code>, where <code>i < j</code>, such that <code>nums[i] < nums[j]</code>.</li>
|
||||
<li>Then, remove the elements at indices <code>i</code> and <code>j</code> from <code>nums</code>. The remaining elements retain their original order, and the array is re-indexed.</li>
|
||||
</ul>
|
||||
|
||||
<p>Return <em>an integer that denotes the <strong>minimum</strong> length of </em><code>nums</code><em> after performing the operation any number of times (<strong>including zero</strong>).</em></p>
|
||||
|
||||
<p>Note that <code>nums</code> is sorted in <strong>non-decreasing</strong> order.</p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> nums = [1,3,4,9]
|
||||
<strong>Output:</strong> 0
|
||||
<strong>Explanation:</strong> Initially, nums = [1, 3, 4, 9].
|
||||
In the first operation, we can choose index 0 and 1 because nums[0] < nums[1] <=> 1 < 3.
|
||||
Remove indices 0 and 1, and nums becomes [4, 9].
|
||||
For the next operation, we can choose index 0 and 1 because nums[0] < nums[1] <=> 4 < 9.
|
||||
Remove indices 0 and 1, and nums becomes an empty array [].
|
||||
Hence, the minimum length achievable is 0.</pre>
|
||||
|
||||
<p><strong class="example">Example 2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> nums = [2,3,6,9]
|
||||
<strong>Output:</strong> 0
|
||||
<strong>Explanation:</strong> Initially, nums = [2, 3, 6, 9].
|
||||
In the first operation, we can choose index 0 and 2 because nums[0] < nums[2] <=> 2 < 6.
|
||||
Remove indices 0 and 2, and nums becomes [3, 9].
|
||||
For the next operation, we can choose index 0 and 1 because nums[0] < nums[1] <=> 3 < 9.
|
||||
Remove indices 0 and 1, and nums becomes an empty array [].
|
||||
Hence, the minimum length achievable is 0.
|
||||
</pre>
|
||||
|
||||
<p><strong class="example">Example 3:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> nums = [1,1,2]
|
||||
<strong>Output:</strong> 1
|
||||
<strong>Explanation:</strong> Initially, nums = [1, 1, 2].
|
||||
In an operation, we can choose index 0 and 2 because nums[0] < nums[2] <=> 1 < 2.
|
||||
Remove indices 0 and 2, and nums becomes [1].
|
||||
It is no longer possible to perform an operation on the array.
|
||||
Hence, the minimum achievable length is 1.
|
||||
</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>9</sup></code></li>
|
||||
<li><code>nums</code> is sorted in <strong>non-decreasing</strong> order.</li>
|
||||
</ul>
|
||||
@ -0,0 +1,57 @@
|
||||
<p>There is a <strong>simple directed graph</strong> with <code>n</code> nodes labeled from <code>0</code> to <code>n - 1</code>. The graph would form a <strong>tree</strong> if its edges were bi-directional.</p>
|
||||
|
||||
<p>You are given an integer <code>n</code> and a <strong>2D</strong> integer array <code>edges</code>, where <code>edges[i] = [u<sub>i</sub>, v<sub>i</sub>]</code> represents a <strong>directed edge</strong> going from node <code>u<sub>i</sub></code> to node <code>v<sub>i</sub></code>.</p>
|
||||
|
||||
<p>An <strong>edge reversal</strong> changes the direction of an edge, i.e., a directed edge going from node <code>u<sub>i</sub></code> to node <code>v<sub>i</sub></code> becomes a directed edge going from node <code>v<sub>i</sub></code> to node <code>u<sub>i</sub></code>.</p>
|
||||
|
||||
<p>For every node <code>i</code> in the range <code>[0, n - 1]</code>, your task is to <strong>independently</strong> calculate the <strong>minimum</strong> number of <strong>edge reversals</strong> required so it is possible to reach any other node starting from node <code>i</code> through a <strong>sequence</strong> of <strong>directed edges</strong>.</p>
|
||||
|
||||
<p>Return <em>an integer array </em><code>answer</code><em>, where </em><code>answer[i]</code><em> is the</em><em> </em> <em><strong>minimum</strong> number of <strong>edge reversals</strong> required so it is possible to reach any other node starting from node </em><code>i</code><em> through a <strong>sequence</strong> of <strong>directed edges</strong>.</em></p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
|
||||
<p><img height="246" src="https://assets.leetcode.com/uploads/2023/08/26/image-20230826221104-3.png" width="312" /></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> n = 4, edges = [[2,0],[2,1],[1,3]]
|
||||
<strong>Output:</strong> [1,1,0,2]
|
||||
<strong>Explanation:</strong> The image above shows the graph formed by the edges.
|
||||
For node 0: after reversing the edge [2,0], it is possible to reach any other node starting from node 0.
|
||||
So, answer[0] = 1.
|
||||
For node 1: after reversing the edge [2,1], it is possible to reach any other node starting from node 1.
|
||||
So, answer[1] = 1.
|
||||
For node 2: it is already possible to reach any other node starting from node 2.
|
||||
So, answer[2] = 0.
|
||||
For node 3: after reversing the edges [1,3] and [2,1], it is possible to reach any other node starting from node 3.
|
||||
So, answer[3] = 2.
|
||||
</pre>
|
||||
|
||||
<p><strong class="example">Example 2:</strong></p>
|
||||
|
||||
<p><img height="217" src="https://assets.leetcode.com/uploads/2023/08/26/image-20230826225541-2.png" width="322" /></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> n = 3, edges = [[1,2],[2,0]]
|
||||
<strong>Output:</strong> [2,0,1]
|
||||
<strong>Explanation:</strong> The image above shows the graph formed by the edges.
|
||||
For node 0: after reversing the edges [2,0] and [1,2], it is possible to reach any other node starting from node 0.
|
||||
So, answer[0] = 2.
|
||||
For node 1: it is already possible to reach any other node starting from node 1.
|
||||
So, answer[1] = 0.
|
||||
For node 2: after reversing the edge [1, 2], it is possible to reach any other node starting from node 2.
|
||||
So, answer[2] = 1.
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Constraints:</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>2 <= n <= 10<sup>5</sup></code></li>
|
||||
<li><code>edges.length == n - 1</code></li>
|
||||
<li><code>edges[i].length == 2</code></li>
|
||||
<li><code>0 <= u<sub>i</sub> == edges[i][0] < n</code></li>
|
||||
<li><code>0 <= v<sub>i</sub> == edges[i][1] < n</code></li>
|
||||
<li><code>u<sub>i</sub> != v<sub>i</sub></code></li>
|
||||
<li>The input is generated such that if the edges were bi-directional, the graph would be a tree.</li>
|
||||
</ul>
|
||||
@ -0,0 +1,42 @@
|
||||
<p>You are given a <strong>0-indexed</strong> 2D integer matrix <code>grid</code> of size <code>3 * 3</code>, representing the number of stones in each cell. The grid contains exactly <code>9</code> stones, and there can be <strong>multiple</strong> stones in a single cell.</p>
|
||||
|
||||
<p>In one move, you can move a single stone from its current cell to any other cell if the two cells share a side.</p>
|
||||
|
||||
<p>Return <em>the <strong>minimum number of moves</strong> required to place one stone in each cell</em>.</p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
<img alt="" src="https://assets.leetcode.com/uploads/2023/08/23/example1-3.svg" style="width: 401px; height: 281px;" />
|
||||
<pre>
|
||||
<strong>Input:</strong> grid = [[1,1,0],[1,1,1],[1,2,1]]
|
||||
<strong>Output:</strong> 3
|
||||
<strong>Explanation:</strong> One possible sequence of moves to place one stone in each cell is:
|
||||
1- Move one stone from cell (2,1) to cell (2,2).
|
||||
2- Move one stone from cell (2,2) to cell (1,2).
|
||||
3- Move one stone from cell (1,2) to cell (0,2).
|
||||
In total, it takes 3 moves to place one stone in each cell of the grid.
|
||||
It can be shown that 3 is the minimum number of moves required to place one stone in each cell.
|
||||
</pre>
|
||||
|
||||
<p><strong class="example">Example 2:</strong></p>
|
||||
<img alt="" src="https://assets.leetcode.com/uploads/2023/08/23/example2-2.svg" style="width: 401px; height: 281px;" />
|
||||
<pre>
|
||||
<strong>Input:</strong> grid = [[1,3,0],[1,0,0],[1,0,3]]
|
||||
<strong>Output:</strong> 4
|
||||
<strong>Explanation:</strong> One possible sequence of moves to place one stone in each cell is:
|
||||
1- Move one stone from cell (0,1) to cell (0,2).
|
||||
2- Move one stone from cell (0,1) to cell (1,1).
|
||||
3- Move one stone from cell (2,2) to cell (1,2).
|
||||
4- Move one stone from cell (2,2) to cell (2,1).
|
||||
In total, it takes 4 moves to place one stone in each cell of the grid.
|
||||
It can be shown that 4 is the minimum number of moves required to place one stone in each cell.
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Constraints:</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>grid.length == grid[i].length == 3</code></li>
|
||||
<li><code>0 <= grid[i][j] <= 9</code></li>
|
||||
<li>Sum of <code>grid</code> is equal to <code>9</code>.</li>
|
||||
</ul>
|
||||
39
leetcode/problem/minimum-right-shifts-to-sort-the-array.html
Normal file
39
leetcode/problem/minimum-right-shifts-to-sort-the-array.html
Normal file
@ -0,0 +1,39 @@
|
||||
<p>You are given a <strong>0-indexed</strong> array <code>nums</code> of length <code>n</code> containing <strong>distinct</strong> positive integers. Return <em>the <strong>minimum</strong> number of <strong>right shifts</strong> required to sort </em><code>nums</code><em> and </em><code>-1</code><em> if this is not possible.</em></p>
|
||||
|
||||
<p>A <strong>right shift</strong> is defined as shifting the element at index <code>i</code> to index <code>(i + 1) % n</code>, for all indices.</p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> nums = [3,4,5,1,2]
|
||||
<strong>Output:</strong> 2
|
||||
<strong>Explanation:</strong>
|
||||
After the first right shift, nums = [2,3,4,5,1].
|
||||
After the second right shift, nums = [1,2,3,4,5].
|
||||
Now nums is sorted; therefore the answer is 2.
|
||||
</pre>
|
||||
|
||||
<p><strong class="example">Example 2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> nums = [1,3,5]
|
||||
<strong>Output:</strong> 0
|
||||
<strong>Explanation:</strong> nums is already sorted therefore, the answer is 0.</pre>
|
||||
|
||||
<p><strong class="example">Example 3:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> nums = [2,1,4]
|
||||
<strong>Output:</strong> -1
|
||||
<strong>Explanation:</strong> It's impossible to sort the array using right shifts.
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Constraints:</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>1 <= nums.length <= 100</code></li>
|
||||
<li><code>1 <= nums[i] <= 100</code></li>
|
||||
<li><code>nums</code> contains distinct integers.</li>
|
||||
</ul>
|
||||
29
leetcode/problem/points-that-intersect-with-cars.html
Normal file
29
leetcode/problem/points-that-intersect-with-cars.html
Normal file
@ -0,0 +1,29 @@
|
||||
<p>You are given a <strong>0-indexed</strong> 2D integer array <code>nums</code> representing the coordinates of the cars parking on a number line. For any index <code>i</code>, <code>nums[i] = [start<sub>i</sub>, end<sub>i</sub>]</code> where <code>start<sub>i</sub></code> is the starting point of the <code>i<sup>th</sup></code> car and <code>end<sub>i</sub></code> is the ending point of the <code>i<sup>th</sup></code> car.</p>
|
||||
|
||||
<p>Return <em>the number of integer points on the line that are covered with <strong>any part</strong> of a car.</em></p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> nums = [[3,6],[1,5],[4,7]]
|
||||
<strong>Output:</strong> 7
|
||||
<strong>Explanation:</strong> All the points from 1 to 7 intersect at least one car, therefore the answer would be 7.
|
||||
</pre>
|
||||
|
||||
<p><strong class="example">Example 2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> nums = [[1,3],[5,8]]
|
||||
<strong>Output:</strong> 7
|
||||
<strong>Explanation:</strong> Points intersecting at least one car are 1, 2, 3, 5, 6, 7, 8. There are a total of 7 points, therefore the answer would be 7.
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Constraints:</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>1 <= nums.length <= 100</code></li>
|
||||
<li><code>nums[i].length == 2</code></li>
|
||||
<li><code><font face="monospace">1 <= start<sub>i</sub> <= end<sub>i</sub> <= 100</font></code></li>
|
||||
</ul>
|
||||
49
leetcode/problem/string-transformation.html
Normal file
49
leetcode/problem/string-transformation.html
Normal file
@ -0,0 +1,49 @@
|
||||
<p>You are given two strings <code>s</code> and <code>t</code> of equal length <code>n</code>. You can perform the following operation on the string <code>s</code>:</p>
|
||||
|
||||
<ul>
|
||||
<li>Remove a <strong>suffix</strong> of <code>s</code> of length <code>l</code> where <code>0 < l < n</code> and append it at the start of <code>s</code>.<br />
|
||||
For example, let <code>s = 'abcd'</code> then in one operation you can remove the suffix <code>'cd'</code> and append it in front of <code>s</code> making <code>s = 'cdab'</code>.</li>
|
||||
</ul>
|
||||
|
||||
<p>You are also given an integer <code>k</code>. Return <em>the number of ways in which </em><code>s</code> <em>can be transformed into </em><code>t</code><em> in <strong>exactly</strong> </em><code>k</code><em> operations.</em></p>
|
||||
|
||||
<p>Since the answer can be large, return it <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> s = "abcd", t = "cdab", k = 2
|
||||
<strong>Output:</strong> 2
|
||||
<strong>Explanation:</strong>
|
||||
First way:
|
||||
In first operation, choose suffix from index = 3, so resulting s = "dabc".
|
||||
In second operation, choose suffix from index = 3, so resulting s = "cdab".
|
||||
|
||||
Second way:
|
||||
In first operation, choose suffix from index = 1, so resulting s = "bcda".
|
||||
In second operation, choose suffix from index = 1, so resulting s = "cdab".
|
||||
</pre>
|
||||
|
||||
<p><strong class="example">Example 2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> s = "ababab", t = "ababab", k = 1
|
||||
<strong>Output:</strong> 2
|
||||
<strong>Explanation:</strong>
|
||||
First way:
|
||||
Choose suffix from index = 2, so resulting s = "ababab".
|
||||
|
||||
Second way:
|
||||
Choose suffix from index = 4, so resulting s = "ababab".
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Constraints:</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>2 <= s.length <= 5 * 10<sup>5</sup></code></li>
|
||||
<li><code>1 <= k <= 10<sup>15</sup></code></li>
|
||||
<li><code>s.length == t.length</code></li>
|
||||
<li><code>s</code> and <code>t</code> consist of only lowercase English alphabets.</li>
|
||||
</ul>
|
||||
@ -0,0 +1,47 @@
|
||||
<p>You are given a <strong>0-indexed</strong> integer array <code>nums</code> and an integer <code>k</code>.</p>
|
||||
|
||||
<p>Return <em>an integer that denotes the <strong>sum</strong> of elements in </em><code>nums</code><em> whose corresponding <strong>indices</strong> have <strong>exactly</strong> </em><code>k</code><em> set bits in their binary representation.</em></p>
|
||||
|
||||
<p>The <strong>set bits</strong> in an integer are the <code>1</code>'s present when it is written in binary.</p>
|
||||
|
||||
<ul>
|
||||
<li>For example, the binary representation of <code>21</code> is <code>10101</code>, which has <code>3</code> set bits.</li>
|
||||
</ul>
|
||||
|
||||
<p> </p>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> nums = [5,10,1,5,2], k = 1
|
||||
<strong>Output:</strong> 13
|
||||
<strong>Explanation:</strong> The binary representation of the indices are:
|
||||
0 = 000<sub>2</sub>
|
||||
1 = 001<sub>2</sub>
|
||||
2 = 010<sub>2</sub>
|
||||
3 = 011<sub>2</sub>
|
||||
4 = 100<sub>2
|
||||
</sub>Indices 1, 2, and 4 have k = 1 set bits in their binary representation.
|
||||
Hence, the answer is nums[1] + nums[2] + nums[4] = 13.</pre>
|
||||
|
||||
<p><strong class="example">Example 2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> nums = [4,3,2,1], k = 2
|
||||
<strong>Output:</strong> 1
|
||||
<strong>Explanation:</strong> The binary representation of the indices are:
|
||||
0 = 00<sub>2</sub>
|
||||
1 = 01<sub>2</sub>
|
||||
2 = 10<sub>2</sub>
|
||||
3 = 11<sub>2
|
||||
</sub>Only index 3 has k = 2 set bits in its binary representation.
|
||||
Hence, the answer is nums[3] = 1.
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Constraints:</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>1 <= nums.length <= 1000</code></li>
|
||||
<li><code>1 <= nums[i] <= 10<sup>5</sup></code></li>
|
||||
<li><code>0 <= k <= 10</code></li>
|
||||
</ul>
|
||||
Loading…
Reference in New Issue
Block a user