Grandyang

LeetCode 题目讲解

Please buy me a coffee:https://www.buymeacoffee.com/grandyang博客园:https://www.cnblogs.com/grandyang/p/4606334.htmlGitHub:https://github.com/grandyang/leetcode个人网页:https://grandyang.com

Author

Grandyang

Category

Technology

Podcast website

grandyang.com

Latest episode

Jun 12, 2024

Where to listen?

Podcasts in the app Replaio Radio Coming soon

Podcasts are coming to the app soon. Install now and be the first to see a whole new take on podcasts

Get it on Google Play Install for free Android almost 10M downloads · 4.8 rating iOS soon

Episodes

[LeetCode] 38. Count and Say 外观数列 13.11.2023

Please buy me a coffee: https://www.buymeacoffee.com/grandyang   [LeetCode] 38. Count and Say 外观数列 博客园:https://www.cnblogs.com/grandyang/p/4086299.html GitHub:https://github.com/grandyang/leetcode/issues/38 个人网页:https://grandyang.com/leetcode/38/

[LeetCode] 37. Sudoku Solver 求解数独 12.11.2023

Please buy me a coffee: https://www.buymeacoffee.com/grandyang [LeetCode] 37. Sudoku Solver 求解数独 博客园:https://www.cnblogs.com/grandyang/p/4421852.html GitHub:https://github.com/grandyang/leetcode/issues/37 个人网页:https://grandyang.com/leetcode/37/

[LeetCode] 36. Valid Sudoku 有效的数独 11.11.2023

Please buy me a coffee: https://www.buymeacoffee.com/grandyang   [LeetCode] 36. Valid Sudoku 有效的数独 博客园:https://www.cnblogs.com/grandyang/p/4421217.html GitHub:https://github.com/grandyang/leetcode/issues/36 个人网页:https://grandyang.com/leetcode/36/

[LeetCode] 35. Search Insert Position 搜索插入位置 10.11.2023

Please buy me a coffee: https://www.buymeacoffee.com/grandyang [LeetCode] 35. Search Insert Position 搜索插入位置 博客园:https://www.cnblogs.com/grandyang/p/4408638.html GitHub:https://github.com/grandyang/leetcode/issues/35 个人网页:https://grandyang.com/leetcode/35/

[LeetCode] 34. Find First and Last Position of Element in Sorted Array 在排序数组中查找元素的第一个和最后一个位置 09.11.2023

Please buy me a coffee: https://www.buymeacoffee.com/grandyang [LeetCode] 34. Find First and Last Position of Element in Sorted Array 在排序数组中查找元素的第一个和最后一个位置 博客园:https://www.cnblogs.com/grandyang/p/4409379.html GitHub:https://github.com/grandyang/leetcode/issues/34 个人网页:https://grandyang.com/leetcode/34/

[LeetCode] 33. Search in Rotated Sorted Array 搜索旋转排序数组 08.11.2023

Please buy me a coffee: https://www.buymeacoffee.com/grandyang   [LeetCode] 33. Search in Rotated Sorted Array 搜索旋转排序数组 博客园:https://www.cnblogs.com/grandyang/p/4325648.html GitHub:https://github.com/grandyang/leetcode/issues/33 个人网页:https://grandyang.com/leetcode/33/

[LeetCode] 32. Longest Valid Parentheses 最长有效括号 07.11.2023

Please buy me a coffee: https://www.buymeacoffee.com/grandyang   [LeetCode] 32. Longest Valid Parentheses 最长有效括号 博客园:https://www.cnblogs.com/grandyang/p/4424731.html GitHub:https://github.com/grandyang/leetcode/issues/32 个人网页:https://grandyang.com/leetcode/32/

[LeetCode] 31. Next Permutation 下一个排列 06.11.2023

Please buy me a coffee: https://www.buymeacoffee.com/grandyang 博客园:https://www.cnblogs.com/grandyang/p/4428207.html GitHub:https://github.com/grandyang/leetcode/issues/31 个人网页:https://grandyang.com/leetcode/31/

[LeetCode] 30. Substring with Concatenation of All Words 串联所有单词的子串 05.11.2023

Please buy me a coffee: https://www.buymeacoffee.com/grandyang   博客园:https://www.cnblogs.com/grandyang/p/4521224.html GitHub:https://github.com/grandyang/leetcode/issues/30 个人网页:https://grandyang.com/leetcode/30/

[LeetCode] 29. Divide Two Integers 两数相除 04.11.2023

Please buy me a coffee: https://www.buymeacoffee.com/grandyang   博客园:https://www.cnblogs.com/grandyang/p/4431949.html GitHub:https://github.com/grandyang/leetcode/issues/29 个人网页:https://grandyang.com/leetcode/29/

[LeetCode] 28. Find the Index of the First Occurrence in a String 找出字符串中第一个匹配项的下标 03.11.2023

Please buy me a coffee: https://www.buymeacoffee.com/grandyang 博客园:https://www.cnblogs.com/grandyang/p/4606696.html GitHub:https://github.com/grandyang/leetcode/issues/28 个人网页:https://grandyang.com/leetcode/28/

[LeetCode] 27. Remove Element 移除元素 02.11.2023

Please buy me a coffee: https://www.buymeacoffee.com/grandyang 博客园:https://www.cnblogs.com/grandyang/p/4606700.html GitHub:https://github.com/grandyang/leetcode/issues/27 个人网页:https://grandyang.com/leetcode/27/

