Skip to content

Commit 5677ed5

Browse files
LetMeFly666LetMeFly666
authored
update: 添加问题“3355.零数组变换I”的代码和题解(#947)
* 3355: WA.cpp (#945) Signed-off-by: LetMeFly666 <[email protected]> * 3355: AC.cpp+WA.py (#945) Signed-off-by: LetMeFly666 <[email protected]> * 3355: WA.py (#945) 也是困的不行了 Signed-off-by: LetMeFly666 <[email protected]> * 3355: AC.go (#945) Signed-off-by: LetMeFly666 <[email protected]> * update: 添加问题“3355.零数组变换I”的代码和题解(#947) Signed-off-by: LetMeFly666 <[email protected]> --------- Signed-off-by: LetMeFly666 <[email protected]>
1 parent 1ddbb16 commit 5677ed5

14 files changed

+520
-2
lines changed

‎.gitlog‎

Lines changed: 150 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,150 @@
1+
PS F:\OtherApps\Program\Git\Store\Store20_LeetCode> git pull origin master
2+
remote: Enumerating objects: 62, done.
3+
remote: Counting objects: 100% (50/50), done.
4+
remote: Compressing objects: 100% (38/38), done.
5+
remote: Total 62 (delta 19), reused 30 (delta 11), pack-reused 12 (from 1)
6+
Unpacking objects: 100% (62/62), 345.01 KiB | 64.00 KiB/s, done.
7+
From ssh.github.com:LetMeFly666/LeetCode
8+
* branch master -> FETCH_HEAD
9+
8bcc85f546d..1ddbb163d5c master -> origin/master
10+
Updating 8bcc85f546d..1ddbb163d5c
11+
Fast-forward
12+
.gitlog | 51 ---
13+
...painting-a-grid-with-three-different-colors.cpp | 67 ++++
14+
...-with-three-different-colors_JvZhenKuaiSuMi.cpp | 97 +++++
15+
...ngest-unequal-adjacent-groups-subsequence-i.cpp | 23 ++
16+
...ongest-unequal-adjacent-groups-subsequence-i.go | 16 +
17+
...gest-unequal-adjacent-groups-subsequence-i.java | 20 +
18+
...ongest-unequal-adjacent-groups-subsequence-i.py | 15 +
19+
Codes/3024-type-of-triangle.cpp | 26 ++
20+
Codes/3024-type-of-triangle.go | 23 ++
21+
Codes/3024-type-of-triangle.java | 23 ++
22+
Codes/3024-type-of-triangle.py | 19 +
23+
...aracters-in-string-after-transformations-ii.cpp | 72 ++++
24+
...haracters-in-string-after-transformations-ii.go | 58 +++
25+
...racters-in-string-after-transformations-ii.java | 62 +++
26+
...haracters-in-string-after-transformations-ii.py | 43 +++
27+
...ers-in-string-after-transformations-ii.test.cpp | 76 ++++
28+
README.md | 4 +
29+
...275\221\346\240\274\346\266\202\350\211\262.md" | 333 ++++++++++++++++
30+
...55\211\345\255\220\345\272\217\345\210\227I.md" | 171 +++++++++
31+
...247\222\345\275\242\347\261\273\345\236\213.md" | 178 +++++++++
32+
...20\216\347\232\204\351\225\277\345\272\246I.md" | 2 +-
33+
...0\216\347\232\204\351\225\277\345\272\246II.md" | 424 +++++++++++++++++++++
34+
Solutions/Other-English-LearningNotes-SomeWords.md | 22 ++
35+
Solutions/Other-Japanese-LearningNotes.md | 5 +
36+
TODO | 2 +
37+
newSolution.py | 2 +-
38+
toSay.md | 1 -
39+
tryGoPy/MGJW/lastWeek/09/chat.md | 25 ++
40+
tryGoPy/MGJW/{thisWeek => lastWeek/09}/todo.md | 0
41+
.../MGJW/lastWeek/09/\345\221\250\346\212\245.md" | 83 ++++
42+
tryGoPy/MGJW/nextWeek/chat.md | 7 +
43+
tryGoPy/MGJW/nextWeek/todo.md | 15 +
44+
.../MGJW/nextWeek/\345\221\250\346\212\245.md" | 1 +
45+
.../MGJW/thisWeek/\345\221\250\346\212\245.md" | 0
46+
34 files changed, 1912 insertions(+), 54 deletions(-)
47+
delete mode 100644 .gitlog
48+
create mode 100644 Codes/1931-painting-a-grid-with-three-different-colors.cpp
49+
create mode 100644 Codes/1931-painting-a-grid-with-three-different-colors_JvZhenKuaiSuMi.cpp
50+
create mode 100644 Codes/2900-longest-unequal-adjacent-groups-subsequence-i.cpp
51+
create mode 100644 Codes/2900-longest-unequal-adjacent-groups-subsequence-i.go
52+
create mode 100644 Codes/2900-longest-unequal-adjacent-groups-subsequence-i.java
53+
create mode 100644 Codes/2900-longest-unequal-adjacent-groups-subsequence-i.py
54+
create mode 100644 Codes/3024-type-of-triangle.go
55+
create mode 100644 Codes/3024-type-of-triangle.java
56+
create mode 100644 Codes/3024-type-of-triangle.py
57+
create mode 100644 Codes/3337-total-characters-in-string-after-transformations-ii.cpp
58+
create mode 100644 Codes/3337-total-characters-in-string-after-transformations-ii.java
59+
create mode 100644 Codes/3337-total-characters-in-string-after-transformations-ii.py
60+
create mode 100644 Codes/3337-total-characters-in-string-after-transformations-ii.test.cpp
61+
create mode 100644 "Solutions/LeetCode 1931.\347\224\250\344\270\211\347\247\215\344\270\215\345\220\214\351\242\234\350\211\262\344\270\272\347\275\221\346\240\274\346\266\202\350\211\262.md"
62+
create mode 100644 "Solutions/LeetCode 2900.\346\234\200\351\225\277\347\233\270\351\202\273\344\270\215\347\233\270\347\255\211\345\255\220\345\272\217\345\210\227I.md"
63+
create mode 100644 "Solutions/LeetCode 3337.\345\255\227\347\254\246\344\270\262\350\275\254\346\215\242\345\220\216\347\232\204\351\225\277\345\272\246II.md"
64+
create mode 100644 TODO
65+
delete mode 100644 toSay.md
66+
rename tryGoPy/MGJW/{thisWeek => lastWeek/09}/todo.md (100%)
67+
create mode 100644 "tryGoPy/MGJW/lastWeek/09/\345\221\250\346\212\245.md"
68+
create mode 100644 tryGoPy/MGJW/nextWeek/chat.md
69+
create mode 100644 tryGoPy/MGJW/nextWeek/todo.md
70+
delete mode 100644 "tryGoPy/MGJW/thisWeek/\345\221\250\346\212\245.md"
71+
PS F:\OtherApps\Program\Git\Store\Store20_LeetCode> git rbanch
72+
git: 'rbanch' is not a git command. See 'git --help'.
73+
74+
The most similar command is
75+
branch
76+
PS F:\OtherApps\Program\Git\Store\Store20_LeetCode> git branch
77+
1922
78+
3337
79+
* master
80+
website
81+
website_Static
82+
PS F:\OtherApps\Program\Git\Store\Store20_LeetCode> git branch -d 3337
83+
warning: deleting branch '3337' that has been merged to
84+
'refs/remotes/origin/3337', but not yet merged to HEAD.
85+
Deleted branch 3337 (was c757425e8a9).
86+
PS F:\OtherApps\Program\Git\Store\Store20_LeetCode> git branch
87+
1922
88+
* master
89+
website
90+
website_Static
91+
PS F:\OtherApps\Program\Git\Store\Store20_LeetCode> git branch -d 1922
92+
warning: deleting branch '1922' that has been merged to
93+
'refs/remotes/origin/1922', but not yet merged to HEAD.
94+
Deleted branch 1922 (was 2a3fe4e48e7).
95+
96+
97+
98+
99+
PS F:\OtherApps\Program\Git\Store\Store20_LeetCode>
100+
* 还原的历史记录
101+
102+
PS F:\OtherApps\Program\Git\Store\Store20_LeetCode>
103+
* 还原的历史记录
104+
105+
PS F:\OtherApps\Program\Git\Store\Store20_LeetCode>
106+
* 还原的历史记录
107+
108+
PS F:\OtherApps\Program\Git\Store\Store20_LeetCode>
109+
* 还原的历史记录
110+
111+
PS F:\OtherApps\Program\Git\Store\Store20_LeetCode>
112+
* 还原的历史记录
113+
114+
PS F:\OtherApps\Program\Git\Store\Store20_LeetCode>
115+
* 还原的历史记录
116+
117+
PS F:\OtherApps\Program\Git\Store\Store20_LeetCode>
118+
* 还原的历史记录
119+
120+
PS F:\OtherApps\Program\Git\Store\Store20_LeetCode>
121+
* 还原的历史记录
122+
123+
PS F:\OtherApps\Program\Git\Store\Store20_LeetCode>
124+
* 还原的历史记录
125+
126+
127+
128+
129+
130+
12 files changed, 192 insertions(+), 2 deletions(-)
131+
create mode 100644 .gitlog
132+
create mode 100644 Codes/3355-zero-array-transformation-i.cpp
133+
create mode 100644 Codes/3355-zero-array-transformation-i.go
134+
create mode 100644 Codes/3355-zero-array-transformation-i.java
135+
create mode 100644 Codes/3355-zero-array-transformation-i.py
136+
create mode 100644 WhatIsMore.md
137+
rename tryGoPy/MGJW/{nextWeek => thisWeek}/chat.md (100%)
138+
rename tryGoPy/MGJW/{nextWeek => thisWeek}/todo.md (100%)
139+
rename "tryGoPy/MGJW/nextWeek/\345\221\250\346\212\245.md" => "tryGoPy/MGJW/thisWeek/\345\221\250\346\212\245.md" (100%)
140+
PS F:\OtherApps\Program\Git\Store\Store20_LeetCode> git push
141+
Enumerating objects: 23, done.
142+
Counting objects: 100% (23/23), done.
143+
Delta compression using up to 8 threads
144+
Compressing objects: 100% (15/15), done.
145+
Writing objects: 100% (15/15), 7.62 KiB | 56.00 KiB/s, done.
146+
Total 15 (delta 8), reused 3 (delta 0), pack-reused 0
147+
remote: Resolving deltas: 100% (8/8), completed with 8 local objects.
148+
To ssh.github.com:LetMeFly666/LeetCode
149+
1ddbb163d5c..fd9f3920034 3355 -> 3355
150+
PS F:\OtherApps\Program\Git\Store\Store20_LeetCode>

‎Codes/3355-zero-array-transformation-i.cpp‎

Lines changed: 28 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,28 @@
1+
/*
2+
* @Author: LetMeFly
3+
* @Date: 2025-05-21 23:06:35
4+
* @LastEditors: LetMeFly.xyz
5+
* @LastEditTime: 2025-05-21 23:14:28
6+
*/
7+
#if defined(_WIN32) || defined(__APPLE__)
8+
#include "_[1,2]toVector.h"
9+
#endif
10+
11+
class Solution {
12+
public:
13+
bool isZeroArray(vector<int>& nums, vector<vector<int>>& queries) {
14+
vector<int> diff(nums.size() + 1);
15+
for (vector<int>& q : queries) {
16+
diff[q[0]]++;
17+
diff[q[1] + 1]--;
18+
}
19+
int cnt = 0;
20+
for (int i = 0; i < nums.size(); i++) {
21+
cnt += diff[i];
22+
if (nums[i] > cnt) {
23+
return false;
24+
}
25+
}
26+
return true;
27+
}
28+
};

‎Codes/3355-zero-array-transformation-i.go‎

Lines changed: 23 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,23 @@
1+
/*
2+
* @Author: LetMeFly
3+
* @Date: 2025-05-21 23:06:35
4+
* @LastEditors: LetMeFly.xyz
5+
* @LastEditTime: 2025-05-21 23:23:00
6+
*/
7+
package main
8+
9+
func isZeroArray(nums []int, queries [][]int) bool {
10+
diff := make([]int, len(nums) + 1)
11+
for _, q := range queries {
12+
diff[q[0]]++
13+
diff[q[1] + 1]--
14+
}
15+
cnt := 0
16+
for i := 0; i < len(nums); i++ {
17+
cnt += diff[i]
18+
if nums[i] > cnt {
19+
return false
20+
}
21+
}
22+
return true
23+
}

‎Codes/3355-zero-array-transformation-i.java‎

Lines changed: 23 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,23 @@
1+
/*
2+
* @Author: LetMeFly
3+
* @Date: 2025-05-21 23:06:35
4+
* @LastEditors: LetMeFly.xyz
5+
* @LastEditTime: 2025-05-21 23:20:50
6+
*/
7+
class Solution {
8+
public boolean isZeroArray(int[] nums, int[][] queries) {
9+
int[] diff = new int[nums.length + 1];
10+
for (int[] q : queries) {
11+
diff[q[0]]++;
12+
diff[q[1] + 1]--;
13+
}
14+
int cnt = 0;
15+
for (int i = 0; i < nums.length; i++) {
16+
cnt += diff[i];
17+
if (nums[i] > cnt) {
18+
return false;
19+
}
20+
}
21+
return true;
22+
}
23+
}

‎Codes/3355-zero-array-transformation-i.py‎

Lines changed: 20 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,20 @@
1+
'''
2+
Author: LetMeFly
3+
Date: 2025-05-21 23:06:35
4+
LastEditors: LetMeFly.xyz
5+
LastEditTime: 2025-05-21 23:19:48
6+
'''
7+
from typing import List
8+
9+
class Solution:
10+
def isZeroArray(self, nums: List[int], queries: List[List[int]]) -> bool:
11+
diff = [0] * (len(nums) + 1)
12+
for l, r in queries:
13+
diff[l] += 1
14+
diff[r + 1] -= 1
15+
cnt = 0
16+
for i in range(len(nums)):
17+
cnt += diff[i]
18+
if nums[i] > cnt:
19+
return False
20+
return True

‎README.md‎

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -971,6 +971,7 @@
971971
|3340.检查平衡字符串|简单|<a href="https://leetcode.cn/problems/check-balanced-string/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/03/14/LeetCode%203340.%E6%A3%80%E6%9F%A5%E5%B9%B3%E8%A1%A1%E5%AD%97%E7%AC%A6%E4%B8%B2/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/146249653" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/check-balanced-string/solutions/3610899/letmefly-3340jian-cha-ping-heng-zi-fu-ch-p8eo/" target="_blank">LeetCode题解</a>|
972972
|3341.到达最后一个房间的最少时间I|中等|<a href="https://leetcode.cn/problems/find-minimum-time-to-reach-last-room-i/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/05/07/LeetCode%203341.%E5%88%B0%E8%BE%BE%E6%9C%80%E5%90%8E%E4%B8%80%E4%B8%AA%E6%88%BF%E9%97%B4%E7%9A%84%E6%9C%80%E5%B0%91%E6%97%B6%E9%97%B4I/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/147807022" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/find-minimum-time-to-reach-last-room-i/solutions/3672076/letmefly-3341dao-da-zui-hou-yi-ge-fang-j-3m6o/" target="_blank">LeetCode题解</a>|
973973
|3342.到达最后一个房间的最少时间II|中等|<a href="https://leetcode.cn/problems/find-minimum-time-to-reach-last-room-ii/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/05/09/LeetCode%203342.%E5%88%B0%E8%BE%BE%E6%9C%80%E5%90%8E%E4%B8%80%E4%B8%AA%E6%88%BF%E9%97%B4%E7%9A%84%E6%9C%80%E5%B0%91%E6%97%B6%E9%97%B4II/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/147835524" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/find-minimum-time-to-reach-last-room-ii/solutions/3672695/letmefly-3342dao-da-zui-hou-yi-ge-fang-j-qrh6/" target="_blank">LeetCode题解</a>|
974+
|3355.零数组变换I|中等|<a href="https://leetcode.cn/problems/zero-array-transformation-i/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/05/21/LeetCode%203355.%E9%9B%B6%E6%95%B0%E7%BB%84%E5%8F%98%E6%8D%A2I/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/148126611" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/zero-array-transformation-i/solutions/3683113/letmefly-3355ling-shu-zu-bian-huan-ichai-njzr/" target="_blank">LeetCode题解</a>|
974975
|3375.使数组的值全部为K的最少操作次数|简单|<a href="https://leetcode.cn/problems/minimum-operations-to-make-array-values-equal-to-k/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/04/09/LeetCode%203375.%E4%BD%BF%E6%95%B0%E7%BB%84%E7%9A%84%E5%80%BC%E5%85%A8%E9%83%A8%E4%B8%BAK%E7%9A%84%E6%9C%80%E5%B0%91%E6%93%8D%E4%BD%9C%E6%AC%A1%E6%95%B0/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/147104288" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/minimum-operations-to-make-array-values-equal-to-k/solutions/3646138/letmefly-3375shi-shu-zu-de-zhi-quan-bu-w-i71e/" target="_blank">LeetCode题解</a>|
975976
|3392.统计符合条件长度为3的子数组数目|简单|<a href="https://leetcode.cn/problems/count-subarrays-of-length-three-with-a-condition/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/04/29/LeetCode%203392.%E7%BB%9F%E8%AE%A1%E7%AC%A6%E5%90%88%E6%9D%A1%E4%BB%B6%E9%95%BF%E5%BA%A6%E4%B8%BA3%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84%E6%95%B0%E7%9B%AE/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/147603015" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/count-subarrays-of-length-three-with-a-condition/solutions/3665081/letmefly-3392tong-ji-fu-he-tiao-jian-cha-h935/" target="_blank">LeetCode题解</a>|
976977
|3396.使数组元素互不相同所需的最少操作次数|简单|<a href="https://leetcode.cn/problems/minimum-number-of-operations-to-make-elements-in-array-distinct/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/04/08/LeetCode%203396.%E4%BD%BF%E6%95%B0%E7%BB%84%E5%85%83%E7%B4%A0%E4%BA%92%E4%B8%8D%E7%9B%B8%E5%90%8C%E6%89%80%E9%9C%80%E7%9A%84%E6%9C%80%E5%B0%91%E6%93%8D%E4%BD%9C%E6%AC%A1%E6%95%B0/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/147080178" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/minimum-number-of-operations-to-make-elements-in-array-distinct/solutions/3644951/letmefly-3396shi-shu-zu-yuan-su-hu-bu-xi-glg4/" target="_blank">LeetCode题解</a>|

‎Solutions/LeetCode 3337.字符串转换后的长度II.md‎

Lines changed: 48 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -137,6 +137,54 @@ $ \begin{aligned} f[i][0] & =f[i-1][1] \\ f[i][1] & =f[i-1][2] \\ f[i][2] & =f[i
137137

138138
</center>
139139

140+
{% raw %}
141+
142+
$$ \begin{aligned} f[i][0] & =f[i-1][1] \\ f[i][1] & =f[i-1][2] \\ f[i][2] & =f[i-1][3] \\ \vdots & \\ f[i][23] & =f[i-1][24] \\ f[i][24] & =f[i-1][25] \\ f[i][25] & =f[i-1][0]+f[i-1][1] \end{aligned}\\ $$
143+
144+
$ \begin{aligned} f[i][0] & =f[i-1][1] \\ f[i][1] & =f[i-1][2] \\ f[i][2] & =f[i-1][3] \\ \vdots & \\ f[i][23] & =f[i-1][24] \\ f[i][24] & =f[i-1][25] \\ f[i][25] & =f[i-1][0]+f[i-1][1] \end{aligned}\\ $
145+
146+
<center>
147+
148+
$ \begin{aligned} f[i][0] & =f[i-1][1] \\ f[i][1] & =f[i-1][2] \\ f[i][2] & =f[i-1][3] \\ \vdots & \\ f[i][23] & =f[i-1][24] \\ f[i][24] & =f[i-1][25] \\ f[i][25] & =f[i-1][0]+f[i-1][1] \end{aligned}\\ $
149+
150+
</center>
151+
152+
{% endraw %}
153+
154+
{% raw %}
155+
156+
$$ \begin{aligned} f[i][0] & =f[i-1][1] \\ f[i][1] & =f[i-1][2] \\ f[i][2] & =f[i-1][3] \\ \vdots & \\ f[i][23] & =f[i-1][24] \\ f[i][24] & =f[i-1][25] \\ f[i][25] & =f[i-1][0]+f[i-1][1] \end{aligned}\\ $$
157+
158+
{% endraw %}
159+
160+
{% raw %}
161+
162+
$$
163+
\begin{aligned}
164+
f[i][0] & =f[i-1][1] \\
165+
f[i][1] & =f[i-1][2] \\
166+
f[i][2] & =f[i-1][3] \\
167+
\vdots & \\
168+
f[i][23] & =f[i-1][24] \\
169+
f[i][24] & =f[i-1][25] \\
170+
f[i][25] & =f[i-1][0]+f[i-1][1]
171+
\end{aligned}\\
172+
$$
173+
174+
{% endraw %}
175+
176+
```math
177+
\begin{aligned}
178+
f[i][0] & =f[i-1][1] \\
179+
f[i][1] & =f[i-1][2] \\
180+
f[i][2] & =f[i-1][3] \\
181+
\vdots & \\
182+
f[i][23] & =f[i-1][24] \\
183+
f[i][24] & =f[i-1][25] \\
184+
f[i][25] & =f[i-1][0]+f[i-1][1]
185+
\end{aligned}\\
186+
```
187+
140188
$$
141189
\begin{aligned}
142190
f[i][0] & =f[i-1][1] \\

0 commit comments

Comments
 (0)