From 141af5c22d62250f2dd3bc69bc14677bd6882357 Mon Sep 17 00:00:00 2001 From: Libin YANG Date: Sat, 28 Dec 2024 08:28:34 +0800 Subject: [PATCH 1/2] feat: add solutions to lc problems: No.3046,0076 (#3895) --- .../0076.Minimum Window Substring/README.md | 251 +++++++++-------- .../README_EN.md | 252 ++++++++++-------- .../Solution.cpp | 35 ++- .../0076.Minimum Window Substring/Solution.cs | 38 ++- .../0076.Minimum Window Substring/Solution.go | 37 +-- .../Solution.java | 28 +- .../0076.Minimum Window Substring/Solution.py | 19 +- .../0076.Minimum Window Substring/Solution.rs | 46 ++-- .../0076.Minimum Window Substring/Solution.ts | 41 +-- .../3000-3099/3046.Split the Array/README.md | 32 +++ .../3046.Split the Array/README_EN.md | 32 +++ .../3046.Split the Array/Solution.cs | 11 + .../3046.Split the Array/Solution.rs | 11 + 13 files changed, 520 insertions(+), 313 deletions(-) create mode 100644 solution/3000-3099/3046.Split the Array/Solution.cs create mode 100644 solution/3000-3099/3046.Split the Array/Solution.rs diff --git a/solution/0000-0099/0076.Minimum Window Substring/README.md b/solution/0000-0099/0076.Minimum Window Substring/README.md index e85a839437257..ded5d5bf96dd9 100644 --- a/solution/0000-0099/0076.Minimum Window Substring/README.md +++ b/solution/0000-0099/0076.Minimum Window Substring/README.md @@ -77,15 +77,18 @@ tags: ### 方法一：计数 + 双指针 -我们用一个哈希表或数组 $need$ 统计字符串 $t$ 中每个字符出现的次数，用另一个哈希表或数组 $window$ 统计滑动窗口中每个字符出现的次数。另外，定义两个指针 $j$ 和 $i$ 分别指向窗口的左右边界，变量 $cnt$ 表示窗口中已经包含了 $t$ 中的多少个字符，变量 $k$ 和 $mi$ 分别表示最小覆盖子串的起始位置和长度。 +我们用一个哈希表或数组 $\textit{need}$ 统计字符串 $t$ 中每个字符出现的次数，用另一个哈希表或数组 $\textit{window}$ 统计滑动窗口中每个字符出现的次数。另外，定义两个指针 $l$ 和 $r$ 分别指向窗口的左右边界，变量 $\textit{cnt}$ 表示窗口中已经包含了 $t$ 中的多少个字符，变量 $k$ 和 $\textit{mi}$ 分别表示最小覆盖子串的起始位置和长度。 -我们从左到右遍历字符串 $s$，对于当前遍历到的字符 $s[i]$： +我们从左到右遍历字符串 $s$，对于当前遍历到的字符 $s[r]$： -我们将其加入窗口中，即 $window[s[i]] = window[s[i]] + 1$，如果此时 $need[s[i]] \geq window[s[i]]$，则说明 $s[i]$ 是一个「必要的字符」，我们将 $cnt$ 加一。如果 $cnt$ 等于 $t$ 的长度，说明此时窗口中已经包含了 $t$ 中的所有字符，我们就可以尝试更新最小覆盖子串的起始位置和长度了。如果 $i - j + 1 \lt mi$，说明当前窗口表示的子串更短，我们就更新 $mi = i - j + 1$ 和 $k = j$。然后，我们尝试移动左边界 $j$，如果此时 $need[s[j]] \geq window[s[j]]$，则说明 $s[j]$ 是一个「必要的字符」，移动左边界时会把 $s[j]$ 这个字符从窗口中移除，因此我们需要将 $cnt$ 减一，然后更新 $window[s[j]] = window[s[j]] - 1$，并将 $j$ 右移一位。如果 $cnt$ 与 $t$ 的长度不相等，说明此时窗口中还没有包含 $t$ 中的所有字符，我们就不需要移动左边界了，直接将 $i$ 右移一位，继续遍历即可。 +- 我们将其加入窗口中，即 $\textit{window}[s[r]] = \textit{window}[s[r]] + 1$，如果此时 $\textit{need}[s[r]] \geq \textit{window}[s[r]]$，则说明 $s[r]$ 是一个「必要的字符」，我们将 $\textit{cnt}$ 加一。 +- 如果 $\textit{cnt}$ 等于 $t$ 的长度，说明此时窗口中已经包含了 $t$ 中的所有字符，我们就可以尝试更新最小覆盖子串的起始位置和长度了。如果 $r - l + 1 < \textit{mi}$，说明当前窗口表示的子串更短，我们就更新 $\textit{mi} = r - l + 1$ 和 $k = l$。 +- 然后，我们尝试移动左边界 $l$，如果此时 $\textit{need}[s[l]] \geq \textit{window}[s[l]]$，则说明 $s[l]$ 是一个「必要的字符」，移动左边界时会把 $s[l]$ 这个字符从窗口中移除，因此我们需要将 $\textit{cnt}$ 减一，然后更新 $\textit{window}[s[l]] = \textit{window}[s[l]] - 1$，并将 $l$ 右移一位。 +- 如果 $\textit{cnt}$ 与 $t$ 的长度不相等，说明此时窗口中还没有包含 $t$ 中的所有字符，我们就不需要移动左边界了，直接将 $r$ 右移一位，继续遍历即可。 -遍历结束，如果没有找到最小覆盖子串，返回空字符串，否则返回 $s[k:k+mi]$ 即可。 +遍历结束，如果没有找到最小覆盖子串，返回空字符串，否则返回 $s[k:k+\textit{mi}]$ 即可。 -时间复杂度 $O(m + n)$，空间复杂度 $O(C)$。其中 $m$ 和 $n$ 分别是字符串 $s$ 和 $t$ 的长度；而 $C$ 是字符集的大小，本题中 $C = 128$。 +时间复杂度 $O(m + n)$，空间复杂度 $O(|\Sigma|)$。其中 $m$ 和 $n$ 分别是字符串 $s$ 和 $t$ 的长度；而 $|\Sigma|$ 是字符集的大小，本题中 $|\Sigma| = 128$。 @@ -96,20 +99,21 @@ class Solution: def minWindow(self, s: str, t: str) -> str: need = Counter(t) window = Counter() - cnt, j, k, mi = 0, 0, -1, inf - for i, c in enumerate(s): + cnt = l = 0 + k, mi = -1, inf + for r, c in enumerate(s): window[c] += 1 if need[c] >= window[c]: cnt += 1 while cnt == len(t): - if i - j + 1 < mi: - mi = i - j + 1 - k = j - if need[s[j]] >= window[s[j]]: + if r - l + 1 < mi: + mi = r - l + 1 + k = l + if need[s[l]] >= window[s[l]]: cnt -= 1 - window[s[j]] -= 1 - j += 1 - return '' if k < 0 else s[k : k + mi] + window[s[l]] -= 1 + l += 1 + return "" if k < 0 else s[k : k + mi] ``` #### Java @@ -119,25 +123,27 @@ class Solution { public String minWindow(String s, String t) { int[] need = new int[128]; int[] window = new int[128]; - int m = s.length(), n = t.length(); - for (int i = 0; i < n; ++i) { - ++need[t.charAt(i)]; + for (char c : t.toCharArray()) { + ++need[c]; } - int cnt = 0, j = 0, k = -1, mi = 1 << 30; - for (int i = 0; i < m; ++i) { - ++window[s.charAt(i)]; - if (need[s.charAt(i)] >= window[s.charAt(i)]) { + int m = s.length(), n = t.length(); + int k = -1, mi = m + 1, cnt = 0; + for (int l = 0, r = 0; r < m; ++r) { + char c = s.charAt(r); + if (++window[c] <= need[c]) { ++cnt; } while (cnt == n) { - if (i - j + 1 < mi) { - mi = i - j + 1; - k = j; + if (r - l + 1 < mi) { + mi = r - l + 1; + k = l; } - if (need[s.charAt(j)] >= window[s.charAt(j)]) { + c = s.charAt(l); + if (window[c] <= need[c]) { --cnt; } - --window[s.charAt(j++)]; + --window[c]; + ++l; } } return k < 0 ? "" : s.substring(k, k + mi); @@ -151,29 +157,36 @@ class Solution { class Solution { public: string minWindow(string s, string t) { - int need[128]{}; - int window[128]{}; - int m = s.size(), n = t.size(); - for (char& c : t) { + vector need(128, 0); + vector window(128, 0); + for (char c : t) { ++need[c]; } - int cnt = 0, j = 0, k = -1, mi = 1 << 30; - for (int i = 0; i < m; ++i) { - ++window[s[i]]; - if (need[s[i]] >= window[s[i]]) { + + int m = s.length(), n = t.length(); + int k = -1, mi = m + 1, cnt = 0; + + for (int l = 0, r = 0; r < m; ++r) { + char c = s[r]; + if (++window[c] <= need[c]) { ++cnt; } + while (cnt == n) { - if (i - j + 1 < mi) { - mi = i - j + 1; - k = j; + if (r - l + 1 < mi) { + mi = r - l + 1; + k = l; } - if (need[s[j]] >= window[s[j]]) { + + c = s[l]; + if (window[c] <= need[c]) { --cnt; } - --window[s[j++]]; + --window[c]; + ++l; } } + return k < 0 ? "" : s.substr(k, mi); } }; @@ -183,27 +196,32 @@ public: ```go func minWindow(s string, t string) string { - need := [128]int{} - window := [128]int{} - for _, c := range t { - need[c]++ + need := make([]int, 128) + window := make([]int, 128) + for i := 0; i < len(t); i++ { + need[t[i]]++ } - cnt, j, k, mi := 0, 0, -1, 1<<30 - for i, c := range s { - window[c]++ - if need[c] >= window[c] { + + m, n := len(s), len(t) + k, mi, cnt := -1, m+1, 0 + + for l, r := 0, 0; r < m; r++ { + c := s[r] + if window[c]++; window[c] <= need[c] { cnt++ } - for cnt == len(t) { - if i-j+1 < mi { - mi = i - j + 1 - k = j + for cnt == n { + if r-l+1 < mi { + mi = r - l + 1 + k = l } - if need[s[j]] >= window[s[j]] { + + c = s[l] + if window[c] <= need[c] { cnt-- } - window[s[j]]-- - j++ + window[c]-- + l++ } } if k < 0 { @@ -217,69 +235,80 @@ func minWindow(s string, t string) string { ```ts function minWindow(s: string, t: string): string { - const need: number[] = new Array(128).fill(0); - const window: number[] = new Array(128).fill(0); - for (const c of t) { - ++need[c.charCodeAt(0)]; + const need: number[] = Array(128).fill(0); + const window: number[] = Array(128).fill(0); + for (let i = 0; i < t.length; i++) { + need[t.charCodeAt(i)]++; } - let cnt = 0; - let j = 0; - let k = -1; - let mi = 1 << 30; - for (let i = 0; i < s.length; ++i) { - ++window[s.charCodeAt(i)]; - if (need[s.charCodeAt(i)] >= window[s.charCodeAt(i)]) { - ++cnt; + const [m, n] = [s.length, t.length]; + let [k, mi, cnt] = [-1, m + 1, 0]; + for (let l = 0, r = 0; r < m; r++) { + let c = s.charCodeAt(r); + if (++window[c] <= need[c]) { + cnt++; } - while (cnt === t.length) { - if (i - j + 1 < mi) { - mi = i - j + 1; - k = j; + while (cnt === n) { + if (r - l + 1 < mi) { + mi = r - l + 1; + k = l; } - if (need[s.charCodeAt(j)] >= window[s.charCodeAt(j)]) { - --cnt; + + c = s.charCodeAt(l); + if (window[c] <= need[c]) { + cnt--; } - --window[s.charCodeAt(j++)]; + window[c]--; + l++; } } - return k < 0 ? '' : s.slice(k, k + mi); + return k < 0 ? '' : s.substring(k, k + mi); } ``` #### Rust ```rust +use std::collections::HashMap; + impl Solution { pub fn min_window(s: String, t: String) -> String { - let (mut need, mut window, mut cnt) = ([0; 256], [0; 256], 0); + let mut need: HashMap = HashMap::new(); + let mut window: HashMap = HashMap::new(); for c in t.chars() { - need[c as usize] += 1; + *need.entry(c).or_insert(0) += 1; } - let (mut j, mut k, mut mi) = (0, -1, 1 << 31); - for (i, c) in s.chars().enumerate() { - window[c as usize] += 1; - if need[c as usize] >= window[c as usize] { + let m = s.len(); + let n = t.len(); + let mut k = -1; + let mut mi = m + 1; + let mut cnt = 0; + + let s_bytes = s.as_bytes(); + let mut l = 0; + for r in 0..m { + let c = s_bytes[r] as char; + *window.entry(c).or_insert(0) += 1; + if window[&c] <= *need.get(&c).unwrap_or(&0) { cnt += 1; } - - while cnt == t.len() { - if i - j + 1 < mi { - k = j as i32; - mi = i - j + 1; + while cnt == n { + if r - l + 1 < mi { + mi = r - l + 1; + k = l as i32; } - let l = s.chars().nth(j).unwrap() as usize; - if need[l] >= window[l] { + + let c = s_bytes[l] as char; + if window[&c] <= *need.get(&c).unwrap_or(&0) { cnt -= 1; } - window[l] -= 1; - j += 1; + *window.entry(c).or_insert(0) -= 1; + l += 1; } } if k < 0 { - return "".to_string(); + return String::new(); } - let k = k as usize; - s[k..k + mi].to_string() + s[k as usize..(k as usize + mi)].to_string() } } ``` @@ -291,26 +320,38 @@ public class Solution { public string MinWindow(string s, string t) { int[] need = new int[128]; int[] window = new int[128]; + foreach (var c in t) { - ++need[c]; + need[c]++; } - int cnt = 0, j = 0, k = -1, mi = 1 << 30; - for (int i = 0; i < s.Length; ++i) { - ++window[s[i]]; - if (need[s[i]] >= window[s[i]]) { - ++cnt; + + int m = s.Length, n = t.Length; + int k = -1, mi = m + 1, cnt = 0; + + int l = 0; + for (int r = 0; r < m; r++) { + char c = s[r]; + window[c]++; + + if (window[c] <= need[c]) { + cnt++; } - while (cnt == t.Length) { - if (i - j + 1 < mi) { - mi = i - j + 1; - k = j; + + while (cnt == n) { + if (r - l + 1 < mi) { + mi = r - l + 1; + k = l; } - if (need[s[j]] >= window[s[j]]) { - --cnt; + + c = s[l]; + if (window[c] <= need[c]) { + cnt--; } - --window[s[j++]]; + window[c]--; + l++; } } + return k < 0 ? "" : s.Substring(k, mi); } } diff --git a/solution/0000-0099/0076.Minimum Window Substring/README_EN.md b/solution/0000-0099/0076.Minimum Window Substring/README_EN.md index 4f6a128dc9b0c..970d19b3e8836 100644 --- a/solution/0000-0099/0076.Minimum Window Substring/README_EN.md +++ b/solution/0000-0099/0076.Minimum Window Substring/README_EN.md @@ -69,15 +69,18 @@ Since the largest window of s only has one 'a', return empty string. ### Solution 1: Counting + Two Pointers -We use a hash table or array $need$ to count the number of occurrences of each character in string $t$, and another hash table or array $window$ to count the number of occurrences of each character in the sliding window. In addition, we define two pointers $j$ and $i$ to point to the left and right boundaries of the window, respectively. The variable $cnt$ represents how many characters in $t$ are already included in the window. The variables $k$ and $mi$ represent the starting position and length of the minimum covering substring, respectively. +We use a hash table or array $\textit{need}$ to count the occurrences of each character in string $t$, and another hash table or array $\textit{window}$ to count the occurrences of each character in the sliding window. Additionally, we define two pointers $l$ and $r$ to point to the left and right boundaries of the window, a variable $\textit{cnt}$ to represent how many characters from $t$ are already included in the window, and variables $k$ and $\textit{mi}$ to represent the starting position and length of the minimum window substring. -We traverse the string $s$ from left to right. For the currently traversed character $s[i]$: +We traverse the string $s$ from left to right. For the current character $s[r]$: -We add it to the window, i.e., $window[s[i]] = window[s[i]] + 1$. If $need[s[i]] \geq window[s[i]]$ at this time, it means that $s[i]$ is a "necessary character", so we increment $cnt$ by one. If $cnt$ equals the length of $t$, it means that all characters in $t$ are already included in the window at this time, so we can try to update the starting position and length of the minimum covering substring. If $i - j + 1 \lt mi$, it means that the substring represented by the current window is shorter, so we update $mi = i - j + 1$ and $k = j$. Then, we try to move the left boundary $j$. If $need[s[j]] \geq window[s[j]]$ at this time, it means that $s[j]$ is a "necessary character". When moving the left boundary, the character $s[j]$ will be removed from the window, so we need to decrement $cnt$ by one, then update $window[s[j]] = window[s[j]] - 1$, and move $j$ one step to the right. If $cnt$ does not equal the length of $t$, it means that all characters in $t$ are not yet included in the window at this time, so we don't need to move the left boundary, just move $i$ one step to the right and continue to traverse. +- We add it to the window, i.e., $\textit{window}[s[r]] = \textit{window}[s[r]] + 1$. If $\textit{need}[s[r]] \geq \textit{window}[s[r]]$, it means $s[r]$ is a "necessary character", and we increment $\textit{cnt}$ by one. +- If $\textit{cnt}$ equals the length of $t$, it means the window already contains all characters from $t$, and we can try to update the starting position and length of the minimum window substring. If $r - l + 1 < \textit{mi}$, it means the current window represents a shorter substring, so we update $\textit{mi} = r - l + 1$ and $k = l$. +- Then, we try to move the left boundary $l$. If $\textit{need}[s[l]] \geq \textit{window}[s[l]]$, it means $s[l]$ is a "necessary character", and moving the left boundary will remove $s[l]$ from the window. Therefore, we need to decrement $\textit{cnt}$ by one, update $\textit{window}[s[l]] = \textit{window}[s[l]] - 1$, and move $l$ one position to the right. +- If $\textit{cnt}$ is not equal to the length of $t$, it means the window does not yet contain all characters from $t$, so we do not need to move the left boundary. Instead, we move $r$ one position to the right and continue traversing. -After the traversal, if the minimum covering substring is not found, return an empty string, otherwise return $s[k:k+mi]$. +After the traversal, if no minimum window substring is found, return an empty string. Otherwise, return $s[k:k+\textit{mi}]$. -The time complexity is $O(m + n)$, and the space complexity is $O(C)$. Here, $m$ and $n$ are the lengths of strings $s$ and $t$ respectively; and $C$ is the size of the character set, in this problem $C = 128$. +The time complexity is $O(m + n)$, and the space complexity is $O(|\Sigma|)$. Here, $m$ and $n$ are the lengths of strings $s$ and $t$, respectively; and $|\Sigma|$ is the size of the character set, which is $128$ in this problem. @@ -88,20 +91,22 @@ class Solution: def minWindow(self, s: str, t: str) -> str: need = Counter(t) window = Counter() - cnt, j, k, mi = 0, 0, -1, inf - for i, c in enumerate(s): + cnt = l = 0 + k, mi = -1, inf + for r, c in enumerate(s): window[c] += 1 if need[c] >= window[c]: cnt += 1 while cnt == len(t): - if i - j + 1 < mi: - mi = i - j + 1 - k = j - if need[s[j]] >= window[s[j]]: + if r - l + 1 < mi: + mi = r - l + 1 + k = l + if need[s[l]] >= window[s[l]]: cnt -= 1 - window[s[j]] -= 1 - j += 1 - return '' if k < 0 else s[k : k + mi] + window[s[l]] -= 1 + l += 1 + return "" if k < 0 else s[k : k + mi] + ``` #### Java @@ -111,25 +116,27 @@ class Solution { public String minWindow(String s, String t) { int[] need = new int[128]; int[] window = new int[128]; - int m = s.length(), n = t.length(); - for (int i = 0; i < n; ++i) { - ++need[t.charAt(i)]; + for (char c : t.toCharArray()) { + ++need[c]; } - int cnt = 0, j = 0, k = -1, mi = 1 << 30; - for (int i = 0; i < m; ++i) { - ++window[s.charAt(i)]; - if (need[s.charAt(i)] >= window[s.charAt(i)]) { + int m = s.length(), n = t.length(); + int k = -1, mi = m + 1, cnt = 0; + for (int l = 0, r = 0; r < m; ++r) { + char c = s.charAt(r); + if (++window[c] <= need[c]) { ++cnt; } while (cnt == n) { - if (i - j + 1 < mi) { - mi = i - j + 1; - k = j; + if (r - l + 1 < mi) { + mi = r - l + 1; + k = l; } - if (need[s.charAt(j)] >= window[s.charAt(j)]) { + c = s.charAt(l); + if (window[c] <= need[c]) { --cnt; } - --window[s.charAt(j++)]; + --window[c]; + ++l; } } return k < 0 ? "" : s.substring(k, k + mi); @@ -143,29 +150,36 @@ class Solution { class Solution { public: string minWindow(string s, string t) { - int need[128]{}; - int window[128]{}; - int m = s.size(), n = t.size(); - for (char& c : t) { + vector need(128, 0); + vector window(128, 0); + for (char c : t) { ++need[c]; } - int cnt = 0, j = 0, k = -1, mi = 1 << 30; - for (int i = 0; i < m; ++i) { - ++window[s[i]]; - if (need[s[i]] >= window[s[i]]) { + + int m = s.length(), n = t.length(); + int k = -1, mi = m + 1, cnt = 0; + + for (int l = 0, r = 0; r < m; ++r) { + char c = s[r]; + if (++window[c] <= need[c]) { ++cnt; } + while (cnt == n) { - if (i - j + 1 < mi) { - mi = i - j + 1; - k = j; + if (r - l + 1 < mi) { + mi = r - l + 1; + k = l; } - if (need[s[j]] >= window[s[j]]) { + + c = s[l]; + if (window[c] <= need[c]) { --cnt; } - --window[s[j++]]; + --window[c]; + ++l; } } + return k < 0 ? "" : s.substr(k, mi); } }; @@ -175,27 +189,32 @@ public: ```go func minWindow(s string, t string) string { - need := [128]int{} - window := [128]int{} - for _, c := range t { - need[c]++ + need := make([]int, 128) + window := make([]int, 128) + for i := 0; i < len(t); i++ { + need[t[i]]++ } - cnt, j, k, mi := 0, 0, -1, 1<<30 - for i, c := range s { - window[c]++ - if need[c] >= window[c] { + + m, n := len(s), len(t) + k, mi, cnt := -1, m+1, 0 + + for l, r := 0, 0; r < m; r++ { + c := s[r] + if window[c]++; window[c] <= need[c] { cnt++ } - for cnt == len(t) { - if i-j+1 < mi { - mi = i - j + 1 - k = j + for cnt == n { + if r-l+1 < mi { + mi = r - l + 1 + k = l } - if need[s[j]] >= window[s[j]] { + + c = s[l] + if window[c] <= need[c] { cnt-- } - window[s[j]]-- - j++ + window[c]-- + l++ } } if k < 0 { @@ -209,69 +228,80 @@ func minWindow(s string, t string) string { ```ts function minWindow(s: string, t: string): string { - const need: number[] = new Array(128).fill(0); - const window: number[] = new Array(128).fill(0); - for (const c of t) { - ++need[c.charCodeAt(0)]; + const need: number[] = Array(128).fill(0); + const window: number[] = Array(128).fill(0); + for (let i = 0; i < t.length; i++) { + need[t.charCodeAt(i)]++; } - let cnt = 0; - let j = 0; - let k = -1; - let mi = 1 << 30; - for (let i = 0; i < s.length; ++i) { - ++window[s.charCodeAt(i)]; - if (need[s.charCodeAt(i)] >= window[s.charCodeAt(i)]) { - ++cnt; + const [m, n] = [s.length, t.length]; + let [k, mi, cnt] = [-1, m + 1, 0]; + for (let l = 0, r = 0; r < m; r++) { + let c = s.charCodeAt(r); + if (++window[c] <= need[c]) { + cnt++; } - while (cnt === t.length) { - if (i - j + 1 < mi) { - mi = i - j + 1; - k = j; + while (cnt === n) { + if (r - l + 1 < mi) { + mi = r - l + 1; + k = l; } - if (need[s.charCodeAt(j)] >= window[s.charCodeAt(j)]) { - --cnt; + + c = s.charCodeAt(l); + if (window[c] <= need[c]) { + cnt--; } - --window[s.charCodeAt(j++)]; + window[c]--; + l++; } } - return k < 0 ? '' : s.slice(k, k + mi); + return k < 0 ? '' : s.substring(k, k + mi); } ``` #### Rust ```rust +use std::collections::HashMap; + impl Solution { pub fn min_window(s: String, t: String) -> String { - let (mut need, mut window, mut cnt) = ([0; 256], [0; 256], 0); + let mut need: HashMap = HashMap::new(); + let mut window: HashMap = HashMap::new(); for c in t.chars() { - need[c as usize] += 1; + *need.entry(c).or_insert(0) += 1; } - let (mut j, mut k, mut mi) = (0, -1, 1 << 31); - for (i, c) in s.chars().enumerate() { - window[c as usize] += 1; - if need[c as usize] >= window[c as usize] { + let m = s.len(); + let n = t.len(); + let mut k = -1; + let mut mi = m + 1; + let mut cnt = 0; + + let s_bytes = s.as_bytes(); + let mut l = 0; + for r in 0..m { + let c = s_bytes[r] as char; + *window.entry(c).or_insert(0) += 1; + if window[&c] <= *need.get(&c).unwrap_or(&0) { cnt += 1; } - - while cnt == t.len() { - if i - j + 1 < mi { - k = j as i32; - mi = i - j + 1; + while cnt == n { + if r - l + 1 < mi { + mi = r - l + 1; + k = l as i32; } - let l = s.chars().nth(j).unwrap() as usize; - if need[l] >= window[l] { + + let c = s_bytes[l] as char; + if window[&c] <= *need.get(&c).unwrap_or(&0) { cnt -= 1; } - window[l] -= 1; - j += 1; + *window.entry(c).or_insert(0) -= 1; + l += 1; } } if k < 0 { - return "".to_string(); + return String::new(); } - let k = k as usize; - s[k..k + mi].to_string() + s[k as usize..(k as usize + mi)].to_string() } } ``` @@ -283,26 +313,38 @@ public class Solution { public string MinWindow(string s, string t) { int[] need = new int[128]; int[] window = new int[128]; + foreach (var c in t) { - ++need[c]; + need[c]++; } - int cnt = 0, j = 0, k = -1, mi = 1 << 30; - for (int i = 0; i < s.Length; ++i) { - ++window[s[i]]; - if (need[s[i]] >= window[s[i]]) { - ++cnt; + + int m = s.Length, n = t.Length; + int k = -1, mi = m + 1, cnt = 0; + + int l = 0; + for (int r = 0; r < m; r++) { + char c = s[r]; + window[c]++; + + if (window[c] <= need[c]) { + cnt++; } - while (cnt == t.Length) { - if (i - j + 1 < mi) { - mi = i - j + 1; - k = j; + + while (cnt == n) { + if (r - l + 1 < mi) { + mi = r - l + 1; + k = l; } - if (need[s[j]] >= window[s[j]]) { - --cnt; + + c = s[l]; + if (window[c] <= need[c]) { + cnt--; } - --window[s[j++]]; + window[c]--; + l++; } } + return k < 0 ? "" : s.Substring(k, mi); } } diff --git a/solution/0000-0099/0076.Minimum Window Substring/Solution.cpp b/solution/0000-0099/0076.Minimum Window Substring/Solution.cpp index 4440db355d94c..fe3ce6fd81185 100644 --- a/solution/0000-0099/0076.Minimum Window Substring/Solution.cpp +++ b/solution/0000-0099/0076.Minimum Window Substring/Solution.cpp @@ -1,29 +1,36 @@ class Solution { public: string minWindow(string s, string t) { - int need[128]{}; - int window[128]{}; - int m = s.size(), n = t.size(); - for (char& c : t) { + vector need(128, 0); + vector window(128, 0); + for (char c : t) { ++need[c]; } - int cnt = 0, j = 0, k = -1, mi = 1 << 30; - for (int i = 0; i < m; ++i) { - ++window[s[i]]; - if (need[s[i]] >= window[s[i]]) { + + int m = s.length(), n = t.length(); + int k = -1, mi = m + 1, cnt = 0; + + for (int l = 0, r = 0; r < m; ++r) { + char c = s[r]; + if (++window[c] <= need[c]) { ++cnt; } + while (cnt == n) { - if (i - j + 1 < mi) { - mi = i - j + 1; - k = j; + if (r - l + 1 < mi) { + mi = r - l + 1; + k = l; } - if (need[s[j]] >= window[s[j]]) { + + c = s[l]; + if (window[c] <= need[c]) { --cnt; } - --window[s[j++]]; + --window[c]; + ++l; } } + return k < 0 ? "" : s.substr(k, mi); } -}; \ No newline at end of file +}; diff --git a/solution/0000-0099/0076.Minimum Window Substring/Solution.cs b/solution/0000-0099/0076.Minimum Window Substring/Solution.cs index 7e52c6100c0dc..f291b126a4f3b 100644 --- a/solution/0000-0099/0076.Minimum Window Substring/Solution.cs +++ b/solution/0000-0099/0076.Minimum Window Substring/Solution.cs @@ -2,26 +2,38 @@ public class Solution { public string MinWindow(string s, string t) { int[] need = new int[128]; int[] window = new int[128]; + foreach (var c in t) { - ++need[c]; + need[c]++; } - int cnt = 0, j = 0, k = -1, mi = 1 << 30; - for (int i = 0; i < s.Length; ++i) { - ++window[s[i]]; - if (need[s[i]] >= window[s[i]]) { - ++cnt; + + int m = s.Length, n = t.Length; + int k = -1, mi = m + 1, cnt = 0; + + int l = 0; + for (int r = 0; r < m; r++) { + char c = s[r]; + window[c]++; + + if (window[c] <= need[c]) { + cnt++; } - while (cnt == t.Length) { - if (i - j + 1 < mi) { - mi = i - j + 1; - k = j; + + while (cnt == n) { + if (r - l + 1 < mi) { + mi = r - l + 1; + k = l; } - if (need[s[j]] >= window[s[j]]) { - --cnt; + + c = s[l]; + if (window[c] <= need[c]) { + cnt--; } - --window[s[j++]]; + window[c]--; + l++; } } + return k < 0 ? "" : s.Substring(k, mi); } } diff --git a/solution/0000-0099/0076.Minimum Window Substring/Solution.go b/solution/0000-0099/0076.Minimum Window Substring/Solution.go index fef4520c01a12..bcf9729cf4b9c 100644 --- a/solution/0000-0099/0076.Minimum Window Substring/Solution.go +++ b/solution/0000-0099/0076.Minimum Window Substring/Solution.go @@ -1,29 +1,34 @@ func minWindow(s string, t string) string { - need := [128]int{} - window := [128]int{} - for _, c := range t { - need[c]++ + need := make([]int, 128) + window := make([]int, 128) + for i := 0; i < len(t); i++ { + need[t[i]]++ } - cnt, j, k, mi := 0, 0, -1, 1<<30 - for i, c := range s { - window[c]++ - if need[c] >= window[c] { + + m, n := len(s), len(t) + k, mi, cnt := -1, m+1, 0 + + for l, r := 0, 0; r < m; r++ { + c := s[r] + if window[c]++; window[c] <= need[c] { cnt++ } - for cnt == len(t) { - if i-j+1 < mi { - mi = i - j + 1 - k = j + for cnt == n { + if r-l+1 < mi { + mi = r - l + 1 + k = l } - if need[s[j]] >= window[s[j]] { + + c = s[l] + if window[c] <= need[c] { cnt-- } - window[s[j]]-- - j++ + window[c]-- + l++ } } if k < 0 { return "" } return s[k : k+mi] -} \ No newline at end of file +} diff --git a/solution/0000-0099/0076.Minimum Window Substring/Solution.java b/solution/0000-0099/0076.Minimum Window Substring/Solution.java index 5f60d1c04c2bd..f2311830bb87d 100644 --- a/solution/0000-0099/0076.Minimum Window Substring/Solution.java +++ b/solution/0000-0099/0076.Minimum Window Substring/Solution.java @@ -2,27 +2,29 @@ class Solution { public String minWindow(String s, String t) { int[] need = new int[128]; int[] window = new int[128]; - int m = s.length(), n = t.length(); - for (int i = 0; i < n; ++i) { - ++need[t.charAt(i)]; + for (char c : t.toCharArray()) { + ++need[c]; } - int cnt = 0, j = 0, k = -1, mi = 1 << 30; - for (int i = 0; i < m; ++i) { - ++window[s.charAt(i)]; - if (need[s.charAt(i)] >= window[s.charAt(i)]) { + int m = s.length(), n = t.length(); + int k = -1, mi = m + 1, cnt = 0; + for (int l = 0, r = 0; r < m; ++r) { + char c = s.charAt(r); + if (++window[c] <= need[c]) { ++cnt; } while (cnt == n) { - if (i - j + 1 < mi) { - mi = i - j + 1; - k = j; + if (r - l + 1 < mi) { + mi = r - l + 1; + k = l; } - if (need[s.charAt(j)] >= window[s.charAt(j)]) { + c = s.charAt(l); + if (window[c] <= need[c]) { --cnt; } - --window[s.charAt(j++)]; + --window[c]; + ++l; } } return k < 0 ? "" : s.substring(k, k + mi); } -} \ No newline at end of file +} diff --git a/solution/0000-0099/0076.Minimum Window Substring/Solution.py b/solution/0000-0099/0076.Minimum Window Substring/Solution.py index ee70c9eadb436..5507b83337e36 100644 --- a/solution/0000-0099/0076.Minimum Window Substring/Solution.py +++ b/solution/0000-0099/0076.Minimum Window Substring/Solution.py @@ -2,17 +2,18 @@ class Solution: def minWindow(self, s: str, t: str) -> str: need = Counter(t) window = Counter() - cnt, j, k, mi = 0, 0, -1, inf - for i, c in enumerate(s): + cnt = l = 0 + k, mi = -1, inf + for r, c in enumerate(s): window[c] += 1 if need[c] >= window[c]: cnt += 1 while cnt == len(t): - if i - j + 1 < mi: - mi = i - j + 1 - k = j - if need[s[j]] >= window[s[j]]: + if r - l + 1 < mi: + mi = r - l + 1 + k = l + if need[s[l]] >= window[s[l]]: cnt -= 1 - window[s[j]] -= 1 - j += 1 - return '' if k < 0 else s[k : k + mi] + window[s[l]] -= 1 + l += 1 + return "" if k < 0 else s[k : k + mi] diff --git a/solution/0000-0099/0076.Minimum Window Substring/Solution.rs b/solution/0000-0099/0076.Minimum Window Substring/Solution.rs index 45e49fb07a1c7..542a4c04c47c1 100644 --- a/solution/0000-0099/0076.Minimum Window Substring/Solution.rs +++ b/solution/0000-0099/0076.Minimum Window Substring/Solution.rs @@ -1,33 +1,43 @@ +use std::collections::HashMap; + impl Solution { pub fn min_window(s: String, t: String) -> String { - let (mut need, mut window, mut cnt) = ([0; 256], [0; 256], 0); + let mut need: HashMap = HashMap::new(); + let mut window: HashMap = HashMap::new(); for c in t.chars() { - need[c as usize] += 1; + *need.entry(c).or_insert(0) += 1; } - let (mut j, mut k, mut mi) = (0, -1, 1 << 31); - for (i, c) in s.chars().enumerate() { - window[c as usize] += 1; - if need[c as usize] >= window[c as usize] { + let m = s.len(); + let n = t.len(); + let mut k = -1; + let mut mi = m + 1; + let mut cnt = 0; + + let s_bytes = s.as_bytes(); + let mut l = 0; + for r in 0..m { + let c = s_bytes[r] as char; + *window.entry(c).or_insert(0) += 1; + if window[&c] <= *need.get(&c).unwrap_or(&0) { cnt += 1; } - - while cnt == t.len() { - if i - j + 1 < mi { - k = j as i32; - mi = i - j + 1; + while cnt == n { + if r - l + 1 < mi { + mi = r - l + 1; + k = l as i32; } - let l = s.chars().nth(j).unwrap() as usize; - if need[l] >= window[l] { + + let c = s_bytes[l] as char; + if window[&c] <= *need.get(&c).unwrap_or(&0) { cnt -= 1; } - window[l] -= 1; - j += 1; + *window.entry(c).or_insert(0) -= 1; + l += 1; } } if k < 0 { - return "".to_string(); + return String::new(); } - let k = k as usize; - s[k..k + mi].to_string() + s[k as usize..(k as usize + mi)].to_string() } } diff --git a/solution/0000-0099/0076.Minimum Window Substring/Solution.ts b/solution/0000-0099/0076.Minimum Window Substring/Solution.ts index 22df8be7c10b1..c1a9af9e801cd 100644 --- a/solution/0000-0099/0076.Minimum Window Substring/Solution.ts +++ b/solution/0000-0099/0076.Minimum Window Substring/Solution.ts @@ -1,28 +1,29 @@ function minWindow(s: string, t: string): string { - const need: number[] = new Array(128).fill(0); - const window: number[] = new Array(128).fill(0); - for (const c of t) { - ++need[c.charCodeAt(0)]; + const need: number[] = Array(128).fill(0); + const window: number[] = Array(128).fill(0); + for (let i = 0; i < t.length; i++) { + need[t.charCodeAt(i)]++; } - let cnt = 0; - let j = 0; - let k = -1; - let mi = 1 << 30; - for (let i = 0; i < s.length; ++i) { - ++window[s.charCodeAt(i)]; - if (need[s.charCodeAt(i)] >= window[s.charCodeAt(i)]) { - ++cnt; + const [m, n] = [s.length, t.length]; + let [k, mi, cnt] = [-1, m + 1, 0]; + for (let l = 0, r = 0; r < m; r++) { + let c = s.charCodeAt(r); + if (++window[c] <= need[c]) { + cnt++; } - while (cnt === t.length) { - if (i - j + 1 < mi) { - mi = i - j + 1; - k = j; + while (cnt === n) { + if (r - l + 1 < mi) { + mi = r - l + 1; + k = l; } - if (need[s.charCodeAt(j)] >= window[s.charCodeAt(j)]) { - --cnt; + + c = s.charCodeAt(l); + if (window[c] <= need[c]) { + cnt--; } - --window[s.charCodeAt(j++)]; + window[c]--; + l++; } } - return k < 0 ? '' : s.slice(k, k + mi); + return k < 0 ? '' : s.substring(k, k + mi); } diff --git a/solution/3000-3099/3046.Split the Array/README.md b/solution/3000-3099/3046.Split the Array/README.md index 028f64aa7b85f..47f8dae7700af 100644 --- a/solution/3000-3099/3046.Split the Array/README.md +++ b/solution/3000-3099/3046.Split the Array/README.md @@ -142,6 +142,38 @@ function isPossibleToSplit(nums: number[]): boolean { } ``` +#### Rust + +```rust +use std::collections::HashMap; + +impl Solution { + pub fn is_possible_to_split(nums: Vec) -> bool { + let mut cnt = HashMap::new(); + for &x in &nums { + *cnt.entry(x).or_insert(0) += 1; + } + *cnt.values().max().unwrap_or(&0) < 3 + } +} +``` + +#### C# + +```cs +public class Solution { + public bool IsPossibleToSplit(int[] nums) { + int[] cnt = new int[101]; + foreach (int x in nums) { + if (++cnt[x] >= 3) { + return false; + } + } + return true; + } +} +``` + diff --git a/solution/3000-3099/3046.Split the Array/README_EN.md b/solution/3000-3099/3046.Split the Array/README_EN.md index 0fd29ec9f8c09..6bcf422d738fc 100644 --- a/solution/3000-3099/3046.Split the Array/README_EN.md +++ b/solution/3000-3099/3046.Split the Array/README_EN.md @@ -140,6 +140,38 @@ function isPossibleToSplit(nums: number[]): boolean { } ``` +#### Rust + +```rust +use std::collections::HashMap; + +impl Solution { + pub fn is_possible_to_split(nums: Vec) -> bool { + let mut cnt = HashMap::new(); + for &x in &nums { + *cnt.entry(x).or_insert(0) += 1; + } + *cnt.values().max().unwrap_or(&0) < 3 + } +} +``` + +#### C# + +```cs +public class Solution { + public bool IsPossibleToSplit(int[] nums) { + int[] cnt = new int[101]; + foreach (int x in nums) { + if (++cnt[x] >= 3) { + return false; + } + } + return true; + } +} +``` + diff --git a/solution/3000-3099/3046.Split the Array/Solution.cs b/solution/3000-3099/3046.Split the Array/Solution.cs new file mode 100644 index 0000000000000..df4331cc4fa16 --- /dev/null +++ b/solution/3000-3099/3046.Split the Array/Solution.cs @@ -0,0 +1,11 @@ +public class Solution { + public bool IsPossibleToSplit(int[] nums) { + int[] cnt = new int[101]; + foreach (int x in nums) { + if (++cnt[x] >= 3) { + return false; + } + } + return true; + } +} diff --git a/solution/3000-3099/3046.Split the Array/Solution.rs b/solution/3000-3099/3046.Split the Array/Solution.rs new file mode 100644 index 0000000000000..3b78dd5eeea3a --- /dev/null +++ b/solution/3000-3099/3046.Split the Array/Solution.rs @@ -0,0 +1,11 @@ +use std::collections::HashMap; + +impl Solution { + pub fn is_possible_to_split(nums: Vec) -> bool { + let mut cnt = HashMap::new(); + for &x in &nums { + *cnt.entry(x).or_insert(0) += 1; + } + *cnt.values().max().unwrap_or(&0) < 3 + } +} From 1a6ab2a14843a10ce654bb0cf167e7972a7df2bf Mon Sep 17 00:00:00 2001 From: Libin YANG Date: Sat, 28 Dec 2024 09:38:38 +0800 Subject: [PATCH 2/2] feat: update solutions to lc problems: No.0189,0238,0041 (#3896) --- .../0041.First Missing Positive/README.md | 102 ++++++++---------- .../0041.First Missing Positive/README_EN.md | 102 ++++++++---------- .../0041.First Missing Positive/Solution.c | 15 ++- .../0041.First Missing Positive/Solution.cpp | 6 +- .../0041.First Missing Positive/Solution.go | 8 +- .../0041.First Missing Positive/Solution.java | 6 +- .../0041.First Missing Positive/Solution.php | 24 ++--- .../0041.First Missing Positive/Solution.py | 8 +- .../0041.First Missing Positive/Solution.rs | 23 ++-- .../0041.First Missing Positive/Solution.ts | 18 ++-- .../0100-0199/0189.Rotate Array/README.md | 21 +--- .../0100-0199/0189.Rotate Array/README_EN.md | 21 +--- .../0100-0199/0189.Rotate Array/Solution2.py | 4 - .../README.md | 28 +---- .../README_EN.md | 28 +---- .../Solution2.ts | 3 - 16 files changed, 144 insertions(+), 273 deletions(-) delete mode 100644 solution/0100-0199/0189.Rotate Array/Solution2.py delete mode 100644 solution/0200-0299/0238.Product of Array Except Self/Solution2.ts diff --git a/solution/0000-0099/0041.First Missing Positive/README.md b/solution/0000-0099/0041.First Missing Positive/README.md index efdeb9c2259c8..6dad14a3ae196 100644 --- a/solution/0000-0099/0041.First Missing Positive/README.md +++ b/solution/0000-0099/0041.First Missing Positive/README.md @@ -73,15 +73,13 @@ tags: ```python class Solution: def firstMissingPositive(self, nums: List[int]) -> int: - def swap(i, j): - nums[i], nums[j] = nums[j], nums[i] - n = len(nums) for i in range(n): while 1 <= nums[i] <= n and nums[i] != nums[nums[i] - 1]: - swap(i, nums[i] - 1) + j = nums[i] - 1 + nums[i], nums[j] = nums[j], nums[i] for i in range(n): - if i + 1 != nums[i]: + if nums[i] != i + 1: return i + 1 return n + 1 ``` @@ -93,12 +91,12 @@ class Solution { public int firstMissingPositive(int[] nums) { int n = nums.length; for (int i = 0; i < n; ++i) { - while (nums[i] >= 1 && nums[i] <= n && nums[i] != nums[nums[i] - 1]) { + while (nums[i] > 0 && nums[i] <= n && nums[i] != nums[nums[i] - 1]) { swap(nums, i, nums[i] - 1); } } for (int i = 0; i < n; ++i) { - if (i + 1 != nums[i]) { + if (nums[i] != i + 1) { return i + 1; } } @@ -121,12 +119,12 @@ public: int firstMissingPositive(vector& nums) { int n = nums.size(); for (int i = 0; i < n; ++i) { - while (nums[i] >= 1 && nums[i] <= n && nums[i] != nums[nums[i] - 1]) { + while (nums[i] > 0 && nums[i] <= n && nums[i] != nums[nums[i] - 1]) { swap(nums[i], nums[nums[i] - 1]); } } for (int i = 0; i < n; ++i) { - if (i + 1 != nums[i]) { + if (nums[i] != i + 1) { return i + 1; } } @@ -141,12 +139,12 @@ public: func firstMissingPositive(nums []int) int { n := len(nums) for i := range nums { - for nums[i] >= 1 && nums[i] <= n && nums[i] != nums[nums[i]-1] { + for 0 < nums[i] && nums[i] <= n && nums[i] != nums[nums[i]-1] { nums[i], nums[nums[i]-1] = nums[nums[i]-1], nums[i] } } - for i, v := range nums { - if i+1 != v { + for i, x := range nums { + if x != i+1 { return i + 1 } } @@ -159,18 +157,18 @@ func firstMissingPositive(nums []int) int { ```ts function firstMissingPositive(nums: number[]): number { const n = nums.length; - let i = 0; - while (i < n) { - const j = nums[i] - 1; - if (j === i || j < 0 || j >= n || nums[i] === nums[j]) { - i++; - } else { + for (let i = 0; i < n; i++) { + while (nums[i] >= 1 && nums[i] <= n && nums[i] !== nums[nums[i] - 1]) { + const j = nums[i] - 1; [nums[i], nums[j]] = [nums[j], nums[i]]; } } - - const res = nums.findIndex((v, i) => v !== i + 1); - return (res === -1 ? n : res) + 1; + for (let i = 0; i < n; i++) { + if (nums[i] !== i + 1) { + return i + 1; + } + } + return n + 1; } ``` @@ -180,21 +178,18 @@ function firstMissingPositive(nums: number[]): number { impl Solution { pub fn first_missing_positive(mut nums: Vec) -> i32 { let n = nums.len(); - let mut i = 0; - while i < n { - let j = nums[i] - 1; - if (i as i32) == j || j < 0 || j >= (n as i32) || nums[i] == nums[j as usize] { - i += 1; - } else { - nums.swap(i, j as usize); + for i in 0..n { + while nums[i] > 0 && nums[i] <= n as i32 && nums[i] != nums[nums[i] as usize - 1] { + let j = nums[i] as usize - 1; + nums.swap(i, j); + } + } + for i in 0..n { + if nums[i] != (i + 1) as i32 { + return (i + 1) as i32; } } - (nums - .iter() - .enumerate() - .position(|(i, &v)| (v as usize) != i + 1) - .unwrap_or(n) as i32) - + 1 + return (n + 1) as i32; } } ``` @@ -231,23 +226,20 @@ public class Solution { ```c int firstMissingPositive(int* nums, int numsSize) { for (int i = 0; i < numsSize; ++i) { - while (nums[i] >= 1 && nums[i] <= numsSize && nums[i] != nums[nums[i] - 1]) { - swap(&nums[i], &nums[nums[i] - 1]); + while (nums[i] > 0 && nums[i] <= numsSize && nums[i] != nums[nums[i] - 1]) { + int j = nums[i] - 1; + int t = nums[i]; + nums[i] = nums[j]; + nums[j] = t; } } for (int i = 0; i < numsSize; ++i) { - if (i + 1 != nums[i]) { + if (nums[i] != i + 1) { return i + 1; } } return numsSize + 1; } - -void swap(int* a, int* b) { - int t = *a; - *a = *b; - *b = t; -} ``` #### PHP @@ -255,32 +247,24 @@ void swap(int* a, int* b) { ```php class Solution { /** - * @param integer[] $nums - * @return integer + * @param Integer[] $nums + * @return Integer */ - function firstMissingPositive($nums) { $n = count($nums); - - for ($i = 0; $i < $n; $i++) { - if ($nums[$i] <= 0) { - $nums[$i] = $n + 1; - } - } - for ($i = 0; $i < $n; $i++) { - $num = abs($nums[$i]); - if ($num <= $n) { - $nums[$num - 1] = -abs($nums[$num - 1]); + while ($nums[$i] >= 1 && $nums[$i] <= $n && $nums[$i] != $nums[$nums[$i] - 1]) { + $j = $nums[$i] - 1; + $t = $nums[$i]; + $nums[$i] = $nums[$j]; + $nums[$j] = $t; } } - for ($i = 0; $i < $n; $i++) { - if ($nums[$i] > 0) { + if ($nums[$i] != $i + 1) { return $i + 1; } } - return $n + 1; } } diff --git a/solution/0000-0099/0041.First Missing Positive/README_EN.md b/solution/0000-0099/0041.First Missing Positive/README_EN.md index cfebe29e8cf3f..e502e9179a7d5 100644 --- a/solution/0000-0099/0041.First Missing Positive/README_EN.md +++ b/solution/0000-0099/0041.First Missing Positive/README_EN.md @@ -75,15 +75,13 @@ The time complexity is $O(n)$, where $n$ is the length of the array. The space c ```python class Solution: def firstMissingPositive(self, nums: List[int]) -> int: - def swap(i, j): - nums[i], nums[j] = nums[j], nums[i] - n = len(nums) for i in range(n): while 1 <= nums[i] <= n and nums[i] != nums[nums[i] - 1]: - swap(i, nums[i] - 1) + j = nums[i] - 1 + nums[i], nums[j] = nums[j], nums[i] for i in range(n): - if i + 1 != nums[i]: + if nums[i] != i + 1: return i + 1 return n + 1 ``` @@ -95,12 +93,12 @@ class Solution { public int firstMissingPositive(int[] nums) { int n = nums.length; for (int i = 0; i < n; ++i) { - while (nums[i] >= 1 && nums[i] <= n && nums[i] != nums[nums[i] - 1]) { + while (nums[i] > 0 && nums[i] <= n && nums[i] != nums[nums[i] - 1]) { swap(nums, i, nums[i] - 1); } } for (int i = 0; i < n; ++i) { - if (i + 1 != nums[i]) { + if (nums[i] != i + 1) { return i + 1; } } @@ -123,12 +121,12 @@ public: int firstMissingPositive(vector& nums) { int n = nums.size(); for (int i = 0; i < n; ++i) { - while (nums[i] >= 1 && nums[i] <= n && nums[i] != nums[nums[i] - 1]) { + while (nums[i] > 0 && nums[i] <= n && nums[i] != nums[nums[i] - 1]) { swap(nums[i], nums[nums[i] - 1]); } } for (int i = 0; i < n; ++i) { - if (i + 1 != nums[i]) { + if (nums[i] != i + 1) { return i + 1; } } @@ -143,12 +141,12 @@ public: func firstMissingPositive(nums []int) int { n := len(nums) for i := range nums { - for nums[i] >= 1 && nums[i] <= n && nums[i] != nums[nums[i]-1] { + for 0 < nums[i] && nums[i] <= n && nums[i] != nums[nums[i]-1] { nums[i], nums[nums[i]-1] = nums[nums[i]-1], nums[i] } } - for i, v := range nums { - if i+1 != v { + for i, x := range nums { + if x != i+1 { return i + 1 } } @@ -161,18 +159,18 @@ func firstMissingPositive(nums []int) int { ```ts function firstMissingPositive(nums: number[]): number { const n = nums.length; - let i = 0; - while (i < n) { - const j = nums[i] - 1; - if (j === i || j < 0 || j >= n || nums[i] === nums[j]) { - i++; - } else { + for (let i = 0; i < n; i++) { + while (nums[i] >= 1 && nums[i] <= n && nums[i] !== nums[nums[i] - 1]) { + const j = nums[i] - 1; [nums[i], nums[j]] = [nums[j], nums[i]]; } } - - const res = nums.findIndex((v, i) => v !== i + 1); - return (res === -1 ? n : res) + 1; + for (let i = 0; i < n; i++) { + if (nums[i] !== i + 1) { + return i + 1; + } + } + return n + 1; } ``` @@ -182,21 +180,18 @@ function firstMissingPositive(nums: number[]): number { impl Solution { pub fn first_missing_positive(mut nums: Vec) -> i32 { let n = nums.len(); - let mut i = 0; - while i < n { - let j = nums[i] - 1; - if (i as i32) == j || j < 0 || j >= (n as i32) || nums[i] == nums[j as usize] { - i += 1; - } else { - nums.swap(i, j as usize); + for i in 0..n { + while nums[i] > 0 && nums[i] <= n as i32 && nums[i] != nums[nums[i] as usize - 1] { + let j = nums[i] as usize - 1; + nums.swap(i, j); + } + } + for i in 0..n { + if nums[i] != (i + 1) as i32 { + return (i + 1) as i32; } } - (nums - .iter() - .enumerate() - .position(|(i, &v)| (v as usize) != i + 1) - .unwrap_or(n) as i32) - + 1 + return (n + 1) as i32; } } ``` @@ -233,23 +228,20 @@ public class Solution { ```c int firstMissingPositive(int* nums, int numsSize) { for (int i = 0; i < numsSize; ++i) { - while (nums[i] >= 1 && nums[i] <= numsSize && nums[i] != nums[nums[i] - 1]) { - swap(&nums[i], &nums[nums[i] - 1]); + while (nums[i] > 0 && nums[i] <= numsSize && nums[i] != nums[nums[i] - 1]) { + int j = nums[i] - 1; + int t = nums[i]; + nums[i] = nums[j]; + nums[j] = t; } } for (int i = 0; i < numsSize; ++i) { - if (i + 1 != nums[i]) { + if (nums[i] != i + 1) { return i + 1; } } return numsSize + 1; } - -void swap(int* a, int* b) { - int t = *a; - *a = *b; - *b = t; -} ``` #### PHP @@ -257,32 +249,24 @@ void swap(int* a, int* b) { ```php class Solution { /** - * @param integer[] $nums - * @return integer + * @param Integer[] $nums + * @return Integer */ - function firstMissingPositive($nums) { $n = count($nums); - - for ($i = 0; $i < $n; $i++) { - if ($nums[$i] <= 0) { - $nums[$i] = $n + 1; - } - } - for ($i = 0; $i < $n; $i++) { - $num = abs($nums[$i]); - if ($num <= $n) { - $nums[$num - 1] = -abs($nums[$num - 1]); + while ($nums[$i] >= 1 && $nums[$i] <= $n && $nums[$i] != $nums[$nums[$i] - 1]) { + $j = $nums[$i] - 1; + $t = $nums[$i]; + $nums[$i] = $nums[$j]; + $nums[$j] = $t; } } - for ($i = 0; $i < $n; $i++) { - if ($nums[$i] > 0) { + if ($nums[$i] != $i + 1) { return $i + 1; } } - return $n + 1; } } diff --git a/solution/0000-0099/0041.First Missing Positive/Solution.c b/solution/0000-0099/0041.First Missing Positive/Solution.c index 750788f1bf5ec..70a286d26ab96 100644 --- a/solution/0000-0099/0041.First Missing Positive/Solution.c +++ b/solution/0000-0099/0041.First Missing Positive/Solution.c @@ -1,19 +1,16 @@ int firstMissingPositive(int* nums, int numsSize) { for (int i = 0; i < numsSize; ++i) { - while (nums[i] >= 1 && nums[i] <= numsSize && nums[i] != nums[nums[i] - 1]) { - swap(&nums[i], &nums[nums[i] - 1]); + while (nums[i] > 0 && nums[i] <= numsSize && nums[i] != nums[nums[i] - 1]) { + int j = nums[i] - 1; + int t = nums[i]; + nums[i] = nums[j]; + nums[j] = t; } } for (int i = 0; i < numsSize; ++i) { - if (i + 1 != nums[i]) { + if (nums[i] != i + 1) { return i + 1; } } return numsSize + 1; } - -void swap(int* a, int* b) { - int t = *a; - *a = *b; - *b = t; -} \ No newline at end of file diff --git a/solution/0000-0099/0041.First Missing Positive/Solution.cpp b/solution/0000-0099/0041.First Missing Positive/Solution.cpp index cc5a5c1174cf2..eed72308ef5e9 100644 --- a/solution/0000-0099/0041.First Missing Positive/Solution.cpp +++ b/solution/0000-0099/0041.First Missing Positive/Solution.cpp @@ -3,15 +3,15 @@ class Solution { int firstMissingPositive(vector& nums) { int n = nums.size(); for (int i = 0; i < n; ++i) { - while (nums[i] >= 1 && nums[i] <= n && nums[i] != nums[nums[i] - 1]) { + while (nums[i] > 0 && nums[i] <= n && nums[i] != nums[nums[i] - 1]) { swap(nums[i], nums[nums[i] - 1]); } } for (int i = 0; i < n; ++i) { - if (i + 1 != nums[i]) { + if (nums[i] != i + 1) { return i + 1; } } return n + 1; } -}; \ No newline at end of file +}; diff --git a/solution/0000-0099/0041.First Missing Positive/Solution.go b/solution/0000-0099/0041.First Missing Positive/Solution.go index ea7e5b11781d1..1a8e5cc2f6b25 100644 --- a/solution/0000-0099/0041.First Missing Positive/Solution.go +++ b/solution/0000-0099/0041.First Missing Positive/Solution.go @@ -1,14 +1,14 @@ func firstMissingPositive(nums []int) int { n := len(nums) for i := range nums { - for nums[i] >= 1 && nums[i] <= n && nums[i] != nums[nums[i]-1] { + for 0 < nums[i] && nums[i] <= n && nums[i] != nums[nums[i]-1] { nums[i], nums[nums[i]-1] = nums[nums[i]-1], nums[i] } } - for i, v := range nums { - if i+1 != v { + for i, x := range nums { + if x != i+1 { return i + 1 } } return n + 1 -} \ No newline at end of file +} diff --git a/solution/0000-0099/0041.First Missing Positive/Solution.java b/solution/0000-0099/0041.First Missing Positive/Solution.java index 56d06ab5f5102..8b64a24752f10 100644 --- a/solution/0000-0099/0041.First Missing Positive/Solution.java +++ b/solution/0000-0099/0041.First Missing Positive/Solution.java @@ -2,12 +2,12 @@ class Solution { public int firstMissingPositive(int[] nums) { int n = nums.length; for (int i = 0; i < n; ++i) { - while (nums[i] >= 1 && nums[i] <= n && nums[i] != nums[nums[i] - 1]) { + while (nums[i] > 0 && nums[i] <= n && nums[i] != nums[nums[i] - 1]) { swap(nums, i, nums[i] - 1); } } for (int i = 0; i < n; ++i) { - if (i + 1 != nums[i]) { + if (nums[i] != i + 1) { return i + 1; } } @@ -19,4 +19,4 @@ private void swap(int[] nums, int i, int j) { nums[i] = nums[j]; nums[j] = t; } -} \ No newline at end of file +} diff --git a/solution/0000-0099/0041.First Missing Positive/Solution.php b/solution/0000-0099/0041.First Missing Positive/Solution.php index f3aa6b8576f47..231c23825fd51 100644 --- a/solution/0000-0099/0041.First Missing Positive/Solution.php +++ b/solution/0000-0099/0041.First Missing Positive/Solution.php @@ -1,31 +1,23 @@ class Solution { /** - * @param integer[] $nums - * @return integer + * @param Integer[] $nums + * @return Integer */ - function firstMissingPositive($nums) { $n = count($nums); - for ($i = 0; $i < $n; $i++) { - if ($nums[$i] <= 0) { - $nums[$i] = $n + 1; + while ($nums[$i] >= 1 && $nums[$i] <= $n && $nums[$i] != $nums[$nums[$i] - 1]) { + $j = $nums[$i] - 1; + $t = $nums[$i]; + $nums[$i] = $nums[$j]; + $nums[$j] = $t; } } - for ($i = 0; $i < $n; $i++) { - $num = abs($nums[$i]); - if ($num <= $n) { - $nums[$num - 1] = -abs($nums[$num - 1]); - } - } - - for ($i = 0; $i < $n; $i++) { - if ($nums[$i] > 0) { + if ($nums[$i] != $i + 1) { return $i + 1; } } - return $n + 1; } } diff --git a/solution/0000-0099/0041.First Missing Positive/Solution.py b/solution/0000-0099/0041.First Missing Positive/Solution.py index 8e39d1fb22a3d..6b61db4b6b7df 100644 --- a/solution/0000-0099/0041.First Missing Positive/Solution.py +++ b/solution/0000-0099/0041.First Missing Positive/Solution.py @@ -1,13 +1,11 @@ class Solution: def firstMissingPositive(self, nums: List[int]) -> int: - def swap(i, j): - nums[i], nums[j] = nums[j], nums[i] - n = len(nums) for i in range(n): while 1 <= nums[i] <= n and nums[i] != nums[nums[i] - 1]: - swap(i, nums[i] - 1) + j = nums[i] - 1 + nums[i], nums[j] = nums[j], nums[i] for i in range(n): - if i + 1 != nums[i]: + if nums[i] != i + 1: return i + 1 return n + 1 diff --git a/solution/0000-0099/0041.First Missing Positive/Solution.rs b/solution/0000-0099/0041.First Missing Positive/Solution.rs index ba6dfba223149..1e12ae2a0ebe3 100644 --- a/solution/0000-0099/0041.First Missing Positive/Solution.rs +++ b/solution/0000-0099/0041.First Missing Positive/Solution.rs @@ -1,20 +1,17 @@ impl Solution { pub fn first_missing_positive(mut nums: Vec) -> i32 { let n = nums.len(); - let mut i = 0; - while i < n { - let j = nums[i] - 1; - if (i as i32) == j || j < 0 || j >= (n as i32) || nums[i] == nums[j as usize] { - i += 1; - } else { - nums.swap(i, j as usize); + for i in 0..n { + while nums[i] > 0 && nums[i] <= n as i32 && nums[i] != nums[nums[i] as usize - 1] { + let j = nums[i] as usize - 1; + nums.swap(i, j); } } - (nums - .iter() - .enumerate() - .position(|(i, &v)| (v as usize) != i + 1) - .unwrap_or(n) as i32) - + 1 + for i in 0..n { + if nums[i] != (i + 1) as i32 { + return (i + 1) as i32; + } + } + return (n + 1) as i32; } } diff --git a/solution/0000-0099/0041.First Missing Positive/Solution.ts b/solution/0000-0099/0041.First Missing Positive/Solution.ts index e2ce77f09daa6..533308ad94a27 100644 --- a/solution/0000-0099/0041.First Missing Positive/Solution.ts +++ b/solution/0000-0099/0041.First Missing Positive/Solution.ts @@ -1,15 +1,15 @@ function firstMissingPositive(nums: number[]): number { const n = nums.length; - let i = 0; - while (i < n) { - const j = nums[i] - 1; - if (j === i || j < 0 || j >= n || nums[i] === nums[j]) { - i++; - } else { + for (let i = 0; i < n; i++) { + while (nums[i] >= 1 && nums[i] <= n && nums[i] !== nums[nums[i] - 1]) { + const j = nums[i] - 1; [nums[i], nums[j]] = [nums[j], nums[i]]; } } - - const res = nums.findIndex((v, i) => v !== i + 1); - return (res === -1 ? n : res) + 1; + for (let i = 0; i < n; i++) { + if (nums[i] !== i + 1) { + return i + 1; + } + } + return n + 1; } diff --git a/solution/0100-0199/0189.Rotate Array/README.md b/solution/0100-0199/0189.Rotate Array/README.md index 0a4691e77372a..2df8936c30d54 100644 --- a/solution/0100-0199/0189.Rotate Array/README.md +++ b/solution/0100-0199/0189.Rotate Array/README.md @@ -38,7 +38,7 @@ tags: 
 输入：nums = [-1,-100,3,99], k = 2
 输出：[3,99,-1,-100]
-解释: 
+解释:
 向右轮转 1 步: [99,-1,-100,3]
 向右轮转 2 步: [3,99,-1,-100]
@@ -248,23 +248,4 @@ public class Solution { - - -### 方法二 - - - -#### Python3 - -```python -class Solution: - def rotate(self, nums: List[int], k: int) -> None: - k %= len(nums) - nums[:] = nums[-k:] + nums[:-k] -``` - - - - - diff --git a/solution/0100-0199/0189.Rotate Array/README_EN.md b/solution/0100-0199/0189.Rotate Array/README_EN.md index 0ef0680cd0580..4779681289ac7 100644 --- a/solution/0100-0199/0189.Rotate Array/README_EN.md +++ b/solution/0100-0199/0189.Rotate Array/README_EN.md @@ -37,7 +37,7 @@ rotate 3 steps to the right: [5,6,7,1,2,3,4] 
 Input: nums = [-1,-100,3,99], k = 2
 Output: [3,99,-1,-100]
-Explanation: 
+Explanation:
 rotate 1 steps to the right: [99,-1,-100,3]
 rotate 2 steps to the right: [3,99,-1,-100]
@@ -246,23 +246,4 @@ public class Solution { - - -### Solution 2 - - - -#### Python3 - -```python -class Solution: - def rotate(self, nums: List[int], k: int) -> None: - k %= len(nums) - nums[:] = nums[-k:] + nums[:-k] -``` - - - - - diff --git a/solution/0100-0199/0189.Rotate Array/Solution2.py b/solution/0100-0199/0189.Rotate Array/Solution2.py deleted file mode 100644 index 2ca1930ff6c1f..0000000000000 --- a/solution/0100-0199/0189.Rotate Array/Solution2.py +++ /dev/null @@ -1,4 +0,0 @@ -class Solution: - def rotate(self, nums: List[int], k: int) -> None: - k %= len(nums) - nums[:] = nums[-k:] + nums[:-k] diff --git a/solution/0200-0299/0238.Product of Array Except Self/README.md b/solution/0200-0299/0238.Product of Array Except Self/README.md index 1009191a4a33e..67da7fdbca128 100644 --- a/solution/0200-0299/0238.Product of Array Except Self/README.md +++ b/solution/0200-0299/0238.Product of Array Except Self/README.md @@ -61,15 +61,15 @@ tags: ### 方法一：两次遍历 -我们定义两个变量 $left$ 和 $right$，分别表示当前元素左边所有元素的乘积和右边所有元素的乘积。初始时 $left=1$, $right=1$。定义一个长度为 $n$ 的答案数组 $ans$。 +我们定义两个变量 $\textit{left}$ 和 $\textit{right}$，分别表示当前元素左边所有元素的乘积和右边所有元素的乘积。初始时 $\textit{left}=1$, $\textit{right}=1$。定义一个长度为 $n$ 的答案数组 $\textit{ans}$。 -我们先从左到右遍历数组，对于遍历到的第 $i$ 个元素，我们用 $left$ 更新 $ans[i]$，然后 $left$ 乘以 $nums[i]$。 +我们先从左到右遍历数组，对于遍历到的第 $i$ 个元素，我们用 $\textit{left}$ 更新 $\textit{ans}[i]$，然后 $\textit{left}$ 乘以 $\textit{nums}[i]$。 -然后，我们从右到左遍历数组，对于遍历到的第 $i$ 个元素，我们更新 $ans[i]$ 为 $ans[i] \times right$，然后 $right$ 乘以 $nums[i]$。 +然后，我们从右到左遍历数组，对于遍历到的第 $i$ 个元素，我们更新 $\textit{ans}[i]$ 为 $\textit{ans}[i] \times \textit{right}$，然后 $\textit{right}$ 乘以 $\textit{nums}[i]$。 -遍历结束后，数组 `ans` 即为所求的答案。 +遍历结束后，返回答案数组 $\textit{ans}$。 -时间复杂度 $O(n)$，其中 $n$ 是数组 `nums` 的长度。忽略答案数组的空间消耗，空间复杂度 $O(1)$。 +时间复杂度 $O(n)$，其中 $n$ 是数组 $\textit{nums}$ 的长度。忽略答案数组的空间消耗，空间复杂度 $O(1)$。 @@ -258,22 +258,4 @@ class Solution { - - -### 方法二 - - - -#### TypeScript - -```ts -function productExceptSelf(nums: number[]): number[] { - return nums.map((_, i) => nums.reduce((pre, val, j) => pre * (i === j ? 1 : val), 1)); -} -``` - - - - - diff --git a/solution/0200-0299/0238.Product of Array Except Self/README_EN.md b/solution/0200-0299/0238.Product of Array Except Self/README_EN.md index 646950a83f675..abee0cb2371b0 100644 --- a/solution/0200-0299/0238.Product of Array Except Self/README_EN.md +++ b/solution/0200-0299/0238.Product of Array Except Self/README_EN.md @@ -51,15 +51,15 @@ tags: ### Solution 1: Two Passes -We define two variables $left$ and $right$, which represent the product of all elements to the left and right of the current element respectively. Initially, $left=1$, $right=1$. Define an answer array $ans$ of length $n$. +We define two variables $\textit{left}$ and $\textit{right}$ to represent the product of all elements to the left and right of the current element, respectively. Initially, $\textit{left} = 1$ and $\textit{right} = 1$. We define an answer array $\textit{ans}$ of length $n$. -We first traverse the array from left to right, for the $i$th element we update $ans[i]$ with $left$, then $left$ multiplied by $nums[i]$. +First, we traverse the array from left to right. For the $i$-th element, we update $\textit{ans}[i]$ with $\textit{left}$, then multiply $\textit{left}$ by $\textit{nums}[i]$. -Then, we traverse the array from right to left, for the $i$th element, we update $ans[i]$ to $ans[i] \times right$, then $right$ multiplied by $nums[i]$. +Next, we traverse the array from right to left. For the $i$-th element, we update $\textit{ans}[i]$ to $\textit{ans}[i] \times \textit{right}$, then multiply $\textit{right}$ by $\textit{nums}[i]$. -After the traversal, the array `ans` is the answer. +After the traversal, we return the answer array $\textit{ans}$. -The time complexity is $O(n)$, where $n$ is the length of the array `nums`. Ignore the space consumption of the answer array, the space complexity is $O(1)$. +The time complexity is $O(n)$, where $n$ is the length of the array $\textit{nums}$. Ignoring the space consumption of the answer array, the space complexity is $O(1)$. @@ -248,22 +248,4 @@ class Solution { - - -### Solution 2 - - - -#### TypeScript - -```ts -function productExceptSelf(nums: number[]): number[] { - return nums.map((_, i) => nums.reduce((pre, val, j) => pre * (i === j ? 1 : val), 1)); -} -``` - - - - - diff --git a/solution/0200-0299/0238.Product of Array Except Self/Solution2.ts b/solution/0200-0299/0238.Product of Array Except Self/Solution2.ts deleted file mode 100644 index 312ea12c153ab..0000000000000 --- a/solution/0200-0299/0238.Product of Array Except Self/Solution2.ts +++ /dev/null @@ -1,3 +0,0 @@ -function productExceptSelf(nums: number[]): number[] { - return nums.map((_, i) => nums.reduce((pre, val, j) => pre * (i === j ? 1 : val), 1)); -}