CareerInterview prep
LeetCode Solutions
LeetCode Solutions
Welcome to the LeetCode solutions section.
SectionIndex: root path "career/interview-prep/leetcode" not found in pageTree
贡献者
这篇文章有帮助吗?
最近更新
Involution Hell© 2026 byCommunityunderCC BY-NC-SA 4.0
A Programmer's Guide to Job Searching and Internships as a Student
Student job search guide covering part-time work, internships, and graduate programs with extracurricular tips for securing offers before graduation.
121.The best time for buying and selling stocks
LeetCode 121. 买卖股票的最佳时机 题解 — 使用动态规划(DP)求解单次交易最大利润,核心技巧是维护历史最低股价并实时计算当日卖出收益。适合准备算法面试、刷 LeetCode 数组与 DP 题的求职者和 CS 学生。