+ 
-
+
- 
- 
+ 
+ 
- 
-
+
-
-
-
-> "_You help the developer community practice for interviews, and there is nothing better we could ask for._" -- [Alan Yessenbayev](https://opencollective.com/alan-yessenbayev)
-
-## 推荐者
-
-知名互联网科技博主 [@爱可可-爱生活](https://weibo.com/fly51fly) 微博推荐。
-
-
-
## 版权
本项目著作权归 [GitHub 开源社区 Doocs](https://github.com/doocs) 所有，商业转载请联系 @yanglbme 获得授权，非商业转载请注明出处。
-## 联系我们
+## 联系我们 & 支持项目
欢迎各位小伙伴们添加 @yanglbme 的个人微信（微信号：YLB0109），备注 「**leetcode**」。后续我们会创建算法、技术相关的交流群，大家一起交流学习，分享经验，共同进步。
-| 
|
-| ------------------------------------------------------------------------------------------------------------------------------ |
+如果你觉得这个项目对你有帮助，也欢迎通过微信扫码赞赏我们 ☕️～
+
+| | 
|
+| -------------------------------------------------------------------------------------------------------------------------------- | ------------------------------------------------------------------------------------------------------------------------------------- |
## 许可证
diff --git a/README_EN.md b/README_EN.md
index d81be5f48286a..3b461059720a9 100644
--- a/README_EN.md
+++ b/README_EN.md
@@ -1,15 +1,16 @@
-
+
-
-
+
+
-
-
+
-
-
-
-> "_You help the developer community practice for interviews, and there is nothing better we could ask for._" -- [Alan Yessenbayev](https://opencollective.com/alan-yessenbayev)
-
## Copyright
The copyright of this project belongs to [Doocs](https://github.com/doocs) community. For commercial reprints, please contact [@yanglbme](mailto:contact@yanglibin.info) for authorization. For non-commercial reprints, please indicate the source.
+## Support Us
+
+If you find this project helpful, consider supporting us by buying us a coffee ☕️
+👉 [https://paypal.me/yanglbme](https://paypal.me/yanglbme)
+
## Contact Us
We welcome everyone to add @yanglbme's personal WeChat (WeChat ID: YLB0109), with the note "leetcode". In the future, we will create algorithm and technology related discussion groups, where we can learn and share experiences together, and make progress together.
diff --git a/images/doocs-leetcode.png b/images/doocs-leetcode.png
index 8a7f55f6253a6..a69e814914b16 100644
Binary files a/images/doocs-leetcode.png and b/images/doocs-leetcode.png differ
diff --git a/images/favicon-16x16.png b/images/favicon-16x16.png
deleted file mode 100644
index c846c93f0a389..0000000000000
Binary files a/images/favicon-16x16.png and /dev/null differ
diff --git a/images/favicon-32x32.png b/images/favicon-32x32.png
deleted file mode 100644
index 2d79130a1a393..0000000000000
Binary files a/images/favicon-32x32.png and /dev/null differ
diff --git a/images/leetcode-doocs.png b/images/leetcode-doocs.png
index 616eea1c01815..a69e814914b16 100644
Binary files a/images/leetcode-doocs.png and b/images/leetcode-doocs.png differ
diff --git a/images/pr-en.svg b/images/pr-en.svg
new file mode 100644
index 0000000000000..7465d268ffbf0
--- /dev/null
+++ b/images/pr-en.svg
@@ -0,0 +1 @@
+
\ No newline at end of file
diff --git a/images/pr.svg b/images/pr.svg
new file mode 100644
index 0000000000000..22e333230e98e
--- /dev/null
+++ b/images/pr.svg
@@ -0,0 +1 @@
+
\ No newline at end of file
diff --git a/images/starcharts.svg b/images/starcharts.svg
index bbb584e034369..fa40a02040215 100644
--- a/images/starcharts.svg
+++ b/images/starcharts.svg
@@ -1,4 +1,4 @@
-
+
\ No newline at end of file
+L 950 15
+L 950 15
+L 950 15
+L 950 15
+L 950 15
+L 950 15
+L 950 15
+L 950 15
+L 950 15
+L 950 15
+L 950 15
+L 950 15
+L 950 15
+L 950 15
+L 950 15
+L 950 15
+L 950 15
+L 950 15
+L 950 15
+L 950 15
+L 950 15
+L 950 15
+L 950 15
+L 950 15
+L 950 15" style="stroke-width:2;stroke:rgba(129,199,239,1.0);fill:none"/>
\ No newline at end of file
diff --git a/images/support1.jpg b/images/support1.jpg
new file mode 100644
index 0000000000000..5d476dd5a74c4
Binary files /dev/null and b/images/support1.jpg differ
diff --git a/lcci/01.01.Is Unique/README.md b/lcci/01.01.Is Unique/README.md
index e8f0aafbf7165..013967f04e16f 100644
--- a/lcci/01.01.Is Unique/README.md
+++ b/lcci/01.01.Is Unique/README.md
@@ -19,7 +19,7 @@ edit_url: https://github.com/doocs/leetcode/edit/main/lcci/01.01.Is%20Unique/REA
示例 1：
输入: s = "leetcode" -输出: false +输出: false
示例 2：
@@ -56,8 +56,7 @@ edit_url: https://github.com/doocs/leetcode/edit/main/lcci/01.01.Is%20Unique/REA class Solution: def isUnique(self, astr: str) -> bool: mask = 0 - for c in astr: - i = ord(c) - ord('a') + for i in map(lambda c: ord(c) - ord("a"), astr): if (mask >> i) & 1: return False mask |= 1 << i diff --git a/lcci/01.01.Is Unique/README_EN.md b/lcci/01.01.Is Unique/README_EN.md index 86501a1e6e8e5..a63cf58656329 100644 --- a/lcci/01.01.Is Unique/README_EN.md +++ b/lcci/01.01.Is Unique/README_EN.md @@ -64,8 +64,7 @@ The time complexity is $O(n)$, where $n$ is the length of the string. The space class Solution: def isUnique(self, astr: str) -> bool: mask = 0 - for c in astr: - i = ord(c) - ord('a') + for i in map(lambda c: ord(c) - ord("a"), astr): if (mask >> i) & 1: return False mask |= 1 << i diff --git a/lcci/01.01.Is Unique/Solution.py b/lcci/01.01.Is Unique/Solution.py index 1d63247d2b3a0..06482062b2939 100644 --- a/lcci/01.01.Is Unique/Solution.py +++ b/lcci/01.01.Is Unique/Solution.py @@ -1,8 +1,7 @@ class Solution: def isUnique(self, astr: str) -> bool: mask = 0 - for c in astr: - i = ord(c) - ord('a') + for i in map(lambda c: ord(c) - ord("a"), astr): if (mask >> i) & 1: return False mask |= 1 << i diff --git a/lcci/01.02.Check Permutation/README.md b/lcci/01.02.Check Permutation/README.md index db958faa9953e..786b5c7538b57 100644 --- a/lcci/01.02.Check Permutation/README.md +++ b/lcci/01.02.Check Permutation/README.md @@ -93,11 +93,18 @@ class Solution { class Solution { public: bool CheckPermutation(string s1, string s2) { - if (s1.size() != s2.size()) return false; - int cnt[26] = {0}; - for (char& c : s1) ++cnt[c - 'a']; - for (char& c : s2) - if (--cnt[c - 'a'] < 0) return false; + if (s1.size() != s2.size()) { + return false; + } + int cnt[26]{}; + for (char c : s1) { + ++cnt[c - 'a']; + } + for (char c : s2) { + if (--cnt[c - 'a'] < 0) { + return false; + } + } return true; } }; @@ -115,8 +122,7 @@ func CheckPermutation(s1 string, s2 string) bool { cnt[c-'a']++ } for _, c := range s2 { - cnt[c-'a']-- - if cnt[c-'a'] < 0 { + if cnt[c-'a']--; cnt[c-'a'] < 0 { return false } } @@ -128,20 +134,18 @@ func CheckPermutation(s1 string, s2 string) bool { ```ts function CheckPermutation(s1: string, s2: string): boolean { - const n = s1.length; - const m = s2.length; - if (n !== m) { + if (s1.length !== s2.length) { return false; } - const map = new Map设想有个机器人坐在一个网格的左上角，网格 r 行 c 列。机器人只能向下或向右移动，但不能走到一些被禁止的网格（有障碍物）。设计一种算法，寻找机器人从左上角移动到右下角的路径。
+  +网格中的障碍物和空位置分别用 1 和 0 来表示。
返回一条可行的路径，路径由经过的网格的行号和列号组成。左上角为 0 行 0 列。
示例 1:
@@ -26,7 +28,7 @@ edit_url: https://github.com/doocs/leetcode/edit/main/lcci/08.02.Robot%20in%20a% [0,0,0] ] 输出: [[0,0],[0,1],[0,2],[1,2],[2,2]] -解释: +解释: 输入中标粗的位置即为输出表示的路径，即 0行0列（左上角） -> 0行1列 -> 0行2列 -> 1行2列 -> 2行2列（右下角）说明：r 和 c 的值均不超过 100。
@@ -107,7 +109,7 @@ public: int m = obstacleGrid.size(); int n = obstacleGrid[0].size(); vectorImagine a robot sitting on the upper left corner of grid with r rows and c columns. The robot can only move in two directions, right and down, but certain cells are "off limits" such that the robot cannot step on them. Design an algorithm to find a path for the robot from the top left to the bottom right.
+  +"off limits" and empty grid are represented by 1 and 0 respectively.
Return a valid path, consisting of row number and column number of grids in the path.
Example 1:
@@ -116,7 +118,7 @@ public: int m = obstacleGrid.size(); int n = obstacleGrid[0].size(); vectorGiven a string s, find the length of the longest substring without repeating characters.
Given a string s, find the length of the longest substring without duplicate characters.
Example 1:
@@ -298,6 +298,33 @@ class Solution { } ``` +#### C + +```c +int lengthOfLongestSubstring(char* s) { + int freq[256] = {0}; + int l = 0, r = 0; + int ans = 0; + int len = strlen(s); + + for (r = 0; r < len; r++) { + char c = s[r]; + freq[(unsigned char) c]++; + + while (freq[(unsigned char) c] > 1) { + freq[(unsigned char) s[l]]--; + l++; + } + + if (ans < r - l + 1) { + ans = r - l + 1; + } + } + + return ans; +} +``` + diff --git a/solution/0000-0099/0003.Longest Substring Without Repeating Characters/Solution.c b/solution/0000-0099/0003.Longest Substring Without Repeating Characters/Solution.c new file mode 100644 index 0000000000000..673e098af92ac --- /dev/null +++ b/solution/0000-0099/0003.Longest Substring Without Repeating Characters/Solution.c @@ -0,0 +1,22 @@ +int lengthOfLongestSubstring(char* s) { + int freq[256] = {0}; + int l = 0, r = 0; + int ans = 0; + int len = strlen(s); + + for (r = 0; r < len; r++) { + char c = s[r]; + freq[(unsigned char) c]++; + + while (freq[(unsigned char) c] > 1) { + freq[(unsigned char) s[l]]--; + l++; + } + + if (ans < r - l + 1) { + ans = r - l + 1; + } + } + + return ans; +} diff --git a/solution/0000-0099/0004.Median of Two Sorted Arrays/README.md b/solution/0000-0099/0004.Median of Two Sorted Arrays/README.md index a0c5af52f0caa..b6a21c5b7e751 100644 --- a/solution/0000-0099/0004.Median of Two Sorted Arrays/README.md +++ b/solution/0000-0099/0004.Median of Two Sorted Arrays/README.md @@ -350,6 +350,36 @@ proc medianOfTwoSortedArrays(nums1: seq[int], nums2: seq[int]): float = # echo medianOfTwoSortedArrays(arrA, arrB) ``` +#### C + +```c +int findKth(int* nums1, int m, int i, int* nums2, int n, int j, int k) { + if (i >= m) + return nums2[j + k - 1]; + if (j >= n) + return nums1[i + k - 1]; + if (k == 1) + return nums1[i] < nums2[j] ? nums1[i] : nums2[j]; + + int p = k / 2; + + int x = (i + p - 1 < m) ? nums1[i + p - 1] : INT_MAX; + int y = (j + p - 1 < n) ? nums2[j + p - 1] : INT_MAX; + + if (x < y) + return findKth(nums1, m, i + p, nums2, n, j, k - p); + else + return findKth(nums1, m, i, nums2, n, j + p, k - p); +} + +double findMedianSortedArrays(int* nums1, int m, int* nums2, int n) { + int total = m + n; + int a = findKth(nums1, m, 0, nums2, n, 0, (total + 1) / 2); + int b = findKth(nums1, m, 0, nums2, n, 0, (total + 2) / 2); + return (a + b) / 2.0; +} +``` + diff --git a/solution/0000-0099/0004.Median of Two Sorted Arrays/README_EN.md b/solution/0000-0099/0004.Median of Two Sorted Arrays/README_EN.md index 15b73ee6ff6f0..2896e96ddc3af 100644 --- a/solution/0000-0099/0004.Median of Two Sorted Arrays/README_EN.md +++ b/solution/0000-0099/0004.Median of Two Sorted Arrays/README_EN.md @@ -346,6 +346,36 @@ proc medianOfTwoSortedArrays(nums1: seq[int], nums2: seq[int]): float = # echo medianOfTwoSortedArrays(arrA, arrB) ``` +#### C + +```c +int findKth(int* nums1, int m, int i, int* nums2, int n, int j, int k) { + if (i >= m) + return nums2[j + k - 1]; + if (j >= n) + return nums1[i + k - 1]; + if (k == 1) + return nums1[i] < nums2[j] ? nums1[i] : nums2[j]; + + int p = k / 2; + + int x = (i + p - 1 < m) ? nums1[i + p - 1] : INT_MAX; + int y = (j + p - 1 < n) ? nums2[j + p - 1] : INT_MAX; + + if (x < y) + return findKth(nums1, m, i + p, nums2, n, j, k - p); + else + return findKth(nums1, m, i, nums2, n, j + p, k - p); +} + +double findMedianSortedArrays(int* nums1, int m, int* nums2, int n) { + int total = m + n; + int a = findKth(nums1, m, 0, nums2, n, 0, (total + 1) / 2); + int b = findKth(nums1, m, 0, nums2, n, 0, (total + 2) / 2); + return (a + b) / 2.0; +} +``` + diff --git a/solution/0000-0099/0004.Median of Two Sorted Arrays/Solution.c b/solution/0000-0099/0004.Median of Two Sorted Arrays/Solution.c new file mode 100644 index 0000000000000..2786c7ef9bfd8 --- /dev/null +++ b/solution/0000-0099/0004.Median of Two Sorted Arrays/Solution.c @@ -0,0 +1,25 @@ +int findKth(int* nums1, int m, int i, int* nums2, int n, int j, int k) { + if (i >= m) + return nums2[j + k - 1]; + if (j >= n) + return nums1[i + k - 1]; + if (k == 1) + return nums1[i] < nums2[j] ? nums1[i] : nums2[j]; + + int p = k / 2; + + int x = (i + p - 1 < m) ? nums1[i + p - 1] : INT_MAX; + int y = (j + p - 1 < n) ? nums2[j + p - 1] : INT_MAX; + + if (x < y) + return findKth(nums1, m, i + p, nums2, n, j, k - p); + else + return findKth(nums1, m, i, nums2, n, j + p, k - p); +} + +double findMedianSortedArrays(int* nums1, int m, int* nums2, int n) { + int total = m + n; + int a = findKth(nums1, m, 0, nums2, n, 0, (total + 1) / 2); + int b = findKth(nums1, m, 0, nums2, n, 0, (total + 2) / 2); + return (a + b) / 2.0; +} diff --git a/solution/0000-0099/0005.Longest Palindromic Substring/README.md b/solution/0000-0099/0005.Longest Palindromic Substring/README.md index 407fd7e12412c..c6c52ab64cd4f 100644 --- a/solution/0000-0099/0005.Longest Palindromic Substring/README.md +++ b/solution/0000-0099/0005.Longest Palindromic Substring/README.md @@ -277,6 +277,42 @@ public class Solution { } ``` +#### C + +```c +char* longestPalindrome(char* s) { + int n = strlen(s); + bool** f = (bool**) malloc(n * sizeof(bool*)); + for (int i = 0; i < n; ++i) { + f[i] = (bool*) malloc(n * sizeof(bool)); + for (int j = 0; j < n; ++j) { + f[i][j] = true; + } + } + int k = 0, mx = 1; + for (int i = n - 2; ~i; --i) { + for (int j = i + 1; j < n; ++j) { + f[i][j] = false; + if (s[i] == s[j]) { + f[i][j] = f[i + 1][j - 1]; + if (f[i][j] && mx < j - i + 1) { + mx = j - i + 1; + k = i; + } + } + } + } + char* res = (char*) malloc((mx + 1) * sizeof(char)); + strncpy(res, s + k, mx); + res[mx] = '\0'; + for (int i = 0; i < n; ++i) { + free(f[i]); + } + free(f); + return res; +} +``` + #### Nim ```nim @@ -456,6 +492,39 @@ impl Solution { } ``` +#### C# + +```cs +public class Solution { + private string s; + private int n; + + public String LongestPalindrome(string s) { + this.s = s; + n = s.Length; + int start = 0, mx = 1; + for (int i = 0; i < n; ++i) { + int a = F(i, i); + int b = F(i, i + 1); + int t = Math.Max(a, b); + if (mx < t) { + mx = t; + start = i - ((t - 1) >> 1); + } + } + return s.Substring(start, start + mx); + } + + private int F(int l, int r) { + while (l >= 0 && r < n && s[l] == s[r]) { + --l; + ++r; + } + return r - l - 1; + } +} +``` + #### PHP ```php diff --git a/solution/0000-0099/0005.Longest Palindromic Substring/README_EN.md b/solution/0000-0099/0005.Longest Palindromic Substring/README_EN.md index 895bbb34ed3ff..e317ceda58ac4 100644 --- a/solution/0000-0099/0005.Longest Palindromic Substring/README_EN.md +++ b/solution/0000-0099/0005.Longest Palindromic Substring/README_EN.md @@ -275,6 +275,42 @@ public class Solution { } ``` +#### C + +```c +char* longestPalindrome(char* s) { + int n = strlen(s); + bool** f = (bool**) malloc(n * sizeof(bool*)); + for (int i = 0; i < n; ++i) { + f[i] = (bool*) malloc(n * sizeof(bool)); + for (int j = 0; j < n; ++j) { + f[i][j] = true; + } + } + int k = 0, mx = 1; + for (int i = n - 2; ~i; --i) { + for (int j = i + 1; j < n; ++j) { + f[i][j] = false; + if (s[i] == s[j]) { + f[i][j] = f[i + 1][j - 1]; + if (f[i][j] && mx < j - i + 1) { + mx = j - i + 1; + k = i; + } + } + } + } + char* res = (char*) malloc((mx + 1) * sizeof(char)); + strncpy(res, s + k, mx); + res[mx] = '\0'; + for (int i = 0; i < n; ++i) { + free(f[i]); + } + free(f); + return res; +} +``` + #### Nim ```nim @@ -454,6 +490,39 @@ impl Solution { } ``` +#### C# + +```cs +public class Solution { + private string s; + private int n; + + public String LongestPalindrome(string s) { + this.s = s; + n = s.Length; + int start = 0, mx = 1; + for (int i = 0; i < n; ++i) { + int a = F(i, i); + int b = F(i, i + 1); + int t = Math.Max(a, b); + if (mx < t) { + mx = t; + start = i - ((t - 1) >> 1); + } + } + return s.Substring(start, start + mx); + } + + private int F(int l, int r) { + while (l >= 0 && r < n && s[l] == s[r]) { + --l; + ++r; + } + return r - l - 1; + } +} +``` + #### PHP ```php diff --git a/solution/0000-0099/0005.Longest Palindromic Substring/Solution.c b/solution/0000-0099/0005.Longest Palindromic Substring/Solution.c new file mode 100644 index 0000000000000..e5a88d6c8c467 --- /dev/null +++ b/solution/0000-0099/0005.Longest Palindromic Substring/Solution.c @@ -0,0 +1,31 @@ +char* longestPalindrome(char* s) { + int n = strlen(s); + bool** f = (bool**) malloc(n * sizeof(bool*)); + for (int i = 0; i < n; ++i) { + f[i] = (bool*) malloc(n * sizeof(bool)); + for (int j = 0; j < n; ++j) { + f[i][j] = true; + } + } + int k = 0, mx = 1; + for (int i = n - 2; ~i; --i) { + for (int j = i + 1; j < n; ++j) { + f[i][j] = false; + if (s[i] == s[j]) { + f[i][j] = f[i + 1][j - 1]; + if (f[i][j] && mx < j - i + 1) { + mx = j - i + 1; + k = i; + } + } + } + } + char* res = (char*) malloc((mx + 1) * sizeof(char)); + strncpy(res, s + k, mx); + res[mx] = '\0'; + for (int i = 0; i < n; ++i) { + free(f[i]); + } + free(f); + return res; +} diff --git a/solution/0000-0099/0005.Longest Palindromic Substring/Solution2.cs b/solution/0000-0099/0005.Longest Palindromic Substring/Solution2.cs new file mode 100644 index 0000000000000..48e1cf8b8e46c --- /dev/null +++ b/solution/0000-0099/0005.Longest Palindromic Substring/Solution2.cs @@ -0,0 +1,28 @@ +public class Solution { + private string s; + private int n; + + public String LongestPalindrome(string s) { + this.s = s; + n = s.Length; + int start = 0, mx = 1; + for (int i = 0; i < n; ++i) { + int a = F(i, i); + int b = F(i, i + 1); + int t = Math.Max(a, b); + if (mx < t) { + mx = t; + start = i - ((t - 1) >> 1); + } + } + return s.Substring(start, start + mx); + } + + private int F(int l, int r) { + while (l >= 0 && r < n && s[l] == s[r]) { + --l; + ++r; + } + return r - l - 1; + } +} \ No newline at end of file diff --git a/solution/0000-0099/0006.Zigzag Conversion/README.md b/solution/0000-0099/0006.Zigzag Conversion/README.md index c12bad03a22aa..ee8279b690b66 100644 --- a/solution/0000-0099/0006.Zigzag Conversion/README.md +++ b/solution/0000-0099/0006.Zigzag Conversion/README.md @@ -78,9 +78,9 @@ P I ### 方法一：模拟 -我们用一个二维数组 $g$ 来模拟 $Z$ 字形排列的过程，其中 $g[i][j]$ 表示第 $i$ 行第 $j$ 列的字符。初始时 $i=0$，另外我们定义一个方向变量 $k$，初始时 $k=-1$，表示向上走。 +我们用一个二维数组 $g$ 来模拟 Z 字形排列的过程，其中 $g[i][j]$ 表示第 $i$ 行第 $j$ 列的字符。初始时 $i = 0$，另外我们定义一个方向变量 $k$，初始时 $k = -1$，表示向上走。 -我们从左到右遍历字符串 $s$，每次遍历到一个字符 $c$，将其追加到 $g[i]$ 中，如果此时 $i=0$ 或者 $i=numRows-1$，说明当前字符位于 $Z$ 字形排列的拐点，我们将 $k$ 的值反转，即 $k=-k$。接下来，我们将 $i$ 的值更新为 $i+k$，即向上或向下移动一行。继续遍历下一个字符，直到遍历完字符串 $s$，我们返回 $g$ 中所有行拼接后的字符串即可。 +我们从左到右遍历字符串 $s$，每次遍历到一个字符 $c$，将其追加到 $g[i]$ 中。如果此时 $i = 0$ 或者 $i = \textit{numRows} - 1$，说明当前字符位于 Z 字形排列的拐点，我们将 $k$ 的值反转，即 $k = -k$。接下来，我们将 $i$ 的值更新为 $i + k$，即向上或向下移动一行。继续遍历下一个字符，直到遍历完字符串 $s$，我们返回 $g$ 中所有行拼接后的字符串即可。 时间复杂度 $O(n)$，空间复杂度 $O(n)$。其中 $n$ 为字符串 $s$ 的长度。 @@ -199,29 +199,24 @@ function convert(s: string, numRows: number): string { ```rust impl Solution { pub fn convert(s: String, num_rows: i32) -> String { - let num_rows = num_rows as usize; if num_rows == 1 { return s; } - let mut ss = vec![String::new(); num_rows]; + + let num_rows = num_rows as usize; + let mut g = vec![String::new(); num_rows]; let mut i = 0; - let mut to_down = true; + let mut k = -1; + for c in s.chars() { - ss[i].push(c); - if to_down { - i += 1; - } else { - i -= 1; - } + g[i].push(c); if i == 0 || i == num_rows - 1 { - to_down = !to_down; + k = -k; } + i = (i as isize + k) as usize; } - let mut res = String::new(); - for i in 0..num_rows { - res += &ss[i]; - } - res + + g.concat() } } ``` @@ -282,213 +277,77 @@ public class Solution { } ``` - - - - - - -### 方法二 - - - -#### Python3 - -```python -class Solution: - def convert(self, s: str, numRows: int) -> str: - if numRows == 1: - return s - group = 2 * numRows - 2 - ans = [] - for i in range(1, numRows + 1): - interval = group if i == numRows else 2 * numRows - 2 * i - idx = i - 1 - while idx < len(s): - ans.append(s[idx]) - idx += interval - interval = group - interval - if interval == 0: - interval = group - return ''.join(ans) -``` - -#### Java +#### C -```java -class Solution { - public String convert(String s, int numRows) { - if (numRows == 1) { - return s; - } - StringBuilder ans = new StringBuilder(); - int group = 2 * numRows - 2; - for (int i = 1; i <= numRows; i++) { - int interval = i == numRows ? group : 2 * numRows - 2 * i; - int idx = i - 1; - while (idx < s.length()) { - ans.append(s.charAt(idx)); - idx += interval; - interval = group - interval; - if (interval == 0) { - interval = group; - } - } - } - return ans.toString(); +```c +char* convert(char* s, int numRows) { + if (numRows == 1) { + return strdup(s); } -} -``` -#### C++ + int len = strlen(s); + char** g = (char**) malloc(numRows * sizeof(char*)); + int* idx = (int*) malloc(numRows * sizeof(int)); + for (int i = 0; i < numRows; ++i) { + g[i] = (char*) malloc((len + 1) * sizeof(char)); + idx[i] = 0; + } -```cpp -class Solution { -public: - string convert(string s, int numRows) { - if (numRows == 1) return s; - string ans; - int group = 2 * numRows - 2; - for (int i = 1; i <= numRows; ++i) { - int interval = i == numRows ? group : 2 * numRows - 2 * i; - int idx = i - 1; - while (idx < s.length()) { - ans.push_back(s[idx]); - idx += interval; - interval = group - interval; - if (interval == 0) interval = group; - } + int i = 0, k = -1; + for (int p = 0; p < len; ++p) { + g[i][idx[i]++] = s[p]; + if (i == 0 || i == numRows - 1) { + k = -k; } - return ans; + i += k; } -}; -``` -#### Go - -```go -func convert(s string, numRows int) string { - if numRows == 1 { - return s - } - n := len(s) - ans := make([]byte, n) - step := 2*numRows - 2 - count := 0 - for i := 0; i < numRows; i++ { - for j := 0; j+i < n; j += step { - ans[count] = s[i+j] - count++ - if i != 0 && i != numRows-1 && j+step-i < n { - ans[count] = s[j+step-i] - count++ - } - } - } - return string(ans) -} -``` - -#### TypeScript - -```ts -function convert(s: string, numRows: number): string { - if (numRows === 1) { - return s; - } - const ss = new Array(numRows).fill(''); - let i = 0; - let toDown = true; - for (const c of s) { - ss[i] += c; - if (toDown) { - i++; - } else { - i--; - } - if (i === 0 || i === numRows - 1) { - toDown = !toDown; + char* ans = (char*) malloc((len + 1) * sizeof(char)); + int pos = 0; + for (int r = 0; r < numRows; ++r) { + for (int j = 0; j < idx[r]; ++j) { + ans[pos++] = g[r][j]; } + free(g[r]); } - return ss.reduce((r, s) => r + s); -} -``` - -#### Rust + ans[pos] = '\0'; -```rust -impl Solution { - pub fn convert(s: String, num_rows: i32) -> String { - let num_rows = num_rows as usize; - let mut rows = vec![String::new(); num_rows]; - let iter = (0..num_rows).chain((1..num_rows - 1).rev()).cycle(); - iter.zip(s.chars()).for_each(|(i, c)| rows[i].push(c)); - rows.into_iter().collect() - } + free(g); + free(idx); + return ans; } ``` -#### JavaScript - -```js -/** - * @param {string} s - * @param {number} numRows - * @return {string} - */ -var convert = function (s, numRows) { - if (numRows == 1) return s; - const arr = new Array(numRows); - for (let i = 0; i < numRows; i++) arr[i] = []; - let mi = 0, - isDown = true; - for (const c of s) { - arr[mi].push(c); - - if (mi >= numRows - 1) isDown = false; - else if (mi <= 0) isDown = true; - - if (isDown) mi++; - else mi--; - } - let ans = []; - for (const item of arr) { - ans = ans.concat(item); - } - return ans.join(''); -}; -``` - #### PHP ```php class Solution { /** - * @param string $s - * @param int $numRows - * @return string + * @param String $s + * @param Integer $numRows + * @return String */ - function convert($s, $numRows) { - if ($numRows == 1 || strlen($s) <= $numRows) { + if ($numRows == 1) { return $s; } - $result = ''; - $cycleLength = 2 * $numRows - 2; - $n = strlen($s); + $g = array_fill(0, $numRows, ''); + $i = 0; + $k = -1; - for ($i = 0; $i < $numRows; $i++) { - for ($j = 0; $j + $i < $n; $j += $cycleLength) { - $result .= $s[$j + $i]; + $length = strlen($s); + for ($j = 0; $j < $length; $j++) { + $c = $s[$j]; + $g[$i] .= $c; - if ($i != 0 && $i != $numRows - 1 && $j + $cycleLength - $i < $n) { - $result .= $s[$j + $cycleLength - $i]; - } + if ($i == 0 || $i == $numRows - 1) { + $k = -$k; } - } - return $result; + $i += $k; + } + return implode('', $g); } } ``` diff --git a/solution/0000-0099/0006.Zigzag Conversion/README_EN.md b/solution/0000-0099/0006.Zigzag Conversion/README_EN.md index 04390da8f24e7..bf557fa6ee583 100644 --- a/solution/0000-0099/0006.Zigzag Conversion/README_EN.md +++ b/solution/0000-0099/0006.Zigzag Conversion/README_EN.md @@ -76,11 +76,11 @@ P I ### Solution 1: Simulation -We use a two-dimensional array $g$ to simulate the process of the $Z$-shape arrangement, where $g[i][j]$ represents the character at the $i$-th row and the $j$-th column. Initially, $i=0$, and we define a direction variable $k$, initially $k=-1$, indicating moving upwards. +We use a 2D array $g$ to simulate the process of arranging the string in a zigzag pattern, where $g[i][j]$ represents the character at row $i$ and column $j$. Initially, $i = 0$. We also define a direction variable $k$, initially $k = -1$, which means moving upwards. -We traverse the string $s$ from left to right. Each time we traverse to a character $c$, we append it to $g[i]$. If $i=0$ or $i=numRows-1$ at this time, it means that the current character is at the turning point of the $Z$-shape arrangement, and we reverse the value of $k$, i.e., $k=-k$. Next, we update the value of $i$ to $i+k$, i.e., move up or down one row. Continue to traverse the next character until we have traversed the string $s$, and we return the string concatenated by all rows in $g$. +We traverse the string $s$ from left to right. For each character $c$, we append it to $g[i]$. If $i = 0$ or $i = \textit{numRows} - 1$, it means the current character is at a turning point in the zigzag pattern, so we reverse the value of $k$, i.e., $k = -k$. Then, we update $i$ to $i + k$, which means moving up or down one row. Continue traversing the next character until the end of the string $s$. Finally, we return the concatenation of all rows in $g$ as the result. -The time complexity is $O(n)$, and the space complexity is $O(n)$. Here, $n$ is the length of the string $s$. +The time complexity is $O(n)$ and the space complexity is $O(n)$, where $n$ is the length of the string $s$. @@ -197,29 +197,24 @@ function convert(s: string, numRows: number): string { ```rust impl Solution { pub fn convert(s: String, num_rows: i32) -> String { - let num_rows = num_rows as usize; if num_rows == 1 { return s; } - let mut ss = vec![String::new(); num_rows]; + + let num_rows = num_rows as usize; + let mut g = vec![String::new(); num_rows]; let mut i = 0; - let mut to_down = true; + let mut k = -1; + for c in s.chars() { - ss[i].push(c); - if to_down { - i += 1; - } else { - i -= 1; - } + g[i].push(c); if i == 0 || i == num_rows - 1 { - to_down = !to_down; + k = -k; } + i = (i as isize + k) as usize; } - let mut res = String::new(); - for i in 0..num_rows { - res += &ss[i]; - } - res + + g.concat() } } ``` @@ -280,213 +275,77 @@ public class Solution { } ``` - - - - - - -### Solution 2 - - - -#### Python3 - -```python -class Solution: - def convert(self, s: str, numRows: int) -> str: - if numRows == 1: - return s - group = 2 * numRows - 2 - ans = [] - for i in range(1, numRows + 1): - interval = group if i == numRows else 2 * numRows - 2 * i - idx = i - 1 - while idx < len(s): - ans.append(s[idx]) - idx += interval - interval = group - interval - if interval == 0: - interval = group - return ''.join(ans) -``` - -#### Java +#### C -```java -class Solution { - public String convert(String s, int numRows) { - if (numRows == 1) { - return s; - } - StringBuilder ans = new StringBuilder(); - int group = 2 * numRows - 2; - for (int i = 1; i <= numRows; i++) { - int interval = i == numRows ? group : 2 * numRows - 2 * i; - int idx = i - 1; - while (idx < s.length()) { - ans.append(s.charAt(idx)); - idx += interval; - interval = group - interval; - if (interval == 0) { - interval = group; - } - } - } - return ans.toString(); +```c +char* convert(char* s, int numRows) { + if (numRows == 1) { + return strdup(s); } -} -``` -#### C++ + int len = strlen(s); + char** g = (char**) malloc(numRows * sizeof(char*)); + int* idx = (int*) malloc(numRows * sizeof(int)); + for (int i = 0; i < numRows; ++i) { + g[i] = (char*) malloc((len + 1) * sizeof(char)); + idx[i] = 0; + } -```cpp -class Solution { -public: - string convert(string s, int numRows) { - if (numRows == 1) return s; - string ans; - int group = 2 * numRows - 2; - for (int i = 1; i <= numRows; ++i) { - int interval = i == numRows ? group : 2 * numRows - 2 * i; - int idx = i - 1; - while (idx < s.length()) { - ans.push_back(s[idx]); - idx += interval; - interval = group - interval; - if (interval == 0) interval = group; - } + int i = 0, k = -1; + for (int p = 0; p < len; ++p) { + g[i][idx[i]++] = s[p]; + if (i == 0 || i == numRows - 1) { + k = -k; } - return ans; + i += k; } -}; -``` -#### Go - -```go -func convert(s string, numRows int) string { - if numRows == 1 { - return s - } - n := len(s) - ans := make([]byte, n) - step := 2*numRows - 2 - count := 0 - for i := 0; i < numRows; i++ { - for j := 0; j+i < n; j += step { - ans[count] = s[i+j] - count++ - if i != 0 && i != numRows-1 && j+step-i < n { - ans[count] = s[j+step-i] - count++ - } - } - } - return string(ans) -} -``` - -#### TypeScript - -```ts -function convert(s: string, numRows: number): string { - if (numRows === 1) { - return s; - } - const ss = new Array(numRows).fill(''); - let i = 0; - let toDown = true; - for (const c of s) { - ss[i] += c; - if (toDown) { - i++; - } else { - i--; - } - if (i === 0 || i === numRows - 1) { - toDown = !toDown; + char* ans = (char*) malloc((len + 1) * sizeof(char)); + int pos = 0; + for (int r = 0; r < numRows; ++r) { + for (int j = 0; j < idx[r]; ++j) { + ans[pos++] = g[r][j]; } + free(g[r]); } - return ss.reduce((r, s) => r + s); -} -``` - -#### Rust + ans[pos] = '\0'; -```rust -impl Solution { - pub fn convert(s: String, num_rows: i32) -> String { - let num_rows = num_rows as usize; - let mut rows = vec![String::new(); num_rows]; - let iter = (0..num_rows).chain((1..num_rows - 1).rev()).cycle(); - iter.zip(s.chars()).for_each(|(i, c)| rows[i].push(c)); - rows.into_iter().collect() - } + free(g); + free(idx); + return ans; } ``` -#### JavaScript - -```js -/** - * @param {string} s - * @param {number} numRows - * @return {string} - */ -var convert = function (s, numRows) { - if (numRows == 1) return s; - const arr = new Array(numRows); - for (let i = 0; i < numRows; i++) arr[i] = []; - let mi = 0, - isDown = true; - for (const c of s) { - arr[mi].push(c); - - if (mi >= numRows - 1) isDown = false; - else if (mi <= 0) isDown = true; - - if (isDown) mi++; - else mi--; - } - let ans = []; - for (const item of arr) { - ans = ans.concat(item); - } - return ans.join(''); -}; -``` - #### PHP ```php class Solution { /** - * @param string $s - * @param int $numRows - * @return string + * @param String $s + * @param Integer $numRows + * @return String */ - function convert($s, $numRows) { - if ($numRows == 1 || strlen($s) <= $numRows) { + if ($numRows == 1) { return $s; } - $result = ''; - $cycleLength = 2 * $numRows - 2; - $n = strlen($s); + $g = array_fill(0, $numRows, ''); + $i = 0; + $k = -1; - for ($i = 0; $i < $numRows; $i++) { - for ($j = 0; $j + $i < $n; $j += $cycleLength) { - $result .= $s[$j + $i]; + $length = strlen($s); + for ($j = 0; $j < $length; $j++) { + $c = $s[$j]; + $g[$i] .= $c; - if ($i != 0 && $i != $numRows - 1 && $j + $cycleLength - $i < $n) { - $result .= $s[$j + $cycleLength - $i]; - } + if ($i == 0 || $i == $numRows - 1) { + $k = -$k; } - } - return $result; + $i += $k; + } + return implode('', $g); } } ``` diff --git a/solution/0000-0099/0006.Zigzag Conversion/Solution.c b/solution/0000-0099/0006.Zigzag Conversion/Solution.c new file mode 100644 index 0000000000000..3111a73e7035c --- /dev/null +++ b/solution/0000-0099/0006.Zigzag Conversion/Solution.c @@ -0,0 +1,36 @@ +char* convert(char* s, int numRows) { + if (numRows == 1) { + return strdup(s); + } + + int len = strlen(s); + char** g = (char**) malloc(numRows * sizeof(char*)); + int* idx = (int*) malloc(numRows * sizeof(int)); + for (int i = 0; i < numRows; ++i) { + g[i] = (char*) malloc((len + 1) * sizeof(char)); + idx[i] = 0; + } + + int i = 0, k = -1; + for (int p = 0; p < len; ++p) { + g[i][idx[i]++] = s[p]; + if (i == 0 || i == numRows - 1) { + k = -k; + } + i += k; + } + + char* ans = (char*) malloc((len + 1) * sizeof(char)); + int pos = 0; + for (int r = 0; r < numRows; ++r) { + for (int j = 0; j < idx[r]; ++j) { + ans[pos++] = g[r][j]; + } + free(g[r]); + } + ans[pos] = '\0'; + + free(g); + free(idx); + return ans; +} diff --git a/solution/0000-0099/0006.Zigzag Conversion/Solution.php b/solution/0000-0099/0006.Zigzag Conversion/Solution.php index 4eb4ee9795308..2d151b664b8f6 100644 --- a/solution/0000-0099/0006.Zigzag Conversion/Solution.php +++ b/solution/0000-0099/0006.Zigzag Conversion/Solution.php @@ -1,29 +1,29 @@ class Solution { /** - * @param string $s - * @param int $numRows - * @return string + * @param String $s + * @param Integer $numRows + * @return String */ - function convert($s, $numRows) { - if ($numRows == 1 || strlen($s) <= $numRows) { + if ($numRows == 1) { return $s; } - $result = ''; - $cycleLength = 2 * $numRows - 2; - $n = strlen($s); + $g = array_fill(0, $numRows, ""); + $i = 0; + $k = -1; - for ($i = 0; $i < $numRows; $i++) { - for ($j = 0; $j + $i < $n; $j += $cycleLength) { - $result .= $s[$j + $i]; + $length = strlen($s); + for ($j = 0; $j < $length; $j++) { + $c = $s[$j]; + $g[$i] .= $c; - if ($i != 0 && $i != $numRows - 1 && $j + $cycleLength - $i < $n) { - $result .= $s[$j + $cycleLength - $i]; - } + if ($i == 0 || $i == $numRows - 1) { + $k = -$k; } - } - return $result; + $i += $k; + } + return implode("", $g); } } diff --git a/solution/0000-0099/0006.Zigzag Conversion/Solution.rs b/solution/0000-0099/0006.Zigzag Conversion/Solution.rs index bfbf876018144..2a4e99f2b0433 100644 --- a/solution/0000-0099/0006.Zigzag Conversion/Solution.rs +++ b/solution/0000-0099/0006.Zigzag Conversion/Solution.rs @@ -1,27 +1,22 @@ impl Solution { pub fn convert(s: String, num_rows: i32) -> String { - let num_rows = num_rows as usize; if num_rows == 1 { return s; } - let mut ss = vec![String::new(); num_rows]; + + let num_rows = num_rows as usize; + let mut g = vec![String::new(); num_rows]; let mut i = 0; - let mut to_down = true; + let mut k = -1; + for c in s.chars() { - ss[i].push(c); - if to_down { - i += 1; - } else { - i -= 1; - } + g[i].push(c); if i == 0 || i == num_rows - 1 { - to_down = !to_down; + k = -k; } + i = (i as isize + k) as usize; } - let mut res = String::new(); - for i in 0..num_rows { - res += &ss[i]; - } - res + + g.concat() } } diff --git a/solution/0000-0099/0006.Zigzag Conversion/Solution2.cpp b/solution/0000-0099/0006.Zigzag Conversion/Solution2.cpp deleted file mode 100644 index f66b5d959b459..0000000000000 --- a/solution/0000-0099/0006.Zigzag Conversion/Solution2.cpp +++ /dev/null @@ -1,19 +0,0 @@ -class Solution { -public: - string convert(string s, int numRows) { - if (numRows == 1) return s; - string ans; - int group = 2 * numRows - 2; - for (int i = 1; i <= numRows; ++i) { - int interval = i == numRows ? group : 2 * numRows - 2 * i; - int idx = i - 1; - while (idx < s.length()) { - ans.push_back(s[idx]); - idx += interval; - interval = group - interval; - if (interval == 0) interval = group; - } - } - return ans; - } -}; \ No newline at end of file diff --git a/solution/0000-0099/0006.Zigzag Conversion/Solution2.go b/solution/0000-0099/0006.Zigzag Conversion/Solution2.go deleted file mode 100644 index acc9934f620c5..0000000000000 --- a/solution/0000-0099/0006.Zigzag Conversion/Solution2.go +++ /dev/null @@ -1,20 +0,0 @@ -func convert(s string, numRows int) string { - if numRows == 1 { - return s - } - n := len(s) - ans := make([]byte, n) - step := 2*numRows - 2 - count := 0 - for i := 0; i < numRows; i++ { - for j := 0; j+i < n; j += step { - ans[count] = s[i+j] - count++ - if i != 0 && i != numRows-1 && j+step-i < n { - ans[count] = s[j+step-i] - count++ - } - } - } - return string(ans) -} \ No newline at end of file diff --git a/solution/0000-0099/0006.Zigzag Conversion/Solution2.java b/solution/0000-0099/0006.Zigzag Conversion/Solution2.java deleted file mode 100644 index b2a9294d752f3..0000000000000 --- a/solution/0000-0099/0006.Zigzag Conversion/Solution2.java +++ /dev/null @@ -1,22 +0,0 @@ -class Solution { - public String convert(String s, int numRows) { - if (numRows == 1) { - return s; - } - StringBuilder ans = new StringBuilder(); - int group = 2 * numRows - 2; - for (int i = 1; i <= numRows; i++) { - int interval = i == numRows ? group : 2 * numRows - 2 * i; - int idx = i - 1; - while (idx < s.length()) { - ans.append(s.charAt(idx)); - idx += interval; - interval = group - interval; - if (interval == 0) { - interval = group; - } - } - } - return ans.toString(); - } -} \ No newline at end of file diff --git a/solution/0000-0099/0006.Zigzag Conversion/Solution2.js b/solution/0000-0099/0006.Zigzag Conversion/Solution2.js deleted file mode 100644 index e291e38cb6b18..0000000000000 --- a/solution/0000-0099/0006.Zigzag Conversion/Solution2.js +++ /dev/null @@ -1,26 +0,0 @@ -/** - * @param {string} s - * @param {number} numRows - * @return {string} - */ -var convert = function (s, numRows) { - if (numRows == 1) return s; - const arr = new Array(numRows); - for (let i = 0; i < numRows; i++) arr[i] = []; - let mi = 0, - isDown = true; - for (const c of s) { - arr[mi].push(c); - - if (mi >= numRows - 1) isDown = false; - else if (mi <= 0) isDown = true; - - if (isDown) mi++; - else mi--; - } - let ans = []; - for (const item of arr) { - ans = ans.concat(item); - } - return ans.join(''); -}; diff --git a/solution/0000-0099/0006.Zigzag Conversion/Solution2.py b/solution/0000-0099/0006.Zigzag Conversion/Solution2.py deleted file mode 100644 index 5fc2f82ff1e5a..0000000000000 --- a/solution/0000-0099/0006.Zigzag Conversion/Solution2.py +++ /dev/null @@ -1,16 +0,0 @@ -class Solution: - def convert(self, s: str, numRows: int) -> str: - if numRows == 1: - return s - group = 2 * numRows - 2 - ans = [] - for i in range(1, numRows + 1): - interval = group if i == numRows else 2 * numRows - 2 * i - idx = i - 1 - while idx < len(s): - ans.append(s[idx]) - idx += interval - interval = group - interval - if interval == 0: - interval = group - return ''.join(ans) diff --git a/solution/0000-0099/0006.Zigzag Conversion/Solution2.rs b/solution/0000-0099/0006.Zigzag Conversion/Solution2.rs deleted file mode 100644 index f824b365dedec..0000000000000 --- a/solution/0000-0099/0006.Zigzag Conversion/Solution2.rs +++ /dev/null @@ -1,9 +0,0 @@ -impl Solution { - pub fn convert(s: String, num_rows: i32) -> String { - let num_rows = num_rows as usize; - let mut rows = vec![String::new(); num_rows]; - let iter = (0..num_rows).chain((1..num_rows - 1).rev()).cycle(); - iter.zip(s.chars()).for_each(|(i, c)| rows[i].push(c)); - rows.into_iter().collect() - } -} diff --git a/solution/0000-0099/0006.Zigzag Conversion/Solution2.ts b/solution/0000-0099/0006.Zigzag Conversion/Solution2.ts deleted file mode 100644 index 3085c8797be67..0000000000000 --- a/solution/0000-0099/0006.Zigzag Conversion/Solution2.ts +++ /dev/null @@ -1,20 +0,0 @@ -function convert(s: string, numRows: number): string { - if (numRows === 1) { - return s; - } - const ss = new Array(numRows).fill(''); - let i = 0; - let toDown = true; - for (const c of s) { - ss[i] += c; - if (toDown) { - i++; - } else { - i--; - } - if (i === 0 || i === numRows - 1) { - toDown = !toDown; - } - } - return ss.reduce((r, s) => r + s); -} diff --git a/solution/0000-0099/0008.String to Integer (atoi)/README.md b/solution/0000-0099/0008.String to Integer (atoi)/README.md index a1c189c4a6ce7..324738cca1c5e 100644 --- a/solution/0000-0099/0008.String to Integer (atoi)/README.md +++ b/solution/0000-0099/0008.String to Integer (atoi)/README.md @@ -214,6 +214,36 @@ class Solution { } ``` +#### C++ + +```cpp +class Solution { +public: + int myAtoi(string s) { + int i = 0, n = s.size(); + while (i < n && s[i] == ' ') + ++i; + + int sign = 1; + if (i < n && (s[i] == '-' || s[i] == '+')) { + sign = s[i] == '-' ? -1 : 1; + ++i; + } + + int res = 0; + while (i < n && isdigit(s[i])) { + int digit = s[i] - '0'; + if (res > INT_MAX / 10 || (res == INT_MAX / 10 && digit > INT_MAX % 10)) { + return sign == 1 ? INT_MAX : INT_MIN; + } + res = res * 10 + digit; + ++i; + } + return res * sign; + } +}; +``` + #### Go ```go @@ -356,6 +386,36 @@ class Solution { } ``` +#### C + +```c +int myAtoi(char* s) { + int i = 0; + + while (s[i] == ' ') { + i++; + } + + int sign = 1; + if (s[i] == '-' || s[i] == '+') { + sign = (s[i] == '-') ? -1 : 1; + i++; + } + + int res = 0; + while (isdigit(s[i])) { + int digit = s[i] - '0'; + if (res > INT_MAX / 10 || (res == INT_MAX / 10 && digit > INT_MAX % 10)) { + return sign == 1 ? INT_MAX : INT_MIN; + } + res = res * 10 + digit; + i++; + } + + return res * sign; +} +``` + diff --git a/solution/0000-0099/0008.String to Integer (atoi)/README_EN.md b/solution/0000-0099/0008.String to Integer (atoi)/README_EN.md index 7603001843b45..bc0c422b89134 100644 --- a/solution/0000-0099/0008.String to Integer (atoi)/README_EN.md +++ b/solution/0000-0099/0008.String to Integer (atoi)/README_EN.md @@ -160,7 +160,6 @@ class Solution: i = 0 while s[i] == ' ': i += 1 - # 仅包含空格 if i == n: return 0 sign = -1 if s[i] == '-' else 1 @@ -168,11 +167,9 @@ class Solution: i += 1 res, flag = 0, (2**31 - 1) // 10 while i < n: - # 非数字，跳出循环体 if not s[i].isdigit(): break c = int(s[i]) - # 溢出判断 if res > flag or (res == flag and c > 7): return 2**31 - 1 if sign > 0 else -(2**31) res = res * 10 + c @@ -190,7 +187,6 @@ class Solution { if (n == 0) return 0; int i = 0; while (s.charAt(i) == ' ') { - // 仅包含空格 if (++i == n) return 0; } int sign = 1; @@ -198,9 +194,7 @@ class Solution { if (s.charAt(i) == '-' || s.charAt(i) == '+') ++i; int res = 0, flag = Integer.MAX_VALUE / 10; for (; i < n; ++i) { - // 非数字，跳出循环体 if (s.charAt(i) < '0' || s.charAt(i) > '9') break; - // 溢出判断 if (res > flag || (res == flag && s.charAt(i) > '7')) return sign > 0 ? Integer.MAX_VALUE : Integer.MIN_VALUE; res = res * 10 + (s.charAt(i) - '0'); @@ -210,6 +204,36 @@ class Solution { } ``` +#### C++ + +```cpp +class Solution { +public: + int myAtoi(string s) { + int i = 0, n = s.size(); + while (i < n && s[i] == ' ') + ++i; + + int sign = 1; + if (i < n && (s[i] == '-' || s[i] == '+')) { + sign = s[i] == '-' ? -1 : 1; + ++i; + } + + int res = 0; + while (i < n && isdigit(s[i])) { + int digit = s[i] - '0'; + if (res > INT_MAX / 10 || (res == INT_MAX / 10 && digit > INT_MAX % 10)) { + return sign == 1 ? INT_MAX : INT_MIN; + } + res = res * 10 + digit; + ++i; + } + return res * sign; + } +}; +``` + #### Go ```go @@ -282,8 +306,6 @@ const myAtoi = function (str) { #### C# ```cs -// https://leetcode.com/problems/string-to-integer-atoi/ - public partial class Solution { public int MyAtoi(string str) @@ -352,6 +374,36 @@ class Solution { } ``` +#### C + +```c +int myAtoi(char* s) { + int i = 0; + + while (s[i] == ' ') { + i++; + } + + int sign = 1; + if (s[i] == '-' || s[i] == '+') { + sign = (s[i] == '-') ? -1 : 1; + i++; + } + + int res = 0; + while (isdigit(s[i])) { + int digit = s[i] - '0'; + if (res > INT_MAX / 10 || (res == INT_MAX / 10 && digit > INT_MAX % 10)) { + return sign == 1 ? INT_MAX : INT_MIN; + } + res = res * 10 + digit; + i++; + } + + return res * sign; +} +``` + diff --git a/solution/0000-0099/0008.String to Integer (atoi)/Solution.c b/solution/0000-0099/0008.String to Integer (atoi)/Solution.c new file mode 100644 index 0000000000000..26f63ab4316e3 --- /dev/null +++ b/solution/0000-0099/0008.String to Integer (atoi)/Solution.c @@ -0,0 +1,25 @@ +int myAtoi(char* s) { + int i = 0; + + while (s[i] == ' ') { + i++; + } + + int sign = 1; + if (s[i] == '-' || s[i] == '+') { + sign = (s[i] == '-') ? -1 : 1; + i++; + } + + int res = 0; + while (isdigit(s[i])) { + int digit = s[i] - '0'; + if (res > INT_MAX / 10 || (res == INT_MAX / 10 && digit > INT_MAX % 10)) { + return sign == 1 ? INT_MAX : INT_MIN; + } + res = res * 10 + digit; + i++; + } + + return res * sign; +} diff --git a/solution/0000-0099/0008.String to Integer (atoi)/Solution.cpp b/solution/0000-0099/0008.String to Integer (atoi)/Solution.cpp new file mode 100644 index 0000000000000..72fc381920bf2 --- /dev/null +++ b/solution/0000-0099/0008.String to Integer (atoi)/Solution.cpp @@ -0,0 +1,25 @@ +class Solution { +public: + int myAtoi(string s) { + int i = 0, n = s.size(); + while (i < n && s[i] == ' ') + ++i; + + int sign = 1; + if (i < n && (s[i] == '-' || s[i] == '+')) { + sign = s[i] == '-' ? -1 : 1; + ++i; + } + + int res = 0; + while (i < n && isdigit(s[i])) { + int digit = s[i] - '0'; + if (res > INT_MAX / 10 || (res == INT_MAX / 10 && digit > INT_MAX % 10)) { + return sign == 1 ? INT_MAX : INT_MIN; + } + res = res * 10 + digit; + ++i; + } + return res * sign; + } +}; diff --git a/solution/0000-0099/0009.Palindrome Number/README.md b/solution/0000-0099/0009.Palindrome Number/README.md index c0e23b1f63b38..46fbfac16ef77 100644 --- a/solution/0000-0099/0009.Palindrome Number/README.md +++ b/solution/0000-0099/0009.Palindrome Number/README.md @@ -177,13 +177,12 @@ function isPalindrome(x: number): boolean { ```rust impl Solution { pub fn is_palindrome(mut x: i32) -> bool { - if x < 0 || (x % 10 == 0 && x != 0) { + if x < 0 || (x != 0 && x % 10 == 0) { return false; } let mut y = 0; while x > y { - y *= 10; - y += x % 10; + y = y * 10 + x % 10; x /= 10; } x == y || x == y / 10 @@ -210,23 +209,63 @@ var isPalindrome = function (x) { }; ``` +#### C# + +```cs +public class Solution { + public bool IsPalindrome(int x) { + if (x < 0 || (x > 0 && x % 10 == 0)) { + return false; + } + int y = 0; + for (; y < x; x /= 10) { + y = y * 10 + x % 10; + } + return x == y || x == y / 10; + } +} +``` + #### PHP ```php class Solution { /** - * @param int $x - * @return boolean + * @param Integer $x + * @return Boolean */ - function isPalindrome($x) { - $str = (string) $x; - $str_reverse = strrev($str); - return $str === $str_reverse; + if ($x < 0 || ($x && $x % 10 == 0)) { + return false; + } + $y = 0; + while ($x > $y) { + $y = $y * 10 + ($x % 10); + $x = (int) ($x / 10); + } + return $x == $y || $x == (int) ($y / 10); } } ``` +#### C + +```c +bool isPalindrome(int x) { + if (x < 0 || (x != 0 && x % 10 == 0)) { + return false; + } + + int y = 0; + while (y < x) { + y = y * 10 + x % 10; + x /= 10; + } + + return (x == y || x == y / 10); +} +``` + diff --git a/solution/0000-0099/0009.Palindrome Number/README_EN.md b/solution/0000-0099/0009.Palindrome Number/README_EN.md index 0392466009818..712ba430b9d5a 100644 --- a/solution/0000-0099/0009.Palindrome Number/README_EN.md +++ b/solution/0000-0099/0009.Palindrome Number/README_EN.md @@ -169,13 +169,12 @@ function isPalindrome(x: number): boolean { ```rust impl Solution { pub fn is_palindrome(mut x: i32) -> bool { - if x < 0 || (x % 10 == 0 && x != 0) { + if x < 0 || (x != 0 && x % 10 == 0) { return false; } let mut y = 0; while x > y { - y *= 10; - y += x % 10; + y = y * 10 + x % 10; x /= 10; } x == y || x == y / 10 @@ -202,23 +201,63 @@ var isPalindrome = function (x) { }; ``` +#### C# + +```cs +public class Solution { + public bool IsPalindrome(int x) { + if (x < 0 || (x > 0 && x % 10 == 0)) { + return false; + } + int y = 0; + for (; y < x; x /= 10) { + y = y * 10 + x % 10; + } + return x == y || x == y / 10; + } +} +``` + #### PHP ```php class Solution { /** - * @param int $x - * @return boolean + * @param Integer $x + * @return Boolean */ - function isPalindrome($x) { - $str = (string) $x; - $str_reverse = strrev($str); - return $str === $str_reverse; + if ($x < 0 || ($x && $x % 10 == 0)) { + return false; + } + $y = 0; + while ($x > $y) { + $y = $y * 10 + ($x % 10); + $x = (int) ($x / 10); + } + return $x == $y || $x == (int) ($y / 10); } } ``` +#### C + +```c +bool isPalindrome(int x) { + if (x < 0 || (x != 0 && x % 10 == 0)) { + return false; + } + + int y = 0; + while (y < x) { + y = y * 10 + x % 10; + x /= 10; + } + + return (x == y || x == y / 10); +} +``` + diff --git a/solution/0000-0099/0009.Palindrome Number/Solution.c b/solution/0000-0099/0009.Palindrome Number/Solution.c new file mode 100644 index 0000000000000..c13f8cc7947ca --- /dev/null +++ b/solution/0000-0099/0009.Palindrome Number/Solution.c @@ -0,0 +1,13 @@ +bool isPalindrome(int x) { + if (x < 0 || (x != 0 && x % 10 == 0)) { + return false; + } + + int y = 0; + while (y < x) { + y = y * 10 + x % 10; + x /= 10; + } + + return (x == y || x == y / 10); +} diff --git a/solution/0000-0099/0009.Palindrome Number/Solution.cs b/solution/0000-0099/0009.Palindrome Number/Solution.cs new file mode 100644 index 0000000000000..f530d9156371b --- /dev/null +++ b/solution/0000-0099/0009.Palindrome Number/Solution.cs @@ -0,0 +1,12 @@ +public class Solution { + public bool IsPalindrome(int x) { + if (x < 0 || (x > 0 && x % 10 == 0)) { + return false; + } + int y = 0; + for (; y < x; x /= 10) { + y = y * 10 + x % 10; + } + return x == y || x == y / 10; + } +} \ No newline at end of file diff --git a/solution/0000-0099/0009.Palindrome Number/Solution.php b/solution/0000-0099/0009.Palindrome Number/Solution.php index 9fd8c6654ec95..c4042d56fbed1 100644 --- a/solution/0000-0099/0009.Palindrome Number/Solution.php +++ b/solution/0000-0099/0009.Palindrome Number/Solution.php @@ -1,12 +1,17 @@ class Solution { /** - * @param int $x - * @return boolean + * @param Integer $x + * @return Boolean */ - function isPalindrome($x) { - $str = (string) $x; - $str_reverse = strrev($str); - return $str === $str_reverse; + if ($x < 0 || ($x && $x % 10 == 0)) { + return false; + } + $y = 0; + while ($x > $y) { + $y = $y * 10 + ($x % 10); + $x = (int) ($x / 10); + } + return $x == $y || $x == (int) ($y / 10); } } diff --git a/solution/0000-0099/0009.Palindrome Number/Solution.rs b/solution/0000-0099/0009.Palindrome Number/Solution.rs index 7163690151d08..9275d20a011d7 100644 --- a/solution/0000-0099/0009.Palindrome Number/Solution.rs +++ b/solution/0000-0099/0009.Palindrome Number/Solution.rs @@ -1,20 +1,13 @@ impl Solution { - pub fn is_palindrome(x: i32) -> bool { - if x < 0 { + pub fn is_palindrome(mut x: i32) -> bool { + if x < 0 || (x != 0 && x % 10 == 0) { return false; } - let s = x.to_string(); - let bs = s.as_bytes(); - let n = bs.len(); - let mut l = 0; - let mut r = n - 1; - while l < r { - if bs[l] != bs[r] { - return false; - } - l += 1; - r -= 1; + let mut y = 0; + while x > y { + y = y * 10 + x % 10; + x /= 10; } - true + x == y || x == y / 10 } } diff --git a/solution/0000-0099/0010.Regular Expression Matching/README.md b/solution/0000-0099/0010.Regular Expression Matching/README.md index 5eb9ff8be6f3d..e9acc4602cc81 100644 --- a/solution/0000-0099/0010.Regular Expression Matching/README.md +++ b/solution/0000-0099/0010.Regular Expression Matching/README.md @@ -331,6 +331,85 @@ public class Solution { } ``` +#### C + +```c +#define MAX_LEN 1000 + +char *ss, *pp; +int m, n; +int f[MAX_LEN + 1][MAX_LEN + 1]; + +bool dfs(int i, int j) { + if (j >= n) { + return i == m; + } + if (f[i][j] != 0) { + return f[i][j] == 1; + } + int res = -1; + if (j + 1 < n && pp[j + 1] == '*') { + if (dfs(i, j + 2) || (i < m && (ss[i] == pp[j] || pp[j] == '.') && dfs(i + 1, j))) { + res = 1; + } + } else if (i < m && (ss[i] == pp[j] || pp[j] == '.') && dfs(i + 1, j + 1)) { + res = 1; + } + f[i][j] = res; + return res == 1; +} + +bool isMatch(char* s, char* p) { + ss = s; + pp = p; + m = strlen(s); + n = strlen(p); + memset(f, 0, sizeof(f)); + return dfs(0, 0); +} +``` + +#### PHP + +```php +class Solution { + /** + * @param String $s + * @param String $p + * @return Boolean + */ + function isMatch($s, $p) { + $m = strlen($s); + $n = strlen($p); + $f = array_fill(0, $m + 1, array_fill(0, $n + 1, 0)); + + $dfs = function ($i, $j) use (&$s, &$p, $m, $n, &$f, &$dfs) { + if ($j >= $n) { + return $i == $m; + } + if ($f[$i][$j] != 0) { + return $f[$i][$j] == 1; + } + $res = -1; + if ($j + 1 < $n && $p[$j + 1] == '*') { + if ( + $dfs($i, $j + 2) || + ($i < $m && ($s[$i] == $p[$j] || $p[$j] == '.') && $dfs($i + 1, $j)) + ) { + $res = 1; + } + } elseif ($i < $m && ($s[$i] == $p[$j] || $p[$j] == '.') && $dfs($i + 1, $j + 1)) { + $res = 1; + } + $f[$i][$j] = $res; + return $res == 1; + }; + + return $dfs(0, 0); + } +} +``` + @@ -541,44 +620,60 @@ public class Solution { ```php class Solution { /** - * @param string $s - * @param string $p - * @return boolean + * @param String $s + * @param String $p + * @return Boolean */ - function isMatch($s, $p) { $m = strlen($s); $n = strlen($p); - $dp = array_fill(0, $m + 1, array_fill(0, $n + 1, false)); - $dp[0][0] = true; - - for ($j = 1; $j <= $n; $j++) { - if ($p[$j - 1] == '*') { - $dp[0][$j] = $dp[0][$j - 2]; - } - } + $f = array_fill(0, $m + 1, array_fill(0, $n + 1, false)); + $f[0][0] = true; - for ($i = 1; $i <= $m; $i++) { + for ($i = 0; $i <= $m; $i++) { for ($j = 1; $j <= $n; $j++) { - if ($p[$j - 1] == '.' || $p[$j - 1] == $s[$i - 1]) { - $dp[$i][$j] = $dp[$i - 1][$j - 1]; - } elseif ($p[$j - 1] == '*') { - $dp[$i][$j] = $dp[$i][$j - 2]; - if ($p[$j - 2] == '.' || $p[$j - 2] == $s[$i - 1]) { - $dp[$i][$j] = $dp[$i][$j] || $dp[$i - 1][$j]; + if ($p[$j - 1] == '*') { + $f[$i][$j] = $f[$i][$j - 2]; + if ($i > 0 && ($p[$j - 2] == '.' || $p[$j - 2] == $s[$i - 1])) { + $f[$i][$j] = $f[$i][$j] || $f[$i - 1][$j]; } - } else { - $dp[$i][$j] = false; + } elseif ($i > 0 && ($p[$j - 1] == '.' || $p[$j - 1] == $s[$i - 1])) { + $f[$i][$j] = $f[$i - 1][$j - 1]; } } } - return $dp[$m][$n]; + return $f[$m][$n]; } } ``` +#### C + +```c +bool isMatch(char* s, char* p) { + int m = strlen(s), n = strlen(p); + bool f[m + 1][n + 1]; + memset(f, 0, sizeof(f)); + f[0][0] = true; + + for (int i = 0; i <= m; ++i) { + for (int j = 1; j <= n; ++j) { + if (p[j - 1] == '*') { + f[i][j] = f[i][j - 2]; + if (i > 0 && (p[j - 2] == '.' || p[j - 2] == s[i - 1])) { + f[i][j] = f[i][j] || f[i - 1][j]; + } + } else if (i > 0 && (p[j - 1] == '.' || p[j - 1] == s[i - 1])) { + f[i][j] = f[i - 1][j - 1]; + } + } + } + return f[m][n]; +} +``` + diff --git a/solution/0000-0099/0010.Regular Expression Matching/README_EN.md b/solution/0000-0099/0010.Regular Expression Matching/README_EN.md index d7302fddd9809..3164f471dd8c2 100644 --- a/solution/0000-0099/0010.Regular Expression Matching/README_EN.md +++ b/solution/0000-0099/0010.Regular Expression Matching/README_EN.md @@ -330,6 +330,85 @@ public class Solution { } ``` +#### C + +```c +#define MAX_LEN 1000 + +char *ss, *pp; +int m, n; +int f[MAX_LEN + 1][MAX_LEN + 1]; + +bool dfs(int i, int j) { + if (j >= n) { + return i == m; + } + if (f[i][j] != 0) { + return f[i][j] == 1; + } + int res = -1; + if (j + 1 < n && pp[j + 1] == '*') { + if (dfs(i, j + 2) || (i < m && (ss[i] == pp[j] || pp[j] == '.') && dfs(i + 1, j))) { + res = 1; + } + } else if (i < m && (ss[i] == pp[j] || pp[j] == '.') && dfs(i + 1, j + 1)) { + res = 1; + } + f[i][j] = res; + return res == 1; +} + +bool isMatch(char* s, char* p) { + ss = s; + pp = p; + m = strlen(s); + n = strlen(p); + memset(f, 0, sizeof(f)); + return dfs(0, 0); +} +``` + +#### PHP + +```php +class Solution { + /** + * @param String $s + * @param String $p + * @return Boolean + */ + function isMatch($s, $p) { + $m = strlen($s); + $n = strlen($p); + $f = array_fill(0, $m + 1, array_fill(0, $n + 1, 0)); + + $dfs = function ($i, $j) use (&$s, &$p, $m, $n, &$f, &$dfs) { + if ($j >= $n) { + return $i == $m; + } + if ($f[$i][$j] != 0) { + return $f[$i][$j] == 1; + } + $res = -1; + if ($j + 1 < $n && $p[$j + 1] == '*') { + if ( + $dfs($i, $j + 2) || + ($i < $m && ($s[$i] == $p[$j] || $p[$j] == '.') && $dfs($i + 1, $j)) + ) { + $res = 1; + } + } elseif ($i < $m && ($s[$i] == $p[$j] || $p[$j] == '.') && $dfs($i + 1, $j + 1)) { + $res = 1; + } + $f[$i][$j] = $res; + return $res == 1; + }; + + return $dfs(0, 0); + } +} +``` + @@ -540,44 +619,60 @@ public class Solution { ```php class Solution { /** - * @param string $s - * @param string $p - * @return boolean + * @param String $s + * @param String $p + * @return Boolean */ - function isMatch($s, $p) { $m = strlen($s); $n = strlen($p); - $dp = array_fill(0, $m + 1, array_fill(0, $n + 1, false)); - $dp[0][0] = true; - - for ($j = 1; $j <= $n; $j++) { - if ($p[$j - 1] == '*') { - $dp[0][$j] = $dp[0][$j - 2]; - } - } + $f = array_fill(0, $m + 1, array_fill(0, $n + 1, false)); + $f[0][0] = true; - for ($i = 1; $i <= $m; $i++) { + for ($i = 0; $i <= $m; $i++) { for ($j = 1; $j <= $n; $j++) { - if ($p[$j - 1] == '.' || $p[$j - 1] == $s[$i - 1]) { - $dp[$i][$j] = $dp[$i - 1][$j - 1]; - } elseif ($p[$j - 1] == '*') { - $dp[$i][$j] = $dp[$i][$j - 2]; - if ($p[$j - 2] == '.' || $p[$j - 2] == $s[$i - 1]) { - $dp[$i][$j] = $dp[$i][$j] || $dp[$i - 1][$j]; + if ($p[$j - 1] == '*') { + $f[$i][$j] = $f[$i][$j - 2]; + if ($i > 0 && ($p[$j - 2] == '.' || $p[$j - 2] == $s[$i - 1])) { + $f[$i][$j] = $f[$i][$j] || $f[$i - 1][$j]; } - } else { - $dp[$i][$j] = false; + } elseif ($i > 0 && ($p[$j - 1] == '.' || $p[$j - 1] == $s[$i - 1])) { + $f[$i][$j] = $f[$i - 1][$j - 1]; } } } - return $dp[$m][$n]; + return $f[$m][$n]; } } ``` +#### C + +```c +bool isMatch(char* s, char* p) { + int m = strlen(s), n = strlen(p); + bool f[m + 1][n + 1]; + memset(f, 0, sizeof(f)); + f[0][0] = true; + + for (int i = 0; i <= m; ++i) { + for (int j = 1; j <= n; ++j) { + if (p[j - 1] == '*') { + f[i][j] = f[i][j - 2]; + if (i > 0 && (p[j - 2] == '.' || p[j - 2] == s[i - 1])) { + f[i][j] = f[i][j] || f[i - 1][j]; + } + } else if (i > 0 && (p[j - 1] == '.' || p[j - 1] == s[i - 1])) { + f[i][j] = f[i - 1][j - 1]; + } + } + } + return f[m][n]; +} +``` + diff --git a/solution/0000-0099/0010.Regular Expression Matching/Solution.c b/solution/0000-0099/0010.Regular Expression Matching/Solution.c new file mode 100644 index 0000000000000..db0116921230e --- /dev/null +++ b/solution/0000-0099/0010.Regular Expression Matching/Solution.c @@ -0,0 +1,33 @@ +#define MAX_LEN 1000 + +char *ss, *pp; +int m, n; +int f[MAX_LEN + 1][MAX_LEN + 1]; + +bool dfs(int i, int j) { + if (j >= n) { + return i == m; + } + if (f[i][j] != 0) { + return f[i][j] == 1; + } + int res = -1; + if (j + 1 < n && pp[j + 1] == '*') { + if (dfs(i, j + 2) || (i < m && (ss[i] == pp[j] || pp[j] == '.') && dfs(i + 1, j))) { + res = 1; + } + } else if (i < m && (ss[i] == pp[j] || pp[j] == '.') && dfs(i + 1, j + 1)) { + res = 1; + } + f[i][j] = res; + return res == 1; +} + +bool isMatch(char* s, char* p) { + ss = s; + pp = p; + m = strlen(s); + n = strlen(p); + memset(f, 0, sizeof(f)); + return dfs(0, 0); +} diff --git a/solution/0000-0099/0010.Regular Expression Matching/Solution.php b/solution/0000-0099/0010.Regular Expression Matching/Solution.php index 85a7f34fe75da..fc9aca3447ffe 100644 --- a/solution/0000-0099/0010.Regular Expression Matching/Solution.php +++ b/solution/0000-0099/0010.Regular Expression Matching/Solution.php @@ -1,38 +1,36 @@ class Solution { /** - * @param string $s - * @param string $p - * @return boolean + * @param String $s + * @param String $p + * @return Boolean */ - function isMatch($s, $p) { $m = strlen($s); $n = strlen($p); + $f = array_fill(0, $m + 1, array_fill(0, $n + 1, 0)); - $dp = array_fill(0, $m + 1, array_fill(0, $n + 1, false)); - $dp[0][0] = true; - - for ($j = 1; $j <= $n; $j++) { - if ($p[$j - 1] == '*') { - $dp[0][$j] = $dp[0][$j - 2]; + $dfs = function ($i, $j) use (&$s, &$p, $m, $n, &$f, &$dfs) { + if ($j >= $n) { + return $i == $m; } - } - - for ($i = 1; $i <= $m; $i++) { - for ($j = 1; $j <= $n; $j++) { - if ($p[$j - 1] == '.' || $p[$j - 1] == $s[$i - 1]) { - $dp[$i][$j] = $dp[$i - 1][$j - 1]; - } elseif ($p[$j - 1] == '*') { - $dp[$i][$j] = $dp[$i][$j - 2]; - if ($p[$j - 2] == '.' || $p[$j - 2] == $s[$i - 1]) { - $dp[$i][$j] = $dp[$i][$j] || $dp[$i - 1][$j]; - } - } else { - $dp[$i][$j] = false; + if ($f[$i][$j] != 0) { + return $f[$i][$j] == 1; + } + $res = -1; + if ($j + 1 < $n && $p[$j + 1] == '*') { + if ( + $dfs($i, $j + 2) || + ($i < $m && ($s[$i] == $p[$j] || $p[$j] == '.') && $dfs($i + 1, $j)) + ) { + $res = 1; } + } elseif ($i < $m && ($s[$i] == $p[$j] || $p[$j] == '.') && $dfs($i + 1, $j + 1)) { + $res = 1; } - } + $f[$i][$j] = $res; + return $res == 1; + }; - return $dp[$m][$n]; + return $dfs(0, 0); } -} +} \ No newline at end of file diff --git a/solution/0000-0099/0010.Regular Expression Matching/Solution2.c b/solution/0000-0099/0010.Regular Expression Matching/Solution2.c new file mode 100644 index 0000000000000..9240063d8bd6a --- /dev/null +++ b/solution/0000-0099/0010.Regular Expression Matching/Solution2.c @@ -0,0 +1,20 @@ +bool isMatch(char* s, char* p) { + int m = strlen(s), n = strlen(p); + bool f[m + 1][n + 1]; + memset(f, 0, sizeof(f)); + f[0][0] = true; + + for (int i = 0; i <= m; ++i) { + for (int j = 1; j <= n; ++j) { + if (p[j - 1] == '*') { + f[i][j] = f[i][j - 2]; + if (i > 0 && (p[j - 2] == '.' || p[j - 2] == s[i - 1])) { + f[i][j] = f[i][j] || f[i - 1][j]; + } + } else if (i > 0 && (p[j - 1] == '.' || p[j - 1] == s[i - 1])) { + f[i][j] = f[i - 1][j - 1]; + } + } + } + return f[m][n]; +} diff --git a/solution/0000-0099/0010.Regular Expression Matching/Solution2.php b/solution/0000-0099/0010.Regular Expression Matching/Solution2.php new file mode 100644 index 0000000000000..6f40295f7f06c --- /dev/null +++ b/solution/0000-0099/0010.Regular Expression Matching/Solution2.php @@ -0,0 +1,29 @@ +class Solution { + /** + * @param String $s + * @param String $p + * @return Boolean + */ + function isMatch($s, $p) { + $m = strlen($s); + $n = strlen($p); + + $f = array_fill(0, $m + 1, array_fill(0, $n + 1, false)); + $f[0][0] = true; + + for ($i = 0; $i <= $m; $i++) { + for ($j = 1; $j <= $n; $j++) { + if ($p[$j - 1] == '*') { + $f[$i][$j] = $f[$i][$j - 2]; + if ($i > 0 && ($p[$j - 2] == '.' || $p[$j - 2] == $s[$i - 1])) { + $f[$i][$j] = $f[$i][$j] || $f[$i - 1][$j]; + } + } elseif ($i > 0 && ($p[$j - 1] == '.' || $p[$j - 1] == $s[$i - 1])) { + $f[$i][$j] = $f[$i - 1][$j - 1]; + } + } + } + + return $f[$m][$n]; + } +} \ No newline at end of file diff --git a/solution/0000-0099/0011.Container With Most Water/README.md b/solution/0000-0099/0011.Container With Most Water/README.md index 1a3de695501d6..70c5128220e2c 100644 --- a/solution/0000-0099/0011.Container With Most Water/README.md +++ b/solution/0000-0099/0011.Container With Most Water/README.md @@ -262,6 +262,33 @@ class Solution { } ``` +#### C + +```c +int min(int a, int b) { + return a < b ? a : b; +} + +int max(int a, int b) { + return a > b ? a : b; +} + +int maxArea(int* height, int heightSize) { + int l = 0, r = heightSize - 1; + int ans = 0; + while (l < r) { + int t = min(height[l], height[r]) * (r - l); + ans = max(ans, t); + if (height[l] < height[r]) { + ++l; + } else { + --r; + } + } + return ans; +} +``` + diff --git a/solution/0000-0099/0011.Container With Most Water/README_EN.md b/solution/0000-0099/0011.Container With Most Water/README_EN.md index 5d113a38fbc66..0a0ab8c8f7108 100644 --- a/solution/0000-0099/0011.Container With Most Water/README_EN.md +++ b/solution/0000-0099/0011.Container With Most Water/README_EN.md @@ -259,6 +259,33 @@ class Solution { } ``` +#### C + +```c +int min(int a, int b) { + return a < b ? a : b; +} + +int max(int a, int b) { + return a > b ? a : b; +} + +int maxArea(int* height, int heightSize) { + int l = 0, r = heightSize - 1; + int ans = 0; + while (l < r) { + int t = min(height[l], height[r]) * (r - l); + ans = max(ans, t); + if (height[l] < height[r]) { + ++l; + } else { + --r; + } + } + return ans; +} +``` + diff --git a/solution/0000-0099/0011.Container With Most Water/Solution.c b/solution/0000-0099/0011.Container With Most Water/Solution.c new file mode 100644 index 0000000000000..a2dd45e5b194d --- /dev/null +++ b/solution/0000-0099/0011.Container With Most Water/Solution.c @@ -0,0 +1,22 @@ +int min(int a, int b) { + return a < b ? a : b; +} + +int max(int a, int b) { + return a > b ? a : b; +} + +int maxArea(int* height, int heightSize) { + int l = 0, r = heightSize - 1; + int ans = 0; + while (l < r) { + int t = min(height[l], height[r]) * (r - l); + ans = max(ans, t); + if (height[l] < height[r]) { + ++l; + } else { + --r; + } + } + return ans; +} diff --git a/solution/0000-0099/0012.Integer to Roman/README.md b/solution/0000-0099/0012.Integer to Roman/README.md index 815d37edba30b..c7151c82720b4 100644 --- a/solution/0000-0099/0012.Integer to Roman/README.md +++ b/solution/0000-0099/0012.Integer to Roman/README.md @@ -300,6 +300,30 @@ class Solution { } ``` +#### C + +```c +static const char* cs[] = { + "M", "CM", "D", "CD", "C", "XC", + "L", "XL", "X", "IX", "V", "IV", "I"}; + +static const int vs[] = { + 1000, 900, 500, 400, 100, 90, + 50, 40, 10, 9, 5, 4, 1}; + +char* intToRoman(int num) { + static char ans[20]; + ans[0] = '\0'; + for (int i = 0; i < 13; ++i) { + while (num >= vs[i]) { + num -= vs[i]; + strcat(ans, cs[i]); + } + } + return ans; +} +``` + diff --git a/solution/0000-0099/0012.Integer to Roman/README_EN.md b/solution/0000-0099/0012.Integer to Roman/README_EN.md index c7b57f780c463..9fcb12b9a56d2 100644 --- a/solution/0000-0099/0012.Integer to Roman/README_EN.md +++ b/solution/0000-0099/0012.Integer to Roman/README_EN.md @@ -298,6 +298,30 @@ class Solution { } ``` +#### C + +```c +static const char* cs[] = { + "M", "CM", "D", "CD", "C", "XC", + "L", "XL", "X", "IX", "V", "IV", "I"}; + +static const int vs[] = { + 1000, 900, 500, 400, 100, 90, + 50, 40, 10, 9, 5, 4, 1}; + +char* intToRoman(int num) { + static char ans[20]; + ans[0] = '\0'; + for (int i = 0; i < 13; ++i) { + while (num >= vs[i]) { + num -= vs[i]; + strcat(ans, cs[i]); + } + } + return ans; +} +``` + diff --git a/solution/0000-0099/0012.Integer to Roman/Solution.c b/solution/0000-0099/0012.Integer to Roman/Solution.c new file mode 100644 index 0000000000000..1417b40e44318 --- /dev/null +++ b/solution/0000-0099/0012.Integer to Roman/Solution.c @@ -0,0 +1,19 @@ +static const char* cs[] = { + "M", "CM", "D", "CD", "C", "XC", + "L", "XL", "X", "IX", "V", "IV", "I"}; + +static const int vs[] = { + 1000, 900, 500, 400, 100, 90, + 50, 40, 10, 9, 5, 4, 1}; + +char* intToRoman(int num) { + static char ans[20]; + ans[0] = '\0'; + for (int i = 0; i < 13; ++i) { + while (num >= vs[i]) { + num -= vs[i]; + strcat(ans, cs[i]); + } + } + return ans; +} diff --git a/solution/0000-0099/0013.Roman to Integer/README.md b/solution/0000-0099/0013.Roman to Integer/README.md index 4d985955579f8..604ebaaf5c8e8 100644 --- a/solution/0000-0099/0013.Roman to Integer/README.md +++ b/solution/0000-0099/0013.Roman to Integer/README.md @@ -341,6 +341,32 @@ def roman_to_int(s) end ``` +#### C + +```c +int nums(char c) { + switch (c) { + case 'I': return 1; + case 'V': return 5; + case 'X': return 10; + case 'L': return 50; + case 'C': return 100; + case 'D': return 500; + case 'M': return 1000; + default: return 0; + } +} + +int romanToInt(char* s) { + int ans = nums(s[strlen(s) - 1]); + for (int i = 0; i < (int) strlen(s) - 1; ++i) { + int sign = nums(s[i]) < nums(s[i + 1]) ? -1 : 1; + ans += sign * nums(s[i]); + } + return ans; +} +``` + diff --git a/solution/0000-0099/0013.Roman to Integer/README_EN.md b/solution/0000-0099/0013.Roman to Integer/README_EN.md index 099ed325658a3..5d93d580a88f1 100644 --- a/solution/0000-0099/0013.Roman to Integer/README_EN.md +++ b/solution/0000-0099/0013.Roman to Integer/README_EN.md @@ -327,6 +327,32 @@ def roman_to_int(s) end ``` +#### C + +```c +int nums(char c) { + switch (c) { + case 'I': return 1; + case 'V': return 5; + case 'X': return 10; + case 'L': return 50; + case 'C': return 100; + case 'D': return 500; + case 'M': return 1000; + default: return 0; + } +} + +int romanToInt(char* s) { + int ans = nums(s[strlen(s) - 1]); + for (int i = 0; i < (int) strlen(s) - 1; ++i) { + int sign = nums(s[i]) < nums(s[i + 1]) ? -1 : 1; + ans += sign * nums(s[i]); + } + return ans; +} +``` + diff --git a/solution/0000-0099/0013.Roman to Integer/Solution.c b/solution/0000-0099/0013.Roman to Integer/Solution.c new file mode 100644 index 0000000000000..7e3199c1e1fa7 --- /dev/null +++ b/solution/0000-0099/0013.Roman to Integer/Solution.c @@ -0,0 +1,21 @@ +int nums(char c) { + switch (c) { + case 'I': return 1; + case 'V': return 5; + case 'X': return 10; + case 'L': return 50; + case 'C': return 100; + case 'D': return 500; + case 'M': return 1000; + default: return 0; + } +} + +int romanToInt(char* s) { + int ans = nums(s[strlen(s) - 1]); + for (int i = 0; i < (int) strlen(s) - 1; ++i) { + int sign = nums(s[i]) < nums(s[i + 1]) ? -1 : 1; + ans += sign * nums(s[i]); + } + return ans; +} diff --git a/solution/0000-0099/0014.Longest Common Prefix/README.md b/solution/0000-0099/0014.Longest Common Prefix/README.md index 5f3529f01eb2c..fceadc76296da 100644 --- a/solution/0000-0099/0014.Longest Common Prefix/README.md +++ b/solution/0000-0099/0014.Longest Common Prefix/README.md @@ -4,6 +4,7 @@ difficulty: 简单 edit_url: https://github.com/doocs/leetcode/edit/main/solution/0000-0099/0014.Longest%20Common%20Prefix/README.md tags: - 字典树 + - 数组 - 字符串 --- @@ -251,6 +252,22 @@ def longest_common_prefix(strs) end ``` +#### C + +```c +char* longestCommonPrefix(char** strs, int strsSize) { + for (int i = 0; strs[0][i]; i++) { + for (int j = 1; j < strsSize; j++) { + if (strs[j][i] != strs[0][i]) { + strs[0][i] = '\0'; + return strs[0]; + } + } + } + return strs[0]; +} +``` + diff --git a/solution/0000-0099/0014.Longest Common Prefix/README_EN.md b/solution/0000-0099/0014.Longest Common Prefix/README_EN.md index 32b3183c65f1b..0002faebd0c27 100644 --- a/solution/0000-0099/0014.Longest Common Prefix/README_EN.md +++ b/solution/0000-0099/0014.Longest Common Prefix/README_EN.md @@ -4,6 +4,7 @@ difficulty: Easy edit_url: https://github.com/doocs/leetcode/edit/main/solution/0000-0099/0014.Longest%20Common%20Prefix/README_EN.md tags: - Trie + - Array - String --- @@ -250,6 +251,22 @@ def longest_common_prefix(strs) end ``` +#### C + +```c +char* longestCommonPrefix(char** strs, int strsSize) { + for (int i = 0; strs[0][i]; i++) { + for (int j = 1; j < strsSize; j++) { + if (strs[j][i] != strs[0][i]) { + strs[0][i] = '\0'; + return strs[0]; + } + } + } + return strs[0]; +} +``` + diff --git a/solution/0000-0099/0014.Longest Common Prefix/Solution.c b/solution/0000-0099/0014.Longest Common Prefix/Solution.c new file mode 100644 index 0000000000000..5302a586083f1 --- /dev/null +++ b/solution/0000-0099/0014.Longest Common Prefix/Solution.c @@ -0,0 +1,11 @@ +char* longestCommonPrefix(char** strs, int strsSize) { + for (int i = 0; strs[0][i]; i++) { + for (int j = 1; j < strsSize; j++) { + if (strs[j][i] != strs[0][i]) { + strs[0][i] = '\0'; + return strs[0]; + } + } + } + return strs[0]; +} diff --git a/solution/0000-0099/0015.3Sum/README.md b/solution/0000-0099/0015.3Sum/README.md index 97e493065a58f..d38db88f5d3b1 100644 --- a/solution/0000-0099/0015.3Sum/README.md +++ b/solution/0000-0099/0015.3Sum/README.md @@ -453,6 +453,54 @@ class Solution { } ``` +#### C + +```c +int cmp(const void* a, const void* b) { + return *(int*) a - *(int*) b; +} + +int** threeSum(int* nums, int numsSize, int* returnSize, int** returnColumnSizes) { + *returnSize = 0; + int cap = 1000; + int** ans = (int**) malloc(sizeof(int*) * cap); + *returnColumnSizes = (int*) malloc(sizeof(int) * cap); + + qsort(nums, numsSize, sizeof(int), cmp); + + for (int i = 0; i < numsSize - 2 && nums[i] <= 0; ++i) { + if (i > 0 && nums[i] == nums[i - 1]) continue; + int j = i + 1, k = numsSize - 1; + while (j < k) { + int sum = nums[i] + nums[j] + nums[k]; + if (sum < 0) { + ++j; + } else if (sum > 0) { + --k; + } else { + if (*returnSize >= cap) { + cap *= 2; + ans = (int**) realloc(ans, sizeof(int*) * cap); + *returnColumnSizes = (int*) realloc(*returnColumnSizes, sizeof(int) * cap); + } + ans[*returnSize] = (int*) malloc(sizeof(int) * 3); + ans[*returnSize][0] = nums[i]; + ans[*returnSize][1] = nums[j]; + ans[*returnSize][2] = nums[k]; + (*returnColumnSizes)[*returnSize] = 3; + (*returnSize)++; + + ++j; + --k; + while (j < k && nums[j] == nums[j - 1]) ++j; + while (j < k && nums[k] == nums[k + 1]) --k; + } + } + } + return ans; +} +``` + diff --git a/solution/0000-0099/0015.3Sum/README_EN.md b/solution/0000-0099/0015.3Sum/README_EN.md index 9f84f4eceb78f..800479adb0a06 100644 --- a/solution/0000-0099/0015.3Sum/README_EN.md +++ b/solution/0000-0099/0015.3Sum/README_EN.md @@ -449,6 +449,54 @@ class Solution { } ``` +#### C + +```c +int cmp(const void* a, const void* b) { + return *(int*) a - *(int*) b; +} + +int** threeSum(int* nums, int numsSize, int* returnSize, int** returnColumnSizes) { + *returnSize = 0; + int cap = 1000; + int** ans = (int**) malloc(sizeof(int*) * cap); + *returnColumnSizes = (int*) malloc(sizeof(int) * cap); + + qsort(nums, numsSize, sizeof(int), cmp); + + for (int i = 0; i < numsSize - 2 && nums[i] <= 0; ++i) { + if (i > 0 && nums[i] == nums[i - 1]) continue; + int j = i + 1, k = numsSize - 1; + while (j < k) { + int sum = nums[i] + nums[j] + nums[k]; + if (sum < 0) { + ++j; + } else if (sum > 0) { + --k; + } else { + if (*returnSize >= cap) { + cap *= 2; + ans = (int**) realloc(ans, sizeof(int*) * cap); + *returnColumnSizes = (int*) realloc(*returnColumnSizes, sizeof(int) * cap); + } + ans[*returnSize] = (int*) malloc(sizeof(int) * 3); + ans[*returnSize][0] = nums[i]; + ans[*returnSize][1] = nums[j]; + ans[*returnSize][2] = nums[k]; + (*returnColumnSizes)[*returnSize] = 3; + (*returnSize)++; + + ++j; + --k; + while (j < k && nums[j] == nums[j - 1]) ++j; + while (j < k && nums[k] == nums[k + 1]) --k; + } + } + } + return ans; +} +``` + diff --git a/solution/0000-0099/0015.3Sum/Solution.c b/solution/0000-0099/0015.3Sum/Solution.c new file mode 100644 index 0000000000000..cce897d4a81cd --- /dev/null +++ b/solution/0000-0099/0015.3Sum/Solution.c @@ -0,0 +1,43 @@ +int cmp(const void* a, const void* b) { + return *(int*) a - *(int*) b; +} + +int** threeSum(int* nums, int numsSize, int* returnSize, int** returnColumnSizes) { + *returnSize = 0; + int cap = 1000; + int** ans = (int**) malloc(sizeof(int*) * cap); + *returnColumnSizes = (int*) malloc(sizeof(int) * cap); + + qsort(nums, numsSize, sizeof(int), cmp); + + for (int i = 0; i < numsSize - 2 && nums[i] <= 0; ++i) { + if (i > 0 && nums[i] == nums[i - 1]) continue; + int j = i + 1, k = numsSize - 1; + while (j < k) { + int sum = nums[i] + nums[j] + nums[k]; + if (sum < 0) { + ++j; + } else if (sum > 0) { + --k; + } else { + if (*returnSize >= cap) { + cap *= 2; + ans = (int**) realloc(ans, sizeof(int*) * cap); + *returnColumnSizes = (int*) realloc(*returnColumnSizes, sizeof(int) * cap); + } + ans[*returnSize] = (int*) malloc(sizeof(int) * 3); + ans[*returnSize][0] = nums[i]; + ans[*returnSize][1] = nums[j]; + ans[*returnSize][2] = nums[k]; + (*returnColumnSizes)[*returnSize] = 3; + (*returnSize)++; + + ++j; + --k; + while (j < k && nums[j] == nums[j - 1]) ++j; + while (j < k && nums[k] == nums[k + 1]) --k; + } + } + } + return ans; +} diff --git a/solution/0000-0099/0016.3Sum Closest/README.md b/solution/0000-0099/0016.3Sum Closest/README.md index 26a419cdec0e9..c724790896aff 100644 --- a/solution/0000-0099/0016.3Sum Closest/README.md +++ b/solution/0000-0099/0016.3Sum Closest/README.md @@ -242,6 +242,36 @@ var threeSumClosest = function (nums, target) { }; ``` +#### C# + +```cs +public class Solution { + public int ThreeSumClosest(int[] nums, int target) { + Array.Sort(nums); + int ans = 1 << 30; + int n = nums.Length; + for (int i = 0; i < n; ++i) { + int j = i + 1, k = n - 1; + while (j < k) { + int t = nums[i] + nums[j] + nums[k]; + if (t == target) { + return t; + } + if (Math.Abs(t - target) < Math.Abs(ans - target)) { + ans = t; + } + if (t > target) { + --k; + } else { + ++j; + } + } + } + return ans; + } +} +``` + #### PHP ```php @@ -285,6 +315,37 @@ class Solution { } ``` +#### C + +```c +int cmp(const void* a, const void* b) { + return (*(int*) a - *(int*) b); +} + +int threeSumClosest(int* nums, int numsSize, int target) { + qsort(nums, numsSize, sizeof(int), cmp); + int ans = 1 << 30; + for (int i = 0; i < numsSize; ++i) { + int j = i + 1, k = numsSize - 1; + while (j < k) { + int t = nums[i] + nums[j] + nums[k]; + if (t == target) { + return t; + } + if (abs(t - target) < abs(ans - target)) { + ans = t; + } + if (t > target) { + --k; + } else { + ++j; + } + } + } + return ans; +} +``` + diff --git a/solution/0000-0099/0016.3Sum Closest/README_EN.md b/solution/0000-0099/0016.3Sum Closest/README_EN.md index 92375933a0907..3366410926aee 100644 --- a/solution/0000-0099/0016.3Sum Closest/README_EN.md +++ b/solution/0000-0099/0016.3Sum Closest/README_EN.md @@ -241,6 +241,36 @@ var threeSumClosest = function (nums, target) { }; ``` +#### C# + +```cs +public class Solution { + public int ThreeSumClosest(int[] nums, int target) { + Array.Sort(nums); + int ans = 1 << 30; + int n = nums.Length; + for (int i = 0; i < n; ++i) { + int j = i + 1, k = n - 1; + while (j < k) { + int t = nums[i] + nums[j] + nums[k]; + if (t == target) { + return t; + } + if (Math.Abs(t - target) < Math.Abs(ans - target)) { + ans = t; + } + if (t > target) { + --k; + } else { + ++j; + } + } + } + return ans; + } +} +``` + #### PHP ```php @@ -284,6 +314,37 @@ class Solution { } ``` +#### C + +```c +int cmp(const void* a, const void* b) { + return (*(int*) a - *(int*) b); +} + +int threeSumClosest(int* nums, int numsSize, int target) { + qsort(nums, numsSize, sizeof(int), cmp); + int ans = 1 << 30; + for (int i = 0; i < numsSize; ++i) { + int j = i + 1, k = numsSize - 1; + while (j < k) { + int t = nums[i] + nums[j] + nums[k]; + if (t == target) { + return t; + } + if (abs(t - target) < abs(ans - target)) { + ans = t; + } + if (t > target) { + --k; + } else { + ++j; + } + } + } + return ans; +} +``` + diff --git a/solution/0000-0099/0016.3Sum Closest/Solution.c b/solution/0000-0099/0016.3Sum Closest/Solution.c new file mode 100644 index 0000000000000..778c1a2aca594 --- /dev/null +++ b/solution/0000-0099/0016.3Sum Closest/Solution.c @@ -0,0 +1,26 @@ +int cmp(const void* a, const void* b) { + return (*(int*) a - *(int*) b); +} + +int threeSumClosest(int* nums, int numsSize, int target) { + qsort(nums, numsSize, sizeof(int), cmp); + int ans = 1 << 30; + for (int i = 0; i < numsSize; ++i) { + int j = i + 1, k = numsSize - 1; + while (j < k) { + int t = nums[i] + nums[j] + nums[k]; + if (t == target) { + return t; + } + if (abs(t - target) < abs(ans - target)) { + ans = t; + } + if (t > target) { + --k; + } else { + ++j; + } + } + } + return ans; +} diff --git a/solution/0000-0099/0016.3Sum Closest/Solution.cs b/solution/0000-0099/0016.3Sum Closest/Solution.cs new file mode 100644 index 0000000000000..d58947aab214b --- /dev/null +++ b/solution/0000-0099/0016.3Sum Closest/Solution.cs @@ -0,0 +1,25 @@ +public class Solution { + public int ThreeSumClosest(int[] nums, int target) { + Array.Sort(nums); + int ans = 1 << 30; + int n = nums.Length; + for (int i = 0; i < n; ++i) { + int j = i + 1, k = n - 1; + while (j < k) { + int t = nums[i] + nums[j] + nums[k]; + if (t == target) { + return t; + } + if (Math.Abs(t - target) < Math.Abs(ans - target)) { + ans = t; + } + if (t > target) { + --k; + } else { + ++j; + } + } + } + return ans; + } +} \ No newline at end of file diff --git a/solution/0000-0099/0017.Letter Combinations of a Phone Number/README.md b/solution/0000-0099/0017.Letter Combinations of a Phone Number/README.md index a8ca434436f2e..6f1223d12ac1f 100644 --- a/solution/0000-0099/0017.Letter Combinations of a Phone Number/README.md +++ b/solution/0000-0099/0017.Letter Combinations of a Phone Number/README.md @@ -22,7 +22,7 @@ tags:给出数字到字母的映射如下（与电话按键相同）。注意 1 不对应任何字母。
-
@@ -555,6 +555,48 @@ class Solution { } ``` +#### C + +```c +char* d[] = {"abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"}; + +char** letterCombinations(char* digits, int* returnSize) { + if (!*digits) { + *returnSize = 0; + return NULL; + } + + int size = 1; + char** ans = (char**) malloc(sizeof(char*)); + ans[0] = strdup(""); + + for (int x = 0; digits[x]; ++x) { + char* s = d[digits[x] - '2']; + int len = strlen(s); + char** t = (char**) malloc(sizeof(char*) * size * len); + int tSize = 0; + + for (int i = 0; i < size; ++i) { + for (int j = 0; j < len; ++j) { + int oldLen = strlen(ans[i]); + char* tmp = (char*) malloc(oldLen + 2); + strcpy(tmp, ans[i]); + tmp[oldLen] = s[j]; + tmp[oldLen + 1] = '\0'; + t[tSize++] = tmp; + } + free(ans[i]); + } + free(ans); + ans = t; + size = tSize; + } + + *returnSize = size; + return ans; +} +``` + diff --git a/solution/0000-0099/0017.Letter Combinations of a Phone Number/README_EN.md b/solution/0000-0099/0017.Letter Combinations of a Phone Number/README_EN.md index ffad07737163e..dba840d7bd8ee 100644 --- a/solution/0000-0099/0017.Letter Combinations of a Phone Number/README_EN.md +++ b/solution/0000-0099/0017.Letter Combinations of a Phone Number/README_EN.md @@ -551,6 +551,48 @@ class Solution { } ``` +#### C + +```c +char* d[] = {"abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"}; + +char** letterCombinations(char* digits, int* returnSize) { + if (!*digits) { + *returnSize = 0; + return NULL; + } + + int size = 1; + char** ans = (char**) malloc(sizeof(char*)); + ans[0] = strdup(""); + + for (int x = 0; digits[x]; ++x) { + char* s = d[digits[x] - '2']; + int len = strlen(s); + char** t = (char**) malloc(sizeof(char*) * size * len); + int tSize = 0; + + for (int i = 0; i < size; ++i) { + for (int j = 0; j < len; ++j) { + int oldLen = strlen(ans[i]); + char* tmp = (char*) malloc(oldLen + 2); + strcpy(tmp, ans[i]); + tmp[oldLen] = s[j]; + tmp[oldLen + 1] = '\0'; + t[tSize++] = tmp; + } + free(ans[i]); + } + free(ans); + ans = t; + size = tSize; + } + + *returnSize = size; + return ans; +} +``` + diff --git a/solution/0000-0099/0017.Letter Combinations of a Phone Number/Solution.c b/solution/0000-0099/0017.Letter Combinations of a Phone Number/Solution.c new file mode 100644 index 0000000000000..e02c971a3a8c6 --- /dev/null +++ b/solution/0000-0099/0017.Letter Combinations of a Phone Number/Solution.c @@ -0,0 +1,37 @@ +char* d[] = {"abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"}; + +char** letterCombinations(char* digits, int* returnSize) { + if (!*digits) { + *returnSize = 0; + return NULL; + } + + int size = 1; + char** ans = (char**) malloc(sizeof(char*)); + ans[0] = strdup(""); + + for (int x = 0; digits[x]; ++x) { + char* s = d[digits[x] - '2']; + int len = strlen(s); + char** t = (char**) malloc(sizeof(char*) * size * len); + int tSize = 0; + + for (int i = 0; i < size; ++i) { + for (int j = 0; j < len; ++j) { + int oldLen = strlen(ans[i]); + char* tmp = (char*) malloc(oldLen + 2); + strcpy(tmp, ans[i]); + tmp[oldLen] = s[j]; + tmp[oldLen + 1] = '\0'; + t[tSize++] = tmp; + } + free(ans[i]); + } + free(ans); + ans = t; + size = tSize; + } + + *returnSize = size; + return ans; +} diff --git a/solution/0000-0099/0017.Letter Combinations of a Phone Number/images/1200px-telephone-keypad2svg.png b/solution/0000-0099/0017.Letter Combinations of a Phone Number/images/1200px-telephone-keypad2svg.png new file mode 100644 index 0000000000000..cbf69ae96598d Binary files /dev/null and b/solution/0000-0099/0017.Letter Combinations of a Phone Number/images/1200px-telephone-keypad2svg.png differ diff --git a/solution/0000-0099/0017.Letter Combinations of a Phone Number/images/1752723054-mfIHZs-image.png b/solution/0000-0099/0017.Letter Combinations of a Phone Number/images/1752723054-mfIHZs-image.png new file mode 100644 index 0000000000000..e4d9a76bfe05c Binary files /dev/null and b/solution/0000-0099/0017.Letter Combinations of a Phone Number/images/1752723054-mfIHZs-image.png differ diff --git a/solution/0000-0099/0017.Letter Combinations of a Phone Number/images/17_telephone_keypad.png b/solution/0000-0099/0017.Letter Combinations of a Phone Number/images/17_telephone_keypad.png deleted file mode 100644 index ef7a0bffee3e2..0000000000000 Binary files a/solution/0000-0099/0017.Letter Combinations of a Phone Number/images/17_telephone_keypad.png and /dev/null differ diff --git a/solution/0000-0099/0017.Letter Combinations of a Phone Number/images/200px-Telephone-keypad2.svg.png b/solution/0000-0099/0017.Letter Combinations of a Phone Number/images/200px-Telephone-keypad2.svg.png deleted file mode 100644 index 38764028d1835..0000000000000 Binary files a/solution/0000-0099/0017.Letter Combinations of a Phone Number/images/200px-Telephone-keypad2.svg.png and /dev/null differ diff --git a/solution/0000-0099/0017.Letter Combinations of a Phone Number/images/200px-telephone-keypad2svg.png b/solution/0000-0099/0017.Letter Combinations of a Phone Number/images/200px-telephone-keypad2svg.png deleted file mode 100644 index 38764028d1835..0000000000000 Binary files a/solution/0000-0099/0017.Letter Combinations of a Phone Number/images/200px-telephone-keypad2svg.png and /dev/null differ diff --git a/solution/0000-0099/0019.Remove Nth Node From End of List/README.md b/solution/0000-0099/0019.Remove Nth Node From End of List/README.md index e9931cdde2d49..151c80eb0c329 100644 --- a/solution/0000-0099/0019.Remove Nth Node From End of List/README.md +++ b/solution/0000-0099/0019.Remove Nth Node From End of List/README.md @@ -280,7 +280,7 @@ var removeNthFromEnd = function (head, n) { #### Swift -````swift +```swift /** * Definition for singly-linked list. * public class ListNode { @@ -340,6 +340,37 @@ def remove_nth_from_end(head, n) end ``` +#### C# + +```cs +/** + * Definition for singly-linked list. + * public class ListNode { + * public int val; + * public ListNode next; + * public ListNode(int val=0, ListNode next=null) { + * this.val = val; + * this.next = next; + * } + * } + */ +public class Solution { + public ListNode RemoveNthFromEnd(ListNode head, int n) { + ListNode dummy = new ListNode(0, head); + ListNode fast = dummy, slow = dummy; + while (n-- > 0) { + fast = fast.next; + } + while (fast.next != null) { + slow = slow.next; + fast = fast.next; + } + slow.next = slow.next.next; + return dummy.next; + } +} +``` + #### PHP ```php @@ -381,4 +412,3 @@ class Solution { -```` diff --git a/solution/0000-0099/0019.Remove Nth Node From End of List/README_EN.md b/solution/0000-0099/0019.Remove Nth Node From End of List/README_EN.md index 6c85e356c3109..3905ab6e2d5de 100644 --- a/solution/0000-0099/0019.Remove Nth Node From End of List/README_EN.md +++ b/solution/0000-0099/0019.Remove Nth Node From End of List/README_EN.md @@ -277,7 +277,7 @@ var removeNthFromEnd = function (head, n) { #### Swift -````swift +```swift /** * Definition for singly-linked list. * public class ListNode { @@ -337,6 +337,37 @@ def remove_nth_from_end(head, n) end ``` +#### C# + +```cs +/** + * Definition for singly-linked list. + * public class ListNode { + * public int val; + * public ListNode next; + * public ListNode(int val=0, ListNode next=null) { + * this.val = val; + * this.next = next; + * } + * } + */ +public class Solution { + public ListNode RemoveNthFromEnd(ListNode head, int n) { + ListNode dummy = new ListNode(0, head); + ListNode fast = dummy, slow = dummy; + while (n-- > 0) { + fast = fast.next; + } + while (fast.next != null) { + slow = slow.next; + fast = fast.next; + } + slow.next = slow.next.next; + return dummy.next; + } +} +``` + #### PHP ```php @@ -378,4 +409,3 @@ class Solution { -```` diff --git a/solution/0000-0099/0019.Remove Nth Node From End of List/Solution.cs b/solution/0000-0099/0019.Remove Nth Node From End of List/Solution.cs new file mode 100644 index 0000000000000..fe8e8f8c798e3 --- /dev/null +++ b/solution/0000-0099/0019.Remove Nth Node From End of List/Solution.cs @@ -0,0 +1,26 @@ +/** + * Definition for singly-linked list. + * public class ListNode { + * public int val; + * public ListNode next; + * public ListNode(int val=0, ListNode next=null) { + * this.val = val; + * this.next = next; + * } + * } + */ +public class Solution { + public ListNode RemoveNthFromEnd(ListNode head, int n) { + ListNode dummy = new ListNode(0, head); + ListNode fast = dummy, slow = dummy; + while (n-- > 0) { + fast = fast.next; + } + while (fast.next != null) { + slow = slow.next; + fast = fast.next; + } + slow.next = slow.next.next; + return dummy.next; + } +} \ No newline at end of file diff --git a/solution/0000-0099/0020.Valid Parentheses/README.md b/solution/0000-0099/0020.Valid Parentheses/README.md index e4c364fe798a6..d09f9eda8a015 100644 --- a/solution/0000-0099/0020.Valid Parentheses/README.md +++ b/solution/0000-0099/0020.Valid Parentheses/README.md @@ -61,6 +61,14 @@ tags:
输出：true
+示例 5：
+ +输入：s = "([)]"
+ +输出：false
+
提示：
diff --git a/solution/0000-0099/0020.Valid Parentheses/README_EN.md b/solution/0000-0099/0020.Valid Parentheses/README_EN.md index cf0fc8a16deba..24c94a545cabb 100644 --- a/solution/0000-0099/0020.Valid Parentheses/README_EN.md +++ b/solution/0000-0099/0020.Valid Parentheses/README_EN.md @@ -60,6 +60,14 @@ tags:Output: true
+Example 5:
+ +Input: s = "([)]"
+ +Output: false
+
Constraints:
diff --git a/solution/0000-0099/0021.Merge Two Sorted Lists/README.md b/solution/0000-0099/0021.Merge Two Sorted Lists/README.md index 264c42ada1421..e38399664ae75 100644 --- a/solution/0000-0099/0021.Merge Two Sorted Lists/README.md +++ b/solution/0000-0099/0021.Merge Two Sorted Lists/README.md @@ -295,24 +295,19 @@ var mergeTwoLists = function (list1, list2) { */ public class Solution { public ListNode MergeTwoLists(ListNode list1, ListNode list2) { - ListNode dummy = new ListNode(); - ListNode cur = dummy; - while (list1 != null && list2 != null) - { - if (list1.val <= list2.val) - { - cur.next = list1; - list1 = list1.next; - } - else - { - cur.next = list2; - list2 = list2.next; - } - cur = cur.next; + if (list1 == null) { + return list2; + } + if (list2 == null) { + return list1; + } + if (list1.val <= list2.val) { + list1.next = MergeTwoLists(list1.next, list2); + return list1; + } else { + list2.next = MergeTwoLists(list1, list2.next); + return list2; } - cur.next = list1 == null ? list2 : list1; - return dummy.next; } } ``` @@ -332,23 +327,60 @@ public class Solution { # @param {ListNode} list2 # @return {ListNode} def merge_two_lists(list1, list2) - dummy = ListNode.new() - cur = dummy - while list1 && list2 - if list1.val <= list2.val - cur.next = list1 - list1 = list1.next - else - cur.next = list2 - list2 = list2.next - end - cur = cur.next + if list1.nil? + return list2 + end + if list2.nil? + return list1 + end + if list1.val <= list2.val + list1.next = merge_two_lists(list1.next, list2) + return list1 + else + list2.next = merge_two_lists(list1, list2.next) + return list2 end - cur.next = list1 || list2 - dummy.next end ``` +#### PHP + +```php +/** + * Definition for a singly-linked list. + * class ListNode { + * public $val = 0; + * public $next = null; + * function __construct($val = 0, $next = null) { + * $this->val = $val; + * $this->next = $next; + * } + * } + */ +class Solution { + /** + * @param ListNode $list1 + * @param ListNode $list2 + * @return ListNode + */ + function mergeTwoLists($list1, $list2) { + if (is_null($list1)) { + return $list2; + } + if (is_null($list2)) { + return $list1; + } + if ($list1->val <= $list2->val) { + $list1->next = $this->mergeTwoLists($list1->next, $list2); + return $list1; + } else { + $list2->next = $this->mergeTwoLists($list1, $list2->next); + return $list2; + } + } +} +``` + @@ -603,6 +635,72 @@ var mergeTwoLists = function (list1, list2) { }; ``` +#### C# + +```cs +/** + * Definition for singly-linked list. + * public class ListNode { + * public int val; + * public ListNode next; + * public ListNode(int val=0, ListNode next=null) { + * this.val = val; + * this.next = next; + * } + * } + */ +public class Solution { + public ListNode MergeTwoLists(ListNode list1, ListNode list2) { + ListNode dummy = new ListNode(); + ListNode curr = dummy; + while (list1 != null && list2 != null) { + if (list1.val <= list2.val) { + curr.next = list1; + list1 = list1.next; + } else { + curr.next = list2; + list2 = list2.next; + } + curr = curr.next; + } + curr.next = list1 == null ? list2 : list1; + return dummy.next; + } +} +``` + +#### Ruby + +```rb +# Definition for singly-linked list. +# class ListNode +# attr_accessor :val, :next +# def initialize(val = 0, _next = nil) +# @val = val +# @next = _next +# end +# end +# @param {ListNode} list1 +# @param {ListNode} list2 +# @return {ListNode} +def merge_two_lists(list1, list2) + dummy = ListNode.new() + cur = dummy + while list1 && list2 + if list1.val <= list2.val + cur.next = list1 + list1 = list1.next + else + cur.next = list2 + list2 = list2.next + end + cur = cur.next + end + cur.next = list1 || list2 + dummy.next +end +``` + #### PHP ```php @@ -616,18 +714,15 @@ var mergeTwoLists = function (list1, list2) { # $this->next = $next; # } # } - class Solution { /** * @param ListNode $list1 * @param ListNode $list2 * @return ListNode */ - function mergeTwoLists($list1, $list2) { $dummy = new ListNode(0); $current = $dummy; - while ($list1 != null && $list2 != null) { if ($list1->val <= $list2->val) { $current->next = $list1; diff --git a/solution/0000-0099/0021.Merge Two Sorted Lists/README_EN.md b/solution/0000-0099/0021.Merge Two Sorted Lists/README_EN.md index 1aaa040d75715..5813dda5912a8 100644 --- a/solution/0000-0099/0021.Merge Two Sorted Lists/README_EN.md +++ b/solution/0000-0099/0021.Merge Two Sorted Lists/README_EN.md @@ -297,24 +297,19 @@ var mergeTwoLists = function (list1, list2) { */ public class Solution { public ListNode MergeTwoLists(ListNode list1, ListNode list2) { - ListNode dummy = new ListNode(); - ListNode cur = dummy; - while (list1 != null && list2 != null) - { - if (list1.val <= list2.val) - { - cur.next = list1; - list1 = list1.next; - } - else - { - cur.next = list2; - list2 = list2.next; - } - cur = cur.next; + if (list1 == null) { + return list2; + } + if (list2 == null) { + return list1; + } + if (list1.val <= list2.val) { + list1.next = MergeTwoLists(list1.next, list2); + return list1; + } else { + list2.next = MergeTwoLists(list1, list2.next); + return list2; } - cur.next = list1 == null ? list2 : list1; - return dummy.next; } } ``` @@ -334,23 +329,60 @@ public class Solution { # @param {ListNode} list2 # @return {ListNode} def merge_two_lists(list1, list2) - dummy = ListNode.new() - cur = dummy - while list1 && list2 - if list1.val <= list2.val - cur.next = list1 - list1 = list1.next - else - cur.next = list2 - list2 = list2.next - end - cur = cur.next + if list1.nil? + return list2 + end + if list2.nil? + return list1 + end + if list1.val <= list2.val + list1.next = merge_two_lists(list1.next, list2) + return list1 + else + list2.next = merge_two_lists(list1, list2.next) + return list2 end - cur.next = list1 || list2 - dummy.next end ``` +#### PHP + +```php +/** + * Definition for a singly-linked list. + * class ListNode { + * public $val = 0; + * public $next = null; + * function __construct($val = 0, $next = null) { + * $this->val = $val; + * $this->next = $next; + * } + * } + */ +class Solution { + /** + * @param ListNode $list1 + * @param ListNode $list2 + * @return ListNode + */ + function mergeTwoLists($list1, $list2) { + if (is_null($list1)) { + return $list2; + } + if (is_null($list2)) { + return $list1; + } + if ($list1->val <= $list2->val) { + $list1->next = $this->mergeTwoLists($list1->next, $list2); + return $list1; + } else { + $list2->next = $this->mergeTwoLists($list1, $list2->next); + return $list2; + } + } +} +``` + @@ -605,6 +637,72 @@ var mergeTwoLists = function (list1, list2) { }; ``` +#### C# + +```cs +/** + * Definition for singly-linked list. + * public class ListNode { + * public int val; + * public ListNode next; + * public ListNode(int val=0, ListNode next=null) { + * this.val = val; + * this.next = next; + * } + * } + */ +public class Solution { + public ListNode MergeTwoLists(ListNode list1, ListNode list2) { + ListNode dummy = new ListNode(); + ListNode curr = dummy; + while (list1 != null && list2 != null) { + if (list1.val <= list2.val) { + curr.next = list1; + list1 = list1.next; + } else { + curr.next = list2; + list2 = list2.next; + } + curr = curr.next; + } + curr.next = list1 == null ? list2 : list1; + return dummy.next; + } +} +``` + +#### Ruby + +```rb +# Definition for singly-linked list. +# class ListNode +# attr_accessor :val, :next +# def initialize(val = 0, _next = nil) +# @val = val +# @next = _next +# end +# end +# @param {ListNode} list1 +# @param {ListNode} list2 +# @return {ListNode} +def merge_two_lists(list1, list2) + dummy = ListNode.new() + cur = dummy + while list1 && list2 + if list1.val <= list2.val + cur.next = list1 + list1 = list1.next + else + cur.next = list2 + list2 = list2.next + end + cur = cur.next + end + cur.next = list1 || list2 + dummy.next +end +``` + #### PHP ```php @@ -618,18 +716,15 @@ var mergeTwoLists = function (list1, list2) { # $this->next = $next; # } # } - class Solution { /** * @param ListNode $list1 * @param ListNode $list2 * @return ListNode */ - function mergeTwoLists($list1, $list2) { $dummy = new ListNode(0); $current = $dummy; - while ($list1 != null && $list2 != null) { if ($list1->val <= $list2->val) { $current->next = $list1; diff --git a/solution/0000-0099/0021.Merge Two Sorted Lists/Solution.cs b/solution/0000-0099/0021.Merge Two Sorted Lists/Solution.cs index f51146a70d7d9..c5cf87486fe07 100644 --- a/solution/0000-0099/0021.Merge Two Sorted Lists/Solution.cs +++ b/solution/0000-0099/0021.Merge Two Sorted Lists/Solution.cs @@ -11,23 +11,18 @@ */ public class Solution { public ListNode MergeTwoLists(ListNode list1, ListNode list2) { - ListNode dummy = new ListNode(); - ListNode cur = dummy; - while (list1 != null && list2 != null) - { - if (list1.val <= list2.val) - { - cur.next = list1; - list1 = list1.next; - } - else - { - cur.next = list2; - list2 = list2.next; - } - cur = cur.next; + if (list1 == null) { + return list2; + } + if (list2 == null) { + return list1; + } + if (list1.val <= list2.val) { + list1.next = MergeTwoLists(list1.next, list2); + return list1; + } else { + list2.next = MergeTwoLists(list1, list2.next); + return list2; } - cur.next = list1 == null ? list2 : list1; - return dummy.next; } -} +} \ No newline at end of file diff --git a/solution/0000-0099/0021.Merge Two Sorted Lists/Solution.php b/solution/0000-0099/0021.Merge Two Sorted Lists/Solution.php index 43c1e40cec909..5ba6c289539bf 100644 --- a/solution/0000-0099/0021.Merge Two Sorted Lists/Solution.php +++ b/solution/0000-0099/0021.Merge Two Sorted Lists/Solution.php @@ -1,40 +1,34 @@ -# Definition for singly-linked list. -# class ListNode { -# public $val; -# public $next; -# public function __construct($val = 0, $next = null) -# { -# $this->val = $val; -# $this->next = $next; -# } -# } - +/** + * Definition for a singly-linked list. + * class ListNode { + * public $val = 0; + * public $next = null; + * function __construct($val = 0, $next = null) { + * $this->val = $val; + * $this->next = $next; + * } + * } + */ class Solution { + /** * @param ListNode $list1 * @param ListNode $list2 * @return ListNode */ - function mergeTwoLists($list1, $list2) { - $dummy = new ListNode(0); - $current = $dummy; - - while ($list1 != null && $list2 != null) { - if ($list1->val <= $list2->val) { - $current->next = $list1; - $list1 = $list1->next; - } else { - $current->next = $list2; - $list2 = $list2->next; - } - $current = $current->next; + if (is_null($list1)) { + return $list2; + } + if (is_null($list2)) { + return $list1; } - if ($list1 != null) { - $current->next = $list1; - } elseif ($list2 != null) { - $current->next = $list2; + if ($list1->val <= $list2->val) { + $list1->next = $this->mergeTwoLists($list1->next, $list2); + return $list1; + } else { + $list2->next = $this->mergeTwoLists($list1, $list2->next); + return $list2; } - return $dummy->next; } -} +} \ No newline at end of file diff --git a/solution/0000-0099/0021.Merge Two Sorted Lists/Solution.rb b/solution/0000-0099/0021.Merge Two Sorted Lists/Solution.rb index f27273d9fd652..db48f5d196b65 100644 --- a/solution/0000-0099/0021.Merge Two Sorted Lists/Solution.rb +++ b/solution/0000-0099/0021.Merge Two Sorted Lists/Solution.rb @@ -10,18 +10,17 @@ # @param {ListNode} list2 # @return {ListNode} def merge_two_lists(list1, list2) - dummy = ListNode.new() - cur = dummy - while list1 && list2 - if list1.val <= list2.val - cur.next = list1 - list1 = list1.next - else - cur.next = list2 - list2 = list2.next - end - cur = cur.next + if list1.nil? + return list2 end - cur.next = list1 || list2 - dummy.next -end + if list2.nil? + return list1 + end + if list1.val <= list2.val + list1.next = merge_two_lists(list1.next, list2) + return list1 + else + list2.next = merge_two_lists(list1, list2.next) + return list2 + end +end \ No newline at end of file diff --git a/solution/0000-0099/0021.Merge Two Sorted Lists/Solution2.cs b/solution/0000-0099/0021.Merge Two Sorted Lists/Solution2.cs new file mode 100644 index 0000000000000..53d85f2d7f0fa --- /dev/null +++ b/solution/0000-0099/0021.Merge Two Sorted Lists/Solution2.cs @@ -0,0 +1,29 @@ +/** + * Definition for singly-linked list. + * public class ListNode { + * public int val; + * public ListNode next; + * public ListNode(int val=0, ListNode next=null) { + * this.val = val; + * this.next = next; + * } + * } + */ +public class Solution { + public ListNode MergeTwoLists(ListNode list1, ListNode list2) { + ListNode dummy = new ListNode(); + ListNode curr = dummy; + while (list1 != null && list2 != null) { + if (list1.val <= list2.val) { + curr.next = list1; + list1 = list1.next; + } else { + curr.next = list2; + list2 = list2.next; + } + curr = curr.next; + } + curr.next = list1 == null ? list2 : list1; + return dummy.next; + } +} \ No newline at end of file diff --git a/solution/0000-0099/0021.Merge Two Sorted Lists/Solution2.php b/solution/0000-0099/0021.Merge Two Sorted Lists/Solution2.php new file mode 100644 index 0000000000000..375be195d3815 --- /dev/null +++ b/solution/0000-0099/0021.Merge Two Sorted Lists/Solution2.php @@ -0,0 +1,37 @@ +# Definition for singly-linked list. +# class ListNode { +# public $val; +# public $next; +# public function __construct($val = 0, $next = null) +# { +# $this->val = $val; +# $this->next = $next; +# } +# } +class Solution { + /** + * @param ListNode $list1 + * @param ListNode $list2 + * @return ListNode + */ + function mergeTwoLists($list1, $list2) { + $dummy = new ListNode(0); + $current = $dummy; + while ($list1 != null && $list2 != null) { + if ($list1->val <= $list2->val) { + $current->next = $list1; + $list1 = $list1->next; + } else { + $current->next = $list2; + $list2 = $list2->next; + } + $current = $current->next; + } + if ($list1 != null) { + $current->next = $list1; + } elseif ($list2 != null) { + $current->next = $list2; + } + return $dummy->next; + } +} diff --git a/solution/0000-0099/0021.Merge Two Sorted Lists/Solution2.rb b/solution/0000-0099/0021.Merge Two Sorted Lists/Solution2.rb new file mode 100644 index 0000000000000..f27273d9fd652 --- /dev/null +++ b/solution/0000-0099/0021.Merge Two Sorted Lists/Solution2.rb @@ -0,0 +1,27 @@ +# Definition for singly-linked list. +# class ListNode +# attr_accessor :val, :next +# def initialize(val = 0, _next = nil) +# @val = val +# @next = _next +# end +# end +# @param {ListNode} list1 +# @param {ListNode} list2 +# @return {ListNode} +def merge_two_lists(list1, list2) + dummy = ListNode.new() + cur = dummy + while list1 && list2 + if list1.val <= list2.val + cur.next = list1 + list1 = list1.next + else + cur.next = list2 + list2 = list2.next + end + cur = cur.next + end + cur.next = list1 || list2 + dummy.next +end diff --git a/solution/0000-0099/0022.Generate Parentheses/README.md b/solution/0000-0099/0022.Generate Parentheses/README.md index 5dd9d47a628aa..b470955a10c8a 100644 --- a/solution/0000-0099/0022.Generate Parentheses/README.md +++ b/solution/0000-0099/0022.Generate Parentheses/README.md @@ -225,6 +225,33 @@ var generateParenthesis = function (n) { }; ``` +#### C# + +```cs +public class Solution { + private List给你一个只包含 '(' 和 ')' 的字符串，找出最长有效（格式正确且连续）括号子串的长度。
给你一个只包含 '(' 和 ')' 的字符串，找出最长有效（格式正确且连续）括号 子串 的长度。
左右括号匹配，即每个左括号都有对应的右括号将其闭合的字符串是格式正确的，比如 "(()())"。
diff --git a/solution/0000-0099/0033.Search in Rotated Sorted Array/README.md b/solution/0000-0099/0033.Search in Rotated Sorted Array/README.md index 77320242b4963..055329f700460 100644 --- a/solution/0000-0099/0033.Search in Rotated Sorted Array/README.md +++ b/solution/0000-0099/0033.Search in Rotated Sorted Array/README.md @@ -19,7 +19,7 @@ tags:
整数数组 nums 按升序排列，数组中的值 互不相同 。
在传递给函数之前，nums 在预先未知的某个下标 k（0 <= k < nums.length）上进行了 旋转，使数组变为 [nums[k], nums[k+1], ..., nums[n-1], nums[0], nums[1], ..., nums[k-1]]（下标 从 0 开始 计数）。例如， [0,1,2,4,5,6,7] 在下标 3 处经旋转后可能变为 [4,5,6,7,0,1,2] 。
在传递给函数之前，nums 在预先未知的某个下标 k（0 <= k < nums.length）上进行了 旋转，使数组变为 [nums[k], nums[k+1], ..., nums[n-1], nums[0], nums[1], ..., nums[k-1]]（下标 从 0 开始 计数）。例如， [0,1,2,4,5,6,7] 向左旋转 3 次后可能变为 [4,5,6,7,0,1,2] 。
给你 旋转后 的数组 nums 和一个整数 target ，如果 nums 中存在这个目标值 target ，则返回它的下标，否则返回 -1 。
There is an integer array nums sorted in ascending order (with distinct values).
Prior to being passed to your function, nums is possibly rotated at an unknown pivot index k (1 <= k < nums.length) such that the resulting array is [nums[k], nums[k+1], ..., nums[n-1], nums[0], nums[1], ..., nums[k-1]] (0-indexed). For example, [0,1,2,4,5,6,7] might be rotated at pivot index 3 and become [4,5,6,7,0,1,2].
Prior to being passed to your function, nums is possibly left rotated at an unknown index k (1 <= k < nums.length) such that the resulting array is [nums[k], nums[k+1], ..., nums[n-1], nums[0], nums[1], ..., nums[k-1]] (0-indexed). For example, [0,1,2,4,5,6,7] might be left rotated by 3 indices and become [4,5,6,7,0,1,2].
Given the array nums after the possible rotation and an integer target, return the index of target if it is in nums, or -1 if it is not in nums.
给定一个长度为 n 的 0 索引整数数组 nums。初始位置为 nums[0]。
每个元素 nums[i] 表示从索引 i 向后跳转的最大长度。换句话说，如果你在 nums[i] 处，你可以跳转到任意 nums[i + j] 处:
每个元素 nums[i] 表示从索引 i 向后跳转的最大长度。换句话说，如果你在索引 i 处，你可以跳转到任意 (i + j) 处：
0 <= j <= nums[i] 0 <= j <= nums[i] 且i + j < n返回到达 nums[n - 1] 的最小跳跃次数。生成的测试用例可以到达 nums[n - 1]。
返回到达 n - 1 的最小跳跃次数。测试用例保证可以到达 n - 1。
@@ -54,7 +54,7 @@ tags:
1 <= nums.length <= 1040 <= nums[i] <= 1000nums[n-1]n - 1You are given a 0-indexed array of integers nums of length n. You are initially positioned at nums[0].
You are given a 0-indexed array of integers nums of length n. You are initially positioned at index 0.
Each element nums[i] represents the maximum length of a forward jump from index i. In other words, if you are at nums[i], you can jump to any nums[i + j] where:
Each element nums[i] represents the maximum length of a forward jump from index i. In other words, if you are at index i, you can jump to any index (i + j) where:
0 <= j <= nums[i] andi + j < nReturn the minimum number of jumps to reach nums[n - 1]. The test cases are generated such that you can reach nums[n - 1].
Return the minimum number of jumps to reach index n - 1. The test cases are generated such that you can reach index n - 1.
Example 1:
@@ -166,18 +166,17 @@ function jump(nums: number[]): number { ```rust impl Solution { pub fn jump(nums: Vec给你一个字符串数组，请你将 字母异位词 组合在一起。可以按任意顺序返回结果列表。
- -字母异位词 是由重新排列源单词的所有字母得到的一个新单词。
+给你一个字符串数组，请你将 字母异位词 组合在一起。可以按任意顺序返回结果列表。
示例 1:
-
-输入: strs = ["eat", "tea", "tan", "ate", "nat", "bat"]
-输出: [["bat"],["nat","tan"],["ate","eat","tea"]]
+输入: strs = ["eat", "tea", "tan", "ate", "nat", "bat"]
+ +输出: [["bat"],["nat","tan"],["ate","eat","tea"]]
+ +解释：
+ +"bat"。"nat" 和 "tan" 是字母异位词，因为它们可以重新排列以形成彼此。"ate" ，"eat" 和 "tea" 是字母异位词，因为它们可以重新排列以形成彼此。示例 2:
-
-输入: strs = [""]
-输出: [[""]]
-
+输入: strs = [""]
+ +输出: [[""]]
+示例 3:
-
-输入: strs = ["a"]
-输出: [["a"]]
+输入: strs = ["a"]
+ +输出: [["a"]]
+diff --git a/solution/0000-0099/0059.Spiral Matrix II/README.md b/solution/0000-0099/0059.Spiral Matrix II/README.md index b4e551233beb0..00811445282ce 100644 --- a/solution/0000-0099/0059.Spiral Matrix II/README.md +++ b/solution/0000-0099/0059.Spiral Matrix II/README.md @@ -52,13 +52,13 @@ tags: ### 方法一：模拟 -直接模拟螺旋矩阵的生成过程。 +我们可以直接模拟螺旋矩阵的生成过程。 -定义一个二维数组 `ans`，用于存储螺旋矩阵。用 `i` 和 `j` 分别表示当前位置的行号和列号，用 `k` 表示当前的方向编号，`dirs` 表示方向编号与方向的对应关系。 +定义一个二维数组 $\textit{ans}$，用于存储螺旋矩阵。用 $i$ 和 $j$ 分别表示当前位置的行号和列号，用 $k$ 表示当前的方向编号，$\textit{dirs}$ 表示方向编号与方向的对应关系。 -从 `1` 开始，依次填入矩阵中的每个位置。每次填入一个位置后，计算下一个位置的行号和列号，如果下一个位置不在矩阵中或者已经被填过，则改变方向，再计算下一个位置的行号和列号。 +从 $1$ 开始，依次填入矩阵中的每个位置。每次填入一个位置后，计算下一个位置的行号和列号，如果下一个位置不在矩阵中或者已经被填过，则改变方向，再计算下一个位置的行号和列号。 -时间复杂度 $O(n^2)$，其中 $n$ 是矩阵的边长。忽略输出数组不计，空间复杂度 $O(1)$。 +时间复杂度 $O(n^2)$，其中 $n$ 是矩阵的边长。忽略答案数组的空间消耗，空间复杂度 $O(1)$。 @@ -68,15 +68,14 @@ tags: class Solution: def generateMatrix(self, n: int) -> List[List[int]]: ans = [[0] * n for _ in range(n)] - dirs = ((0, 1), (1, 0), (0, -1), (-1, 0)) + dirs = (0, 1, 0, -1, 0) i = j = k = 0 for v in range(1, n * n + 1): ans[i][j] = v - x, y = i + dirs[k][0], j + dirs[k][1] - if x < 0 or y < 0 or x >= n or y >= n or ans[x][y]: + x, y = i + dirs[k], j + dirs[k + 1] + if x < 0 or x >= n or y < 0 or y >= n or ans[x][y]: k = (k + 1) % 4 - x, y = i + dirs[k][0], j + dirs[k][1] - i, j = x, y + i, j = i + dirs[k], j + dirs[k + 1] return ans ``` @@ -86,18 +85,16 @@ class Solution: class Solution { public int[][] generateMatrix(int n) { int[][] ans = new int[n][n]; + final int[] dirs = {0, 1, 0, -1, 0}; int i = 0, j = 0, k = 0; - int[][] dirs = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}}; for (int v = 1; v <= n * n; ++v) { ans[i][j] = v; - int x = i + dirs[k][0], y = j + dirs[k][1]; - if (x < 0 || y < 0 || x >= n || y >= n || ans[x][y] > 0) { + int x = i + dirs[k], y = j + dirs[k + 1]; + if (x < 0 || x >= n || y < 0 || y >= n || ans[x][y] != 0) { k = (k + 1) % 4; - x = i + dirs[k][0]; - y = j + dirs[k][1]; } - i = x; - j = y; + i += dirs[k]; + j += dirs[k + 1]; } return ans; } @@ -109,19 +106,18 @@ class Solution { ```cpp class Solution { public: - const int dirs[4][2] = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}}; - vector
给定一个由 整数 组成的 非空 数组所表示的非负整数，在该数的基础上加一。
+给定一个表示 大整数 的整数数组 digits，其中 digits[i] 是整数的第 i 位数字。这些数字按从左到右，从最高位到最低位排列。这个大整数不包含任何前导 0。
最高位数字存放在数组的首位， 数组中每个元素只存储单个数字。
- -你可以假设除了整数 0 之外，这个整数不会以零开头。
+将大整数加 1，并返回结果的数字数组。
@@ -31,6 +29,8 @@ tags: 输入：digits = [1,2,3] 输出：[1,2,4] 解释：输入数组表示数字 123。 +加 1 后得到 123 + 1 = 124。 +因此，结果应该是 [1,2,4]。
示例 2：
@@ -39,6 +39,8 @@ tags: 输入：digits = [4,3,2,1] 输出：[4,3,2,2] 解释：输入数组表示数字 4321。 +加 1 后得到 4321 + 1 = 4322。 +因此，结果应该是 [4,3,2,2]。示例 3：
@@ -58,6 +60,7 @@ tags: