Leetcode-Mistake-Collection
Leetcode-Mistake-collection
笔者又来开新坑啦！
缘起
在笔者刚刚步入大一时（也就是这学期），仗着自己暑假为数不多的C语言语法存货，觉得学校C++的课程进度有些落后，便在网上寻寻觅觅，想通过刷题的方式提升自己的代码水平。
当在网上搜索“新手小白刷编程题什么网站上最好”，十有八九跳出来的都是Leetcode。确实，Leetcode可以算作是数一数二优秀的编程训练网站了，各种界面设计也很符合我的审美。（就像他自己说的，全球极客挚爱的技术成长平台）。但是，对于当时习惯于把所有代码全部放进一个臃肿的main函数的我来说，Leetcode犹如一座高不可攀的山峰，好不容易弄懂了什么叫函数封装，竭尽全力也没办法做出 第一道题。🤡
之后在看 Hello 算法的时候在序言看到了一段感同身受的话：
两眼一抹黑地刷题似乎是最受欢迎的方法，简单、直接且有效。然而刷题就如同玩“扫雷”游戏，自学能力强的人能够顺利将地雷逐个排掉，而基础不足的人很可能被炸得满头是包，并在挫折中步步退缩。通读教材也是一种常见做法，但对于面向求职的人来说，毕业论文、投递简历、准备笔试和面试已经消耗了大部分精力，啃厚重的书往往变成了一项艰巨的挑战。
回想自己Leetcode的刷题之旅，真的是痛并快乐着，痛在算法题冷酷无情，将你所有的bug暴露无遗，根本不给你侥幸的机会，快乐在钻研一道题后终于看见超过了100%的人，快乐在从一开始的举步维艰，到逐渐能够尝试黄色中档题，再到得心应手，心平气和。
因此，我在此开坑，将自己过去，现在以及将来在Leetcode上所做的好题，错题，看到的优秀题解以及我自己整理一些笔记等等整理成博客的形式，一篇博客五道题，希望以此留作纪念，并能够给有相同志向的小伙伴们一点鼓励和指引。
内容（实时更新）
第一学期（主要以语法题和最基本的算法题为主）
- 基本语法题
- 数组、引用和指针的相关操作
- OOP
- STL入门
- 基本算法入门
- 排序算法
- 分治算法
- 回溯算法和递归算法
- 动态规划
- 贪心算法
第二学期（重点：数据结构）
（期待一波来年开春的疯狂更新~）
参考资料
English Version
Starting a New Adventure Again!
Background
When I first started university (this semester), armed with my limited knowledge of C language syntax from a short summer learning stint, I felt the pace of my C++ course at school was a bit slow. So, I searched online for ways to improve my coding skills through problem-solving practice.
When looking up “best websites for beginners to practice coding,” LeetCode popped up in most results. Indeed, LeetCode is one of the best programming training platforms, and its interface design aligns perfectly with my aesthetic (as they call themselves, “The beloved tech growth platform for geeks worldwide”). However, for someone like me who used to put all the code into one bloated main function, LeetCode seemed like an insurmountable mountain. After finally understanding what function encapsulation was, I still couldn’t manage to solve the first problem. 🤡
While reading Hello Algorithm, I came across a sentiment in the preface that resonated deeply with me:
Diving blindly into problem-solving is perhaps the most popular method—it’s simple, direct, and effective. However, it’s like playing a “Minesweeper” game: self-learners with a strong foundation can defuse the mines one by one, while those lacking fundamentals might get blown up and retreat in frustration. Reading textbooks is another common approach, but for job seekers, writing theses, submitting resumes, and preparing for tests and interviews consume most of their energy, making heavy textbooks a daunting challenge.
Looking back on my LeetCode journey, it truly has been a mix of pain and joy. The pain lies in the ruthless nature of algorithm problems, exposing all your bugs without mercy, leaving no room for luck. The joy comes from finally solving a problem and seeing “outperformed 100% of users”, from struggling with initial problems to tackling mid-level yellow questions, and eventually solving problems calmly and confidently.
That’s why I’m starting this series—to document the good problems, mistakes, excellent solutions, and notes from my past, present, and future LeetCode journey in the form of blog posts. Each post will include five problems, serving as a record and hopefully providing encouragement and guidance to like-minded peers.
Content (Updated in Real-Time)
First Semester (Primarily syntax and basic algorithm problems)
- Basic Syntax Problems
- Array, reference, and pointer operations
- OOP (Object-Oriented Programming)
- Intro to STL (Standard Template Library)
- Basic Algorithms
- Sorting algorithms
- Divide-and-conquer
- Backtracking and recursion
- Dynamic programming
- Greedy algorithms
Second Semester (Focus: Data Structures)
(Looking forward to some crazy updates next spring!)