Skip to content

Commit bce53fc

Browse files
LetMeFly666LetMeFly666
authored
Merge pull request #639 from LetMeFly666/3206
添加问题“3206.交替组I”的代码和题解
2 parents 37a4490 + 86151a6 commit bce53fc

9 files changed

+349
-0
lines changed

‎Codes/0743-network-delay-time_20241125-half.cpp‎

Lines changed: 27 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,27 @@
1+
/*
2+
* @Author: LetMeFly
3+
* @Date: 2024-11-25 18:33:42
4+
* @LastEditors: LetMeFly.xyz
5+
* @LastEditTime: 2024-11-25 18:39:53
6+
*/
7+
#ifdef _WIN32
8+
#include "_[1,2]toVector.h"
9+
#endif
10+
11+
class Solution {
12+
private:
13+
void dfs(int root, vector<int>& when) {
14+
15+
}
16+
public:
17+
int networkDelayTime(vector<vector<int>>& times, int n, int k) {
18+
vector<vector<pair<int, int>>> graph(n + 1); // graph[i]: [i->a, i->b, i->c]
19+
for (vector<int>& thisRoad : times) {
20+
graph[thisRoad[0]].push_back({thisRoad[1], thisRoad[2]});
21+
}
22+
vector<int> when(n + 1, 1e9);
23+
when[0] = when[k] = 0;
24+
dfs(k, when);
25+
return *max_element(when.begin(), when.end());
26+
}
27+
};

‎Codes/3206-alternating-groups-i.cpp‎

Lines changed: 22 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,22 @@
1+
/*
2+
* @Author: LetMeFly
3+
* @Date: 2024-11-26 23:18:14
4+
* @LastEditors: LetMeFly.xyz
5+
* @LastEditTime: 2024-11-26 23:18:20
6+
*/
7+
#ifdef _WIN32
8+
#include "_[1,2]toVector.h"
9+
#endif
10+
11+
class Solution {
12+
public:
13+
int numberOfAlternatingGroups(vector<int>& colors) {
14+
int ans = 0;
15+
for (int i = 0; i < colors.size(); i++) {
16+
if (colors[i] != colors[(i + 1) % colors.size()] && colors[i] == colors[(i + 2) % colors.size()]) {
17+
ans++;
18+
}
19+
}
20+
return ans;
21+
}
22+
};

‎Codes/3206-alternating-groups-i.go‎

Lines changed: 16 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,16 @@
1+
/*
2+
* @Author: LetMeFly
3+
* @Date: 2024-11-26 23:35:39
4+
* @LastEditors: LetMeFly.xyz
5+
* @LastEditTime: 2024-11-26 23:40:05
6+
*/
7+
package main
8+
9+
func numberOfAlternatingGroups(colors []int) (ans int) {
10+
for i := range colors {
11+
if colors[i] != colors[(i + 1) % len(colors)] && colors[i] == colors[(i + 2) % len(colors)] {
12+
ans++
13+
}
14+
}
15+
return
16+
}

‎Codes/3206-alternating-groups-i.java‎

Lines changed: 17 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,17 @@
1+
/*
2+
* @Author: LetMeFly
3+
* @Date: 2024-11-26 23:22:57
4+
* @LastEditors: LetMeFly.xyz
5+
* @LastEditTime: 2024-11-26 23:24:05
6+
*/
7+
class Solution {
8+
public int numberOfAlternatingGroups(int[] colors) {
9+
int ans = 0;
10+
for (int i = 0; i < colors.length; i++) {
11+
if (colors[i] != colors[(i + 1) % colors.length] && colors[i] == colors[(i + 2) % colors.length]) {
12+
ans++;
13+
}
14+
}
15+
return ans;
16+
}
17+
}

‎Codes/3206-alternating-groups-i.py‎

Lines changed: 11 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,11 @@
1+
'''
2+
Author: LetMeFly
3+
Date: 2024-11-26 23:20:18
4+
LastEditors: LetMeFly.xyz
5+
LastEditTime: 2024-11-26 23:20:28
6+
'''
7+
from typing import List
8+
9+
class Solution:
10+
def numberOfAlternatingGroups(self, colors: List[int]) -> int:
11+
return sum(colors[i] != colors[(i + 1) % len(colors)] != colors[(i + 2) % len(colors)] for i in range(len(colors)))