[LeetCode] 26. Remove Duplicates from Sorted Array 删除有序数组中的重复项 01.11.2023

Please buy me a coffee: https://www.buymeacoffee.com/grandyang 博客园:https://www.cnblogs.com/grandyang/p/4329128.html GitHub:https://github.com/grandyang/leetcode/issues/26 个人网页:https://grandyang.com/leetcode/26/

[LeetCode] 25. Reverse Nodes in k-Group 每k个一组翻转链表 31.10.2023

Please buy me a coffee: https://www.buymeacoffee.com/grandyang 博客园:https://www.cnblogs.com/grandyang/p/4441324.html GitHub:https://github.com/grandyang/leetcode/issues/25 个人网页:https://grandyang.com/leetcode/25/

[LeetCode] 24. Swap Nodes in Pairs 两两交换链表中的节点 30.10.2023

Please buy me a coffee: https://www.buymeacoffee.com/grandyang 博客园:https://www.cnblogs.com/grandyang/p/4441680.html GitHub:https://github.com/grandyang/leetcode/issues/24 个人网页:https://grandyang.com/leetcode/24/

[LeetCode] 23. Merge k Sorted Lists 合并 K 个升序链表 29.10.2023

Please buy me a coffee: https://www.buymeacoffee.com/grandyang   博客园:https://www.cnblogs.com/grandyang/p/4606710.html GitHub:https://github.com/grandyang/leetcode/issues/23 个人网页:https://grandyang.com/leetcode/23/

[LeetCode] 22. Generate Parentheses 括号生成 28.10.2023

Please buy me a coffee: https://www.buymeacoffee.com/grandyang   博客园:https://www.cnblogs.com/grandyang/p/4444160.html GitHub:https://github.com/grandyang/leetcode/issues/22 个人网页:https://grandyang.com/leetcode/22/

[LeetCode] 21. Merge Two Sorted Lists 合并两个有序链表 27.10.2023

Please buy me a coffee: https://www.buymeacoffee.com/grandyang [LeetCode] 21. Merge Two Sorted Lists 合并两个有序链表 博客园:https://www.cnblogs.com/grandyang/p/4086297.html GitHub:https://github.com/grandyang/leetcode/issues/21 个人网页:https://grandyang.com/leetcode/21/

[LeetCode] 20. Valid Parentheses 有效的括号 26.10.2023

Please buy me a coffee: https://www.buymeacoffee.com/grandyang 博客园:https://www.cnblogs.com/grandyang/p/4424587.html GitHub:https://github.com/grandyang/leetcode/issues/20 个人网页:https://grandyang.com/leetcode/20/

[LeetCode] 19. Remove Nth Node From End of List 删除链表的倒数第 N 个结点 25.10.2023

Please buy me a coffee: https://www.buymeacoffee.com/grandyang 博客园:https://www.cnblogs.com/grandyang/p/4606920.html GitHub:https://github.com/grandyang/leetcode/issues/19 个人网页:https://grandyang.com/leetcode/19/

[LeetCode] 18. 4Sum 四数之和 24.10.2023

Please buy me a coffee: https://www.buymeacoffee.com/grandyang 博客园: https://www.cnblogs.com/grandyang/p/4515925.html GitHub: https://github.com/grandyang/leetcode/issues/18 个人网页: https://grandyang.com/leetcode/18/

[LeetCode] 17. Letter Combinations of a Phone Number 电话号码的字母组合 23.10.2023

Please buy me a coffee: https://www.buymeacoffee.com/grandyang [LeetCode] 17. Letter Combinations of a Phone Number 电话号码的字母组合 博客园:https://www.cnblogs.com/grandyang/p/4452220.html GitHub:https://github.com/grandyang/leetcode/issues/17 个人网页:https://grandyang.com/leetcode/17/

[LeetCode] 16. 3Sum Closest 最接近的三数之和 22.10.2023

Please buy me a coffee: https://www.buymeacoffee.com/grandyang [LeetCode] 16. 3Sum Closest 最接近的三数之和 博客园:https://www.cnblogs.com/grandyang/p/4510984.html GitHub:https://github.com/grandyang/leetcode/issues/16 个人网页:https://grandyang.com/leetcode/16/

[LeetCode] 15. 3Sum 三数之和 22.10.2023

Please buy me a coffee: https://www.buymeacoffee.com/grandyang [LeetCode] 15. 3Sum 三数之和 博客园:https://www.cnblogs.com/grandyang/p/4481576.html GitHub:https://github.com/grandyang/leetcode/issues/15 个人网页:https://grandyang.com/leetcode/15/

[LeetCode] 14. Longest Common Prefix 最长公共前缀 22.10.2023

Please buy me a coffee: https://www.buymeacoffee.com/grandyang [LeetCode] 14. Longest Common Prefix 最长公共前缀 博客园:https://www.cnblogs.com/grandyang/p/4606926.html GitHub:https://github.com/grandyang/leetcode/issues/14 个人网页:https://grandyang.com/leetcode/14/

Listen to the LeetCode 题目讲解 podcast in Replaio

Radio and podcasts in one app - free, with no sign-up. Install today and do not miss the launch

Get it on Google Play

Replaio is not a podcast publisher; show names, artwork and audio belong to their authors and are distributed through public RSS feeds.