diff --git "a/lcof/\351\235\242\350\257\225\351\242\23003. \346\225\260\347\273\204\344\270\255\351\207\215\345\244\215\347\232\204\346\225\260\345\255\227/README.md" "b/lcof/\351\235\242\350\257\225\351\242\23003. \346\225\260\347\273\204\344\270\255\351\207\215\345\244\215\347\232\204\346\225\260\345\255\227/README.md" index 802558ed38cfe..4f15894dadf9e 100644 --- "a/lcof/\351\235\242\350\257\225\351\242\23003. \346\225\260\347\273\204\344\270\255\351\207\215\345\244\215\347\232\204\346\225\260\345\255\227/README.md" +++ "b/lcof/\351\235\242\350\257\225\351\242\23003. \346\225\260\347\273\204\344\270\255\351\207\215\345\244\215\347\232\204\346\225\260\345\255\227/README.md" @@ -165,7 +165,7 @@ function swap(nums: number[], i: number, j: number): void { ### **Rust** -```rs +```rust impl Solution { pub fn find_repeat_number(mut nums: Vec) -> i32 { for i in 0..nums.len() { diff --git "a/lcof2/\345\211\221\346\214\207 Offer II 035. \346\234\200\345\260\217\346\227\266\351\227\264\345\267\256/README.md" "b/lcof2/\345\211\221\346\214\207 Offer II 035. \346\234\200\345\260\217\346\227\266\351\227\264\345\267\256/README.md" index 14b346c81ef2c..5abc1dcb2f422 100644 --- "a/lcof2/\345\211\221\346\214\207 Offer II 035. \346\234\200\345\260\217\346\227\266\351\227\264\345\267\256/README.md" +++ "b/lcof2/\345\211\221\346\214\207 Offer II 035. \346\234\200\345\260\217\346\227\266\351\227\264\345\267\256/README.md" @@ -39,6 +39,10 @@ +我们注意到，时间点最多只有 `24 * 60` 个，因此，当 timePoints 长度超过 `24 * 60`，说明有重复的时间点，提前返回 0。 + +接下来： + 首先，遍历时间列表，将其转换为“分钟制”列表 `mins`，比如，对于时间点 `13:14`，将其转换为 `13 * 60 + 14`。 接着将“分钟制”列表按升序排列，然后将此列表的最小时间 `mins[0]` 加上 `24 * 60` 追加至列表尾部，用于处理最大值、最小值的差值这种特殊情况。 diff --git a/solution/0000-0099/0026.Remove Duplicates from Sorted Array/README.md b/solution/0000-0099/0026.Remove Duplicates from Sorted Array/README.md index 18bd1c585100b..deb7645d78123 100644 --- a/solution/0000-0099/0026.Remove Duplicates from Sorted Array/README.md +++ b/solution/0000-0099/0026.Remove Duplicates from Sorted Array/README.md @@ -65,8 +65,8 @@ for (int i = 0; i < len; i++) { 原问题要求最多相同的数字最多出现 1 次，我们可以扩展至相同的数字最多保留 k 个。 -- 由于相同的数字最多保留 k 个，那么原数组的前 k 个元素我们可以直接保留； -- 对于后面的数字，能够保留的前提是：当前数字 num 与前面已保留的数字的倒数第 k 个元素比较，不同则保留，相同则跳过。 +- 由于相同的数字最多保留 k 个，那么原数组的前 k 个元素我们可以直接保留； +- 对于后面的数字，能够保留的前提是：当前数字 num 与前面已保留的数字的倒数第 k 个元素比较，不同则保留，相同则跳过。 相似题目：[80. 删除有序数组中的重复项 II](/solution/0000-0099/0080.Remove%20Duplicates%20from%20Sorted%20Array%20II/README.md) @@ -173,7 +173,7 @@ public class Solution { ### **Rust** -```rs +```rust impl Solution { pub fn remove_duplicates(nums: &mut Vec) -> i32 { let mut len = 0; diff --git a/solution/0000-0099/0026.Remove Duplicates from Sorted Array/README_EN.md b/solution/0000-0099/0026.Remove Duplicates from Sorted Array/README_EN.md index c73138dc8b0fd..d2b7915133b2f 100644 --- a/solution/0000-0099/0026.Remove Duplicates from Sorted Array/README_EN.md +++ b/solution/0000-0099/0026.Remove Duplicates from Sorted Array/README_EN.md @@ -153,7 +153,7 @@ public class Solution { ### **Rust** -```rs +```rust impl Solution { pub fn remove_duplicates(nums: &mut Vec) -> i32 { let mut len = 0; diff --git a/solution/0000-0099/0027.Remove Element/README.md b/solution/0000-0099/0027.Remove Element/README.md index dd2b982493819..46fbec98c7d91 100644 --- a/solution/0000-0099/0027.Remove Element/README.md +++ b/solution/0000-0099/0027.Remove Element/README.md @@ -153,7 +153,7 @@ func removeElement(nums []int, val int) int { ### **Rust** -```rs +```rust impl Solution { pub fn remove_element(nums: &mut Vec, val: i32) -> i32 { let mut len = 0; diff --git a/solution/0000-0099/0027.Remove Element/README_EN.md b/solution/0000-0099/0027.Remove Element/README_EN.md index 9654261346142..a2d9e151474fc 100644 --- a/solution/0000-0099/0027.Remove Element/README_EN.md +++ b/solution/0000-0099/0027.Remove Element/README_EN.md @@ -141,7 +141,7 @@ func removeElement(nums []int, val int) int { ### **Rust** -```rs +```rust impl Solution { pub fn remove_element(nums: &mut Vec, val: i32) -> i32 { let mut len = 0; diff --git a/solution/0000-0099/0080.Remove Duplicates from Sorted Array II/README.md b/solution/0000-0099/0080.Remove Duplicates from Sorted Array II/README.md index 1d698e8472932..b001264a15bdb 100644 --- a/solution/0000-0099/0080.Remove Duplicates from Sorted Array II/README.md +++ b/solution/0000-0099/0080.Remove Duplicates from Sorted Array II/README.md @@ -65,8 +65,8 @@ for (int i = 0; i < len; i++) { 原问题要求最多相同的数字最多出现 2 次，我们可以扩展至相同的数字最多保留 k 个。 -- 由于相同的数字最多保留 k 个，那么原数组的前 k 个元素我们可以直接保留； -- 对于后面的数字，能够保留的前提是：当前数字 num 与前面已保留的数字的倒数第 k 个元素比较，不同则保留，相同则跳过。 +- 由于相同的数字最多保留 k 个，那么原数组的前 k 个元素我们可以直接保留； +- 对于后面的数字，能够保留的前提是：当前数字 num 与前面已保留的数字的倒数第 k 个元素比较，不同则保留，相同则跳过。 相似题目：[26. 删除有序数组中的重复项](/solution/0000-0099/0026.Remove%20Duplicates%20from%20Sorted%20Array/README.md) @@ -173,7 +173,7 @@ func removeDuplicates(nums []int) int { ### **Rust** -```rs +```rust impl Solution { pub fn remove_duplicates(nums: &mut Vec) -> i32 { let mut len = 0; diff --git a/solution/0000-0099/0080.Remove Duplicates from Sorted Array II/README_EN.md b/solution/0000-0099/0080.Remove Duplicates from Sorted Array II/README_EN.md index 998b365bbda5e..3316072151602 100644 --- a/solution/0000-0099/0080.Remove Duplicates from Sorted Array II/README_EN.md +++ b/solution/0000-0099/0080.Remove Duplicates from Sorted Array II/README_EN.md @@ -154,7 +154,7 @@ func removeDuplicates(nums []int) int { ### **Rust** -```rs +```rust impl Solution { pub fn remove_duplicates(nums: &mut Vec) -> i32 { let mut len = 0; diff --git a/solution/0100-0199/0169.Majority Element/README.md b/solution/0100-0199/0169.Majority Element/README.md index df7ddd4d05ff1..db0b3c3944f29 100644 --- a/solution/0100-0199/0169.Majority Element/README.md +++ b/solution/0100-0199/0169.Majority Element/README.md @@ -167,7 +167,7 @@ func majorityElement(nums []int) int { ### **Rust** -```rs +```rust impl Solution { pub fn majority_element(nums: Vec) -> i32 { let mut major = 0; diff --git a/solution/0100-0199/0169.Majority Element/README_EN.md b/solution/0100-0199/0169.Majority Element/README_EN.md index b02a579961e59..f62fc9a66ccbc 100644 --- a/solution/0100-0199/0169.Majority Element/README_EN.md +++ b/solution/0100-0199/0169.Majority Element/README_EN.md @@ -154,7 +154,7 @@ func majorityElement(nums []int) int { ### **Rust** -```rs +```rust impl Solution { pub fn majority_element(nums: Vec) -> i32 { let mut major = 0; diff --git a/solution/0100-0199/0189.Rotate Array/README.md b/solution/0100-0199/0189.Rotate Array/README.md index c6d815c149677..fda594571fd5a 100644 --- a/solution/0100-0199/0189.Rotate Array/README.md +++ b/solution/0100-0199/0189.Rotate Array/README.md @@ -159,7 +159,7 @@ func reverse(nums []int, i, j int) { ### **Rust** -```rs +```rust impl Solution { pub fn rotate(nums: &mut Vec, k: i32) { let n = nums.len(); diff --git a/solution/0100-0199/0189.Rotate Array/README_EN.md b/solution/0100-0199/0189.Rotate Array/README_EN.md index e992bc2a688d4..9de3231f23286 100644 --- a/solution/0100-0199/0189.Rotate Array/README_EN.md +++ b/solution/0100-0199/0189.Rotate Array/README_EN.md @@ -134,7 +134,7 @@ func reverse(nums []int, i, j int) { ### **Rust** -```rs +```rust impl Solution { pub fn rotate(nums: &mut Vec, k: i32) { let n = nums.len(); diff --git a/solution/0200-0299/0283.Move Zeroes/README.md b/solution/0200-0299/0283.Move Zeroes/README.md index 8b651d3792135..ff66087092a89 100644 --- a/solution/0200-0299/0283.Move Zeroes/README.md +++ b/solution/0200-0299/0283.Move Zeroes/README.md @@ -117,7 +117,7 @@ var moveZeroes = function (nums) { ### **Rust** -```rs +```rust impl Solution { pub fn move_zeroes(nums: &mut Vec) { let mut i = 0; diff --git a/solution/0200-0299/0283.Move Zeroes/README_EN.md b/solution/0200-0299/0283.Move Zeroes/README_EN.md index 179666e26ad8e..0603cc2c9631b 100644 --- a/solution/0200-0299/0283.Move Zeroes/README_EN.md +++ b/solution/0200-0299/0283.Move Zeroes/README_EN.md @@ -118,7 +118,7 @@ var moveZeroes = function (nums) { ### **Rust** -```rs +```rust impl Solution { pub fn move_zeroes(nums: &mut Vec) { let mut i = 0; diff --git a/solution/0500-0599/0528.Random Pick with Weight/README.md b/solution/0500-0599/0528.Random Pick with Weight/README.md index ab463065123de..c77a0810f9279 100644 --- a/solution/0500-0599/0528.Random Pick with Weight/README.md +++ b/solution/0500-0599/0528.Random Pick with Weight/README.md @@ -252,7 +252,7 @@ Solution.prototype.pickIndex = function () { ### **Rust** -```rs +```rust use rand::{thread_rng, Rng}; struct Solution { diff --git a/solution/0500-0599/0528.Random Pick with Weight/README_EN.md b/solution/0500-0599/0528.Random Pick with Weight/README_EN.md index 8bde3e780df4a..cf56469840b7c 100644 --- a/solution/0500-0599/0528.Random Pick with Weight/README_EN.md +++ b/solution/0500-0599/0528.Random Pick with Weight/README_EN.md @@ -242,7 +242,7 @@ Solution.prototype.pickIndex = function () { ### **Rust** -```rs +```rust use rand::{thread_rng, Rng}; struct Solution { diff --git a/solution/0500-0599/0539.Minimum Time Difference/README.md b/solution/0500-0599/0539.Minimum Time Difference/README.md index 6cef15e645e96..f08da0d536e2b 100644 --- a/solution/0500-0599/0539.Minimum Time Difference/README.md +++ b/solution/0500-0599/0539.Minimum Time Difference/README.md @@ -37,6 +37,10 @@ +我们注意到，时间点最多只有 `24 * 60` 个，因此，当 timePoints 长度超过 `24 * 60`，说明有重复的时间点，提前返回 0。 + +接下来： + 首先，遍历时间列表，将其转换为“分钟制”列表 `mins`，比如，对于时间点 `13:14`，将其转换为 `13 * 60 + 14`。 接着将“分钟制”列表按升序排列，然后将此列表的最小时间 `mins[0]` 加上 `24 * 60` 追加至列表尾部，用于处理最大值、最小值的差值这种特殊情况。 diff --git a/solution/1000-1099/1036.Escape a Large Maze/README.md b/solution/1000-1099/1036.Escape a Large Maze/README.md index e45a653176e11..01734da370418 100644 --- a/solution/1000-1099/1036.Escape a Large Maze/README.md +++ b/solution/1000-1099/1036.Escape a Large Maze/README.md @@ -188,7 +188,7 @@ func isEscapePossible(blocked [][]int, source []int, target []int) bool { ### **Rust** -```rs +```rust use std::collections::{HashSet, VecDeque}; const BOUNDARY: i32 = 1_000_000; diff --git a/solution/1000-1099/1036.Escape a Large Maze/README_EN.md b/solution/1000-1099/1036.Escape a Large Maze/README_EN.md index 4aee5df5b8383..9ff19391db29c 100644 --- a/solution/1000-1099/1036.Escape a Large Maze/README_EN.md +++ b/solution/1000-1099/1036.Escape a Large Maze/README_EN.md @@ -177,7 +177,7 @@ func isEscapePossible(blocked [][]int, source []int, target []int) bool { ### **Rust** -```rs +```rust use std::collections::{HashSet, VecDeque}; const BOUNDARY: i32 = 1_000_000;