‎README.md‎

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -717,6 +717,7 @@
717717
|3192.使二进制数组全部等于1的最少操作次数II|中等|<a href="https://leetcode.cn/problems/minimum-operations-to-make-binary-array-elements-equal-to-one-ii/solutions/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/10/19/LeetCode%203192.%E4%BD%BF%E4%BA%8C%E8%BF%9B%E5%88%B6%E6%95%B0%E7%BB%84%E5%85%A8%E9%83%A8%E7%AD%89%E4%BA%8E1%E7%9A%84%E6%9C%80%E5%B0%91%E6%93%8D%E4%BD%9C%E6%AC%A1%E6%95%B0II/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/143066863" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/minimum-operations-to-make-binary-array-elements-equal-to-one-ii/solutions/2956341/letmefly-3192shi-er-jin-zhi-shu-zu-quan-ih15d/" target="_blank">LeetCode题解</a>|
718718
|3194.最小元素和最大元素的最小平均值|简单|<a href="https://leetcode.cn/problems/minimum-average-of-smallest-and-largest-elements/solutions/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/10/16/LeetCode%203194.%E6%9C%80%E5%B0%8F%E5%85%83%E7%B4%A0%E5%92%8C%E6%9C%80%E5%A4%A7%E5%85%83%E7%B4%A0%E7%9A%84%E6%9C%80%E5%B0%8F%E5%B9%B3%E5%9D%87%E5%80%BC/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/142994095" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/minimum-average-of-smallest-and-largest-elements/solutions/2953616/letmefly-3194zui-xiao-yuan-su-he-zui-da-6f4v5/" target="_blank">LeetCode题解</a>|
719719
|3200.三角形的最大高度|简单|<a href="https://leetcode.cn/problems/maximum-height-of-a-triangle/solutions/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/10/15/LeetCode%203200.%E4%B8%89%E8%A7%92%E5%BD%A2%E7%9A%84%E6%9C%80%E5%A4%A7%E9%AB%98%E5%BA%A6/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/142967272" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/maximum-height-of-a-triangle/solutions/2952209/letmefly-3200san-jiao-xing-de-zui-da-gao-m23t/" target="_blank">LeetCode题解</a>|
720+
|3206.交替组I|简单|<a href="https://leetcode.cn/problems/alternating-groups-i/solutions/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/11/26/LeetCode%203206.%E4%BA%A4%E6%9B%BF%E7%BB%84I/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/144071026" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/alternating-groups-i/solutions/3001910/letmefly-3206jiao-ti-zu-ibian-li-by-tisf-euqx/" target="_blank">LeetCode题解</a>|
720721
|3211.生成不含相邻零的二进制字符串|中等|<a href="https://leetcode.cn/problems/generate-binary-strings-without-adjacent-zeros/solutions/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/10/29/LeetCode%203211.%E7%94%9F%E6%88%90%E4%B8%8D%E5%90%AB%E7%9B%B8%E9%82%BB%E9%9B%B6%E7%9A%84%E4%BA%8C%E8%BF%9B%E5%88%B6%E5%AD%97%E7%AC%A6%E4%B8%B2/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/143352841" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/generate-binary-strings-without-adjacent-zeros/solutions/2970587/letmefly-3211sheng-cheng-bu-han-xiang-li-sdh3/" target="_blank">LeetCode题解</a>|
721722
|3216.交换后字典序最小的字符串|简单|<a href="https://leetcode.cn/problems/lexicographically-smallest-string-after-a-swap/solutions/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/10/30/LeetCode%203216.%E4%BA%A4%E6%8D%A2%E5%90%8E%E5%AD%97%E5%85%B8%E5%BA%8F%E6%9C%80%E5%B0%8F%E7%9A%84%E5%AD%97%E7%AC%A6%E4%B8%B2/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/143362223" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/lexicographically-smallest-string-after-a-swap/solutions/2971048/letmefly-3216jiao-huan-hou-zi-dian-xu-zu-nxp9/" target="_blank">LeetCode题解</a>|
722723
|3222.求出硬币游戏的赢家|简单|<a href="https://leetcode.cn/problems/find-the-winning-player-in-coin-game/solutions/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/11/05/LeetCode%203222.%E6%B1%82%E5%87%BA%E7%A1%AC%E5%B8%81%E6%B8%B8%E6%88%8F%E7%9A%84%E8%B5%A2%E5%AE%B6/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/143501415" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/find-the-winning-player-in-coin-game/solutions/2977629/letmefly-3222qiu-chu-ying-bi-you-xi-de-y-08j3/" target="_blank">LeetCode题解</a>|

