Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

[pull] master from youngyangyang04:master #284

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
pull merged 3 commits into AlgorithmAndLeetCode:master from youngyangyang04:master
Jun 11, 2023
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion problems/0130.被围绕的区域.md
View file Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -18,7 +18,7 @@

## 思路

这道题目和1020. 飞地的数量正好反过来了,[1020. 飞地的数量](https://leetcode.cn/problems/number-of-enclaves/solution/by-carlsun-2-7lt9/)是求 地图中间的空格数,而本题是要把地图中间的'O'都改成'X'。
这道题目和1020. 飞地的数量正好反过来了,[1020. 飞地的数量](https://programmercarl.com/1020.%E9%A3%9E%E5%9C%B0%E7%9A%84%E6%95%B0%E9%87%8F.html)是求 地图中间的空格数,而本题是要把地图中间的'O'都改成'X'。

那么两题在思路上也是差不多的。

Expand Down
2 changes: 1 addition & 1 deletion problems/0200.岛屿数量.深搜版.md
View file Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -41,7 +41,7 @@

### 深度优先搜索

以下代码使用dfs实现,如果对dfs不太了解的话,建议先看这篇题解:[797.所有可能的路径](https://leetcode.cn/problems/all-paths-from-source-to-target/solution/by-carlsun-2-66pf/),
以下代码使用dfs实现,如果对dfs不太了解的话,建议先看这篇题解:[797.所有可能的路径](https://programmercarl.com/0797.%E6%89%80%E6%9C%89%E5%8F%AF%E8%83%BD%E7%9A%84%E8%B7%AF%E5%BE%84.html),

C++代码如下:

Expand Down
2 changes: 1 addition & 1 deletion problems/0417.太平洋大西洋水流问题.md
View file Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -140,7 +140,7 @@ public:

按照这样的逻辑,就可以写出如下遍历代码:(详细注释)

(如果对dfs基础内容就不懂,建议看 [「代码随想录」DFS算法精讲!](https://leetcode.cn/problems/all-paths-from-source-to-target/solution/by-carlsun-2-66pf/),还可以顺便解决 797. 所有可能的路径)
(如果对dfs基础内容就不懂,建议看 [「代码随想录」DFS算法精讲!](https://programmercarl.com/图论深搜理论基础.html),还可以顺便解决 [797. 所有可能的路径](https://programmercarl.com/0797.%E6%89%80%E6%9C%89%E5%8F%AF%E8%83%BD%E7%9A%84%E8%B7%AF%E5%BE%84.html))

```CPP
class Solution {
Expand Down
3 changes: 3 additions & 0 deletions problems/0463.岛屿的周长.md
View file Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -3,6 +3,9 @@
<img src="../pics/训练营.png" width="1000"/>
</a>
<p align="center"><strong><a href="https://mp.weixin.qq.com/s/tqCxrMEU-ajQumL1i8im9A">参与本项目</a>,贡献其他语言版本的代码,拥抱开源,让更多学习算法的小伙伴们收益!</strong></p>



# 463. 岛屿的周长

[力扣题目链接](https://leetcode.cn/problems/island-perimeter/)
Expand Down
6 changes: 4 additions & 2 deletions problems/0684.冗余连接.md
View file Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -131,9 +131,11 @@ private:
}
// 将v->u 这条边加入并查集
void join(int u, int v) {
if (isSame(u, v)) return ;
u = find(u); // 寻找u的根
v = find(v); // 寻找v的根
if (u == v) return ; // 如果发现根相同,则说明在一个集合,不用两个节点相连直接返回
father[v] = u;
}
}
public:
vector<int> findRedundantConnection(vector<vector<int>>& edges) {
init();
Expand Down
6 changes: 3 additions & 3 deletions problems/0695.岛屿的最大面积.md
View file Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -35,8 +35,8 @@

本题思路上比较简单,难点其实都是 dfs 和 bfs的理论基础,关于理论基础我在这里都有详细讲解 :

* [DFS理论基础](https://leetcode.cn/problems/all-paths-from-source-to-target/solution/by-carlsun-2-66pf/)
* [BFS理论基础](https://leetcode.cn/circle/discuss/V3FulB/)
* [DFS理论基础](https://programmercarl.com/图论深搜理论基础.html)
* [BFS理论基础](https://programmercarl.com/图论广搜理论基础.html)

## DFS

Expand Down Expand Up @@ -136,7 +136,7 @@ public:

## BFS

关于广度优先搜索,如果大家还不了解的话,看这里:[广度优先搜索精讲](https://leetcode.cn/circle/discuss/V3FulB/)
关于广度优先搜索,如果大家还不了解的话,看这里:[广度优先搜索精讲](https://programmercarl.com/图论广搜理论基础.html)

本题BFS代码如下:

Expand Down
2 changes: 1 addition & 1 deletion problems/0827.最大人工岛.md
View file Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -39,7 +39,7 @@

每改变一个0的方格,都需要重新计算一个地图的最大面积,所以 整体时间复杂度为:n^4。

如果对深度优先搜索不了解的录友,可以看这里:[深度优先搜索精讲](https://leetcode.cn/problems/all-paths-from-source-to-target/solution/by-carlsun-2-66pf/)
如果对深度优先搜索不了解的录友,可以看这里:[深度优先搜索精讲](https://programmercarl.com/图论深搜理论基础.html)


## 优化思路
Expand Down
2 changes: 1 addition & 1 deletion problems/0841.钥匙和房间.md
View file Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -56,7 +56,7 @@

所以本题是一个有向图搜索全路径的问题。 只能用深搜(DFS)或者广搜(BFS)来搜。

关于DFS的理论,如果大家有困惑,可以先看我这篇题解: [DFS理论基础](https://programmercarl.com/%E5%9B%BE%E8%AE%BA%E6%B7%B1%E6%90%9C%E7%90%86%E8%AE%BA%E5%9F%BA%E7%A1%80.html)
关于DFS的理论,如果大家有困惑,可以先看我这篇题解: [DFS理论基础](https://programmercarl.com/图论深搜理论基础.html)

**以下dfs分析 大家一定要仔细看,本题有两种dfs的解法,很多题解没有讲清楚**。 看完之后 相信你对dfs会有更深的理解。

Expand Down
3 changes: 2 additions & 1 deletion problems/1020.飞地的数量.md
View file Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -42,7 +42,8 @@

然后我们再去遍历这个地图,遇到有陆地的地方,去采用深搜或者广搜,边统计所有陆地。

如果对深搜或者广搜不够了解,建议先看这里:[深度优先搜索精讲](https://leetcode.cn/problems/all-paths-from-source-to-target/solution/by-carlsun-2-66pf/),[广度优先搜索精讲](https://leetcode.cn/circle/discuss/V3FulB/)
如果对深搜或者广搜不够了解,建议先看这里:[深度优先搜索精讲](https://programmercarl.com/图论深搜理论基础.html),[广度优先搜索精讲](https://programmercarl.com/图论广搜理论基础.html)。


采用深度优先搜索的代码如下:

Expand Down
131 changes: 131 additions & 0 deletions problems/qita/kstar.md
View file Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,131 @@
# 代码随想录知识星球

前一阵知识星球刚刚发布了[星球精华-大厂八股文(第三版)](https://programmercarl.com/other/kstar_baguwen.html)

这份八股文,就有30w字,将近400张思维导图,表格,分析图,整个PDF将近900页的篇幅。

这些其实都是星球录友们,每日打卡的内容,但这我也仅仅是整理了一部分,因为信息量确实巨大。

目前星球里已经有将近1000 个精华帖:

<div align="center"><img src='https://code-thinking-1253855093.file.myqcloud.com/pics/20221028105054.png' width=500 alt=''> </img></div>

同时还有[计算机2023届求职薪资PDF](https://programmercarl.com/other/2022salary.html)等一些列独家资料,都在星期置顶帖里:

<div align="center"><img src='https://code-thinking-1253855093.file.myqcloud.com/pics/20230516112821.png' width=500 alt=''> </img></div>

星球里的录友都可以得到我1V1的指导,**我已经详细回答了7000+个问题**: (这个回答问题数量,可以看出我有劳模的潜质 哈哈)

<div align="center"><img src='https://code-thinking-1253855093.file.myqcloud.com/pics/20230426103803.png' width=500 alt=''> </img></div>

有的时候,大家还是需要过来人,给指点一点,甚至是"踹一脚" 就会想清楚很多。

<div align="center"><img src='https://code-thinking-1253855093.file.myqcloud.com/pics/20220215164352.png' width=500 alt=''> </img></div>

不仅我回答问题,我还会邀请星球里各个方向的录友来和大家一起交流具体技术问题,这个就是星球导师计划: (如果想提问的话,也在星球置顶1可以找到链接)

<div align="center"><img src='https://code-thinking-1253855093.file.myqcloud.com/pics/20230516113144.png' width=500 alt=''> </img></div>

<div align="center"><img src='https://code-thinking-1253855093.file.myqcloud.com/pics/20230516113058.png' width=500 alt=''> </img></div>

可以看看星球导师计划里具体的问答:

<div align="center"><img src='https://code-thinking-1253855093.file.myqcloud.com/pics/20230516115057.png' width=500 alt=''> </img></div>

同时我还给录友们至少修改了上千份的简历,我也总结了很多大家写简历上问题。在 「写简历」这个tab上,可以找到我总结的所有问题和简历模板

<div align="center"><img src='https://code-thinking-1253855093.file.myqcloud.com/pics/20220516160018.png' width=500 alt=''> </img></div>

【专业技能】【项目经验】【自我评价】都应该怎么写,面试时候 自我介绍,应该怎么说,我都给出了我的建议:

<div align="center"><img src='https://code-thinking-1253855093.file.myqcloud.com/pics/20220516155906.png' width=500 alt=''> </img></div>


如果你还在犹豫要不要加入的话,**可以进来体验三天,三天内点击知识星球APP右上角,可以自助全额退款**。 绝对不会坑大家!
<div align="center"><img src='https://code-thinking-1253855093.file.myqcloud.com/pics/20230607171843.png' width=400 alt=''> </img></div>


一些录友当初也是进来 白嫖一波资料,就退款跑了 哈哈哈,不过后面又加回来,例如这位录友:

<div align="center"><img src='https://code-thinking-1253855093.file.myqcloud.com/pics/20220516160948.png' width=500 alt=''> </img></div>

**星球里的资料仅仅是辅助,更重要的是星球里的这一圈人,你会发现 这个圈子的质量非常高!**

不仅仅是 **211、985录友非常之多**,关键是大家都非常努力上进!

这是知识星球APP里可以看到,录友们的日常打卡:

<div align="center"><img src='https://code-thinking-1253855093.file.myqcloud.com/pics/20220516161612.png' width=500 alt=''> </img></div>

刷星球上的内容,要刷朋友圈,刷抖音,有意义的多。

<div align="center"><img src='https://code-thinking-1253855093.file.myqcloud.com/pics/20220321152039.png' width=500 alt=''> </img></div>

<div align="center"><img src='https://code-thinking-1253855093.file.myqcloud.com/pics/20211208223737.png' width=500 alt=''> </img></div>

星球网页版是这样的:

<div align="center"><img src='https://code-thinking-1253855093.file.myqcloud.com/pics/20220517161228.png' width=500 alt=''> </img></div>

加入星球,是很多录友当年做的最有意义的一件事情

<div align="center"><img src='https://code-thinking-1253855093.file.myqcloud.com/pics/20220103142102.png' width=500 alt=''> </img></div>
<div align="center"><img src='https://code-thinking-1253855093.file.myqcloud.com/pics/20220310154516.png' width=500 alt=''> </img></div>
<div align="center"><img src='https://code-thinking-1253855093.file.myqcloud.com/pics/20211217103704.png' width=500 alt=''> </img></div>
<div align="center"><img src='https://code-thinking-1253855093.file.myqcloud.com/pics/20211122223125.png' width=500 alt=''> </img></div>

可以看看星球里的交流氛围:

<div align="center"><img src='https://code-thinking-1253855093.file.myqcloud.com/pics/20211112170200.png' width=500 alt=''> </img></div>

<div align="center"><img src='https://code-thinking-1253855093.file.myqcloud.com/pics/20211112170840.png' width=500 alt=''> </img></div>

<div align="center"><img src='https://code-thinking-1253855093.file.myqcloud.com/pics/20211115182306.png' width=500 alt=''> </img></div>

<div align="center"><img src='https://code-thinking-1253855093.file.myqcloud.com/pics/20220115000350.png' width=500 alt=''> </img></div>

<div align="center"><img src='https://code-thinking-1253855093.file.myqcloud.com/pics/20220130214431.png' width=500 alt=''> </img></div>

大家的很多疑问在星球置顶3,我都做了详细的整理,录友都说我是"整理狂魔",不过大家懒,我就得勤劳一些。

<div align="center"><img src='https://code-thinking-1253855093.file.myqcloud.com/pics/20220516162241.png' width=500 alt=''> </img></div>

星球置顶3的信息量非常大,不仅仅是整理各个求职方向的学习路线,还有大家的常见疑惑,我之前回答过的内容,都做了整理。

大家看完之后,其实对自己就会有明确的规划了。

<div align="center"><img src='https://code-thinking-1253855093.file.myqcloud.com/pics/20220506151741.png' width=500 alt=''> </img></div>

给大家看看星球置顶帖3的部分内容,以下仅仅是部分截图:

<div align="center"><img src='https://code-thinking-1253855093.file.myqcloud.com/pics/20220516215651.png' width=500 alt=''> </img></div>

<div align="center"><img src='https://code-thinking-1253855093.file.myqcloud.com/pics/20220516215720.png' width=500 alt=''> </img></div>

<div align="center"><img src='https://code-thinking-1253855093.file.myqcloud.com/pics/20220516215746.png' width=500 alt=''> </img></div>

<div align="center"><img src='https://code-thinking-1253855093.file.myqcloud.com/pics/20220516215820.png' width=500 alt=''> </img></div>


大家加入星球后,一定要看星球置顶帖和精华帖的内容,你会发现这里很有优秀录友的帖子,包括:各种资料,学习路线,学习心得,规划,职场发展等等。

<div align="center"><img src='https://code-thinking-1253855093.file.myqcloud.com/pics/20220517161701.png' width=500 alt=''> </img></div>

很多录友看完之后都更加明确了自己的方向。

<div align="center"><img src='https://code-thinking-1253855093.file.myqcloud.com/pics/20220506151741.png' width=500 alt=''> </img></div>


相对于其他星球,「代码随想录」知识星球到底怎么样,可以看看录友们是怎么说的。

<div align="center"><img src='https://code-thinking-1253855093.cos.ap-guangzhou.myqcloud.com/pics/20210721143201.png' width=500 alt=''> </img></div>

最后也欢迎大家加入代码随想录[知识星球](https://mp.weixin.qq.com/s/wPaJumc8afuzWLo72yRlIw),**这里有很多优秀的人,有很多精彩的事!**

<div align="center"><img src='https://code-thinking-1253855093.file.myqcloud.com/pics/20220209171637.png' width=500 alt=''> </img></div>

这里依然给出10元代金券,微信扫领代金券加入,如果感觉不值得,**三天内知识星球APP右上角直接全额退款!** 无任何套路。

<div align="center"><img src='https://code-thinking-1253855093.file.myqcloud.com/pics/20230607171843.png' width=400 alt=''> </img></div>


Loading

AltStyle によって変換されたページ (->オリジナル) /