‎Solutions/LeetCode 3206.交替组I.md‎

Lines changed: 136 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,136 @@
1+
---
2+
title: 3206.交替组 I
3+
date: 2024-11-26 23:43:43
4+
tags: [题解, LeetCode, 简单, 数组, 滑动窗口]
5+
---
6+
7+
# 【LetMeFly】3206.交替组 I：遍历
8+
9+
力扣题目链接：[https://leetcode.cn/problems/alternating-groups-i/](https://leetcode.cn/problems/alternating-groups-i/)
10+
11+
<p>给你一个整数数组 <code>colors</code>&nbsp;，它表示一个由红色和蓝色瓷砖组成的环，第 <code>i</code>&nbsp;块瓷砖的颜色为&nbsp;<code>colors[i]</code>&nbsp;：</p>
12+
13+
<ul>
14+
<li><code>colors[i] == 0</code>&nbsp;表示第&nbsp;<code>i</code>&nbsp;块瓷砖的颜色是 <strong>红色</strong>&nbsp;。</li>
15+
<li><code>colors[i] == 1</code>&nbsp;表示第 <code>i</code>&nbsp;块瓷砖的颜色是 <strong>蓝色</strong>&nbsp;。</li>
16+
</ul>
17+
18+
<p>环中连续 3 块瓷砖的颜色如果是 <strong>交替</strong>&nbsp;颜色（也就是说中间瓷砖的颜色与它<strong>&nbsp;左边</strong>&nbsp;和 <strong>右边</strong>&nbsp;的颜色都不同），那么它被称为一个 <strong>交替</strong>&nbsp;组。</p>
19+
20+
<p>请你返回 <strong>交替</strong>&nbsp;组的数目。</p>
21+
22+
<p><b>注意</b>&nbsp;，由于&nbsp;<code>colors</code>&nbsp;表示一个 <strong>环</strong>&nbsp;，<strong>第一块</strong>&nbsp;瓷砖和 <strong>最后一块</strong>&nbsp;瓷砖是相邻的。</p>
23+
24+
<p>&nbsp;</p>
25+
26+
<p><strong class="example">示例 1：</strong></p>
27+
28+
<div class="example-block">
29+
<p><span class="example-io"><b>输入：</b>colors = [1,1,1]</span></p>
30+
31+
<p><span class="example-io"><b>输出：</b>0</span></p>
32+
33+
<p><strong>解释：</strong></p>
34+
35+
<p><img alt="" src="https://assets.leetcode.com/uploads/2024/05/16/image_2024-05-16_23-53-171.png" style="width: 150px; height: 150px; padding: 10px; background: #fff; border-radius: .5rem;" /></p>
36+
</div>
37+
38+
<p><strong class="example">示例 2：</strong></p>
39+
40+
<div class="example-block">
41+
<p><span class="example-io"><b>输入：</b>colors = [0,1,0,0,1]</span></p>
42+
43+
<p><b>输出：</b>3</p>
44+
45+
<p><b>解释：</b></p>
46+
47+
<p><img alt="" src="https://assets.leetcode.com/uploads/2024/05/16/image_2024-05-16_23-47-491.png" style="width: 150px; height: 150px; padding: 10px; background: #fff; border-radius: .5rem;" /></p>
48+
49+
<p>交替组包括：</p>
50+
51+
<p><strong class="example"><img alt="" src="https://assets.leetcode.com/uploads/2024/05/16/image_2024-05-16_23-50-441.png" style="width: 150px; height: 150px; padding: 10px; background: #fff; border-radius: .5rem;" /></strong><img alt="" src="https://assets.leetcode.com/uploads/2024/05/16/image_2024-05-16_23-48-211.png" style="width: 150px; height: 150px; padding: 10px; background: #fff; border-radius: .5rem;" /><strong class="example"><img alt="" src="https://assets.leetcode.com/uploads/2024/05/16/image_2024-05-16_23-49-351.png" style="width: 150px; height: 150px; padding: 10px; background: #fff; border-radius: .5rem;" /></strong></p>
52+
</div>
53+
54+
<p>&nbsp;</p>
55+
56+
<p><strong>提示：</strong></p>
57+
58+
<ul>
59+
<li><code>3 &lt;= colors.length &lt;= 100</code></li>
60+
<li><code>0 &lt;= colors[i] &lt;= 1</code></li>
61+
</ul>
62+
63+
64+
65+
## 解题方法：遍历
66+
67+
遍历“三连砖”的起点：
68+
69+
> 假设起点是$i$，那么下一个瓷砖就是$(i + 1) \% len(colors)$，下下个瓷砖就是$(i + 2) \% len(colors)$.
70+
71+
+ 时间复杂度$O(len(colors))$
72+
+ 空间复杂度$O(1)$
73+
74+
### AC代码
75+
76+
#### C++
77+
78+
```cpp
79+
class Solution {
80+
public:
81+
int numberOfAlternatingGroups(vector<int>& colors) {
82+
int ans = 0;
83+
for (int i = 0; i < colors.size(); i++) {
84+
if (colors[i] != colors[(i + 1) % colors.size()] && colors[i] == colors[(i + 2) % colors.size()]) {
85+
ans++;
86+
}
87+
}
88+
return ans;
89+
}
90+
};
91+
```
92+
93+
#### Python
94+
95+
```python
96+
from typing import List
97+
98+
class Solution:
99+
def numberOfAlternatingGroups(self, colors: List[int]) -> int:
100+
return sum(colors[i] != colors[(i + 1) % len(colors)] != colors[(i + 2) % len(colors)] for i in range(len(colors)))
101+
```
102+
103+
#### Java
104+
105+
```java
106+
class Solution {
107+
public int numberOfAlternatingGroups(int[] colors) {
108+
int ans = 0;
109+
for (int i = 0; i < colors.length; i++) {
110+
if (colors[i] != colors[(i + 1) % colors.length] && colors[i] == colors[(i + 2) % colors.length]) {
111+
ans++;
112+
}
113+
}
114+
return ans;
115+
}
116+
}
117+
```
118+
119+
#### Go
120+
121+
```go
122+
package main
123+
124+
func numberOfAlternatingGroups(colors []int) (ans int) {
125+
for i := range colors {
126+
if colors[i] != colors[(i + 1) % len(colors)] && colors[i] == colors[(i + 2) % len(colors)] {
127+
ans++
128+
}
129+
}
130+
return
131+
}
132+
```
133+
134+
> 同步发文于CSDN和我的[个人博客](https://blog.letmefly.xyz/)，原创不易，转载经作者同意后请附上[原文链接](https://blog.letmefly.xyz/2024/11/26/LeetCode%203206.%E4%BA%A4%E6%9B%BF%E7%BB%84I/)哦~
135+
>
136+
> Tisfy：[https://letmefly.blog.csdn.net/article/details/144071026](https://letmefly.blog.csdn.net/article/details/144071026)

‎Solutions/Other-English-LearningNotes-SomeWords.md‎

Lines changed: 8 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -823,6 +823,14 @@ tags: [其他, 知识, 英语, Notes]
823823
|||
824824
|walnut|n. 核桃，胡桃，胡桃木，胡桃色|
825825
|smack|v. 用巴掌打，掴，啪的一声使劲放(或扔、甩等)，使劲碰(或撞)<br/>n. 打巴掌，(打出的)一拳，啪的一声；海洛因<br/>adv. 恰好，直接，不偏不倚地，猛地|
826+
|||
827+
|cafeteria|n. 自助餐厅|
828+
|||
829+
|antonym|n. 反义词|
830+
|tare|n. 野豌豆，包装重量<br/>v. 称皮重<br/>tare weight: 皮重|
831+
|Portuguese|adj. 葡萄牙的<br/>n. 葡萄牙人，葡萄牙语|
832+
|gratis|adj. 免费的<br/>adv. 免费地，无偿的|
833+
|limousine|n. 豪华轿车，大型高级轿车，(往返机场接送旅客的)中型客车|
826834

827835
<p class="wordCounts">单词收录总数</p>
828836

‎tryGoPy/CHANGELOG.md‎

Lines changed: 111 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,111 @@
1+
PS F:\OtherApps\Program\Git\Store\Store20_LeetCode> git pull origin master
2+
remote: Enumerating objects: 35, done.
3+
remote: Counting objects: 100% (35/35), done.
4+
remote: Compressing objects: 100% (17/17), done.
5+
remote: Total 26 (delta 9), reused 25 (delta 9), pack-reused 0 (from 0)
6+
Unpacking objects: 100% (26/26), 19.92 KiB | 4.00 KiB/s, done.
7+
From github.com:LetMeFly666/LeetCode
8+
* branch master -> FETCH_HEAD
9+
9e41c9485..6cb55b4a4 master -> origin/master
10+
Updating 9e41c9485..6cb55b4a4
11+
Fast-forward
12+
...-the-count-of-numbers-which-are-not-special.cpp | 104 +++++++
13+
Codes/3238-find-the-number-of-winning-players.cpp | 58 ++++
14+
Codes/3238-find-the-number-of-winning-players.go | 26 ++
15+
Codes/3238-find-the-number-of-winning-players.java | 24 ++
16+
Codes/3238-find-the-number-of-winning-players.py | 14 +
17+
KongMingQi.cpp | 3 +-
18+
README.md | 4 +-
19+
Solutions/LeetCode 3238.求出胜利玩家的数目.md | 176 ++++++++++++
20+
Solutions/Other-English-LearningNotes-SomeWords.md | 9 +-
21+
Solutions/Other-Japanese-LearningNotes.md | 9 +-
22+
Solutions/Other-Python-LearnPythonFrom0.md | 100 +++++++
23+
Solutions/Other-Verilog-Note.md | 2 +
24+
history.del.html | 67 +++++
25+
history.del.ipynb | 238 ++++++++++++++++
26+
history.del.js | 68 +++++
27+
history.del2.js | 42 +++
28+
history.stillNeedREADME.del-视频压制.py | 305 +++++++++++++++++++++
29+
tryGo/JSFUZZ.bash | 19 --
30+
tryGo/chat-6yggde35y.bash | 118 --------
31+
temp-PythonTeaching.md => tryGo/temp-ZuiJin.md | 0
32+
tryGo/temp.2.html | 37 +++
33+
tryGo/temp.cssJianBian.html | 40 +++
34+
tryGo/tryEasyX.cpp | 17 --
35+
24 files changed, 1381 insertions(+), 158 deletions(-)
36+
create mode 100644 Codes/3233-find-the-count-of-numbers-which-are-not-special.cpp
37+
create mode 100644 Codes/3238-find-the-number-of-winning-players.cpp
38+
create mode 100644 Codes/3238-find-the-number-of-winning-players.go
39+
create mode 100644 Codes/3238-find-the-number-of-winning-players.java
40+
create mode 100644 Codes/3238-find-the-number-of-winning-players.py
41+
create mode 100644 Solutions/LeetCode 3238.求出胜利玩家的数目.md
42+
create mode 100644 Solutions/Other-Python-LearnPythonFrom0.md
43+
create mode 100644 history.del.html
44+
create mode 100644 history.del.ipynb
45+
create mode 100644 history.del.js
46+
create mode 100644 history.del2.js
47+
create mode 100644 history.stillNeedREADME.del-视频压制.py
48+
delete mode 100644 tryGo/JSFUZZ.bash
49+
delete mode 100644 tryGo/chat-6yggde35y.bash
50+
rename temp-PythonTeaching.md => tryGo/temp-ZuiJin.md (100%)
51+
create mode 100644 tryGo/temp.2.html
52+
create mode 100644 tryGo/temp.cssJianBian.html
53+
delete mode 100644 tryGo/tryEasyX.cpp
54+
create mode 100644 tryGo/tt.3.html
55+
PS F:\OtherApps\Program\Git\Store\Store20_LeetCode> cls^C
56+
PS F:\OtherApps\Program\Git\Store\Store20_LeetCode> git pull origin master
57+
remote: Enumerating objects: 30, done.
58+
remote: Counting objects: 100% (30/30), done.
59+
remote: Compressing objects: 100% (18/18), done.
60+
remote: Total 30 (delta 12), reused 29 (delta 12), pack-reused 0 (from 0)
61+
Unpacking objects: 100% (30/30), 46.26 KiB | 19.00 KiB/s, done.
62+
From github.com:LetMeFly666/LeetCode
63+
* branch master -> FETCH_HEAD
64+
6cb55b4a4..37a4490d3 master -> origin/master
65+
Updating 6cb55b4a4..37a4490d3
66+
Fast-forward
67+
.gitignore | 1 +
68+
...allest-range-covering-elements-from-k-lists.cpp | 174 +++
69+
KongMingQi.cpp | 1287 --------------------
70+
README.md | 1 +
71+
Solutions/LeetCode 0632.最小区间.md | 109 ++
72+
Solutions/Other-English-LearningNotes-SomeWords.md | 3 +
73+
Solutions/Other-Japanese-LearningNotes.md | 1 +
74+
Solutions/Other-Python-LearnPythonFrom0.md | 50 +-
75+
history.del.html | 67 -
76+
history.del.ipynb | 238 ----
77+
history.del.js | 68 --
78+
history.del2.js | 42 -
79+
history.stillNeedREADME.del-视频压制.py | 305 -----
80+
tryGo/.gitkeep | 2 -
81+
tryGo/temp.2.html | 37 -
82+
tryGo/temp.cssJianBian.html | 40 -
83+
tryGo/tt.3.html | 59 -
84+
tryGoPy/.gitkeep | 2 +
85+
{tryGo => tryGoPy}/OUT.md | 16 +-
86+
tryGoPy/py1/README.md | 13 +
87+
tryGoPy/py1/a.py | 8 +
88+
tryGoPy/py1/b.py | 10 +
89+
tryGo/temp-ZuiJin.md => tryGoPy/最近.md | 0
90+
{tryGo => tryGoPy}/本周周报.md | 34 +-
91+
24 files changed, 394 insertions(+), 2173 deletions(-)
92+
create mode 100644 Codes/0632-smallest-range-covering-elements-from-k-lists.cpp
93+
delete mode 100644 KongMingQi.cpp
94+
create mode 100644 Solutions/LeetCode 0632.最小区间.md
95+
delete mode 100644 history.del.html
96+
delete mode 100644 history.del.ipynb
97+
delete mode 100644 history.del.js
98+
delete mode 100644 history.del2.js
99+
delete mode 100644 history.stillNeedREADME.del-视频压制.py
100+
delete mode 100644 tryGo/.gitkeep
101+
delete mode 100644 tryGo/temp.2.html
102+
delete mode 100644 tryGo/temp.cssJianBian.html
103+
delete mode 100644 tryGo/tt.3.html
104+
create mode 100644 tryGoPy/.gitkeep
105+
rename {tryGo => tryGoPy}/OUT.md (86%)
106+
create mode 100644 tryGoPy/py1/README.md
107+
create mode 100644 tryGoPy/py1/a.py
108+
create mode 100644 tryGoPy/py1/b.py
109+
rename tryGo/temp-ZuiJin.md => tryGoPy/最近.md (100%)
110+
rename {tryGo => tryGoPy}/本周周报.md (92%)
111+
PS F:\OtherApps\Program\Git\Store\Store20_LeetCode>

0 commit comments

Comments
 (0)