项目复盘、力扣刷题总结与技术随想https://gongchenhao.cn/https://gongchenhao.cn/posts/leetcode/leetcode-0283-move-zeroes/https://gongchenhao.cn/posts/leetcode/leetcode-0283-move-zeroes/移动零的三种解法与原地操作精髓：辅助数组、覆盖补零到快慢指针交换，并剖析 C++ 引用传参 vector<int>& 的核心本质。Wed, 04 Nov 2026 07:24:00 GMThttps://gongchenhao.cn/posts/leetcode/leetcode-0128-longest-consecutive/https://gongchenhao.cn/posts/leetcode/leetcode-0128-longest-consecutive/解析力扣 128 题最长连续序列：为什么排序被否决、如何用哈希集合去重，以及通过「只从连续段头起跑」将复杂度稳定压在 O(n) 的核心思维。Wed, 04 Nov 2026 07:23:00 GMThttps://gongchenhao.cn/posts/leetcode/leetcode-0049-group-anagrams/https://gongchenhao.cn/posts/leetcode/leetcode-0049-group-anagrams/字母异位词分组的 C++ 深入解析：从组长招募法到排序签名与 26 位计数法，彻底理清 vector<vector<string>> 的锯齿结构与传参细节。Wed, 04 Nov 2026 07:22:00 GMThttps://gongchenhao.cn/posts/leetcode/leetcode-0011-container-with-most-water/https://gongchenhao.cn/posts/leetcode/leetcode-0011-container-with-most-water/盛最多水的容器双指针解法深度推导：从数学公式证明为什么必须移动短板，以及指针跳跃消除无效计算的进阶技巧。Wed, 04 Nov 2026 07:21:00 GMThttps://gongchenhao.cn/posts/leetcode/leetcode-0001-two-sum/https://gongchenhao.cn/posts/leetcode/leetcode-0001-two-sum/两数之和的三种 C++ 解法演进：暴力 O(n^2)、两次哈希到单遍哈希，以及 unordered_map operator[] 会悄悄插入的经典大坑。Wed, 04 Nov 2026 07:20:00 GMThttps://gongchenhao.cn/posts/projects/rea-reverse-fakegps/https://gongchenhao.cn/posts/projects/rea-reverse-fakegps/高德打开 5 秒就跳回真实位置，用 REA + jadx 看清一款闭源虚拟定位 App 的做法，对齐后在小米上跑通。Wed, 04 Nov 2026 05:59:36 GMThttps://gongchenhao.cn/posts/projects/personal-website/https://gongchenhao.cn/posts/projects/personal-website/记录购买 gongchenhao.cn、用 developerFolio 做简历站、用 Astro 搭博客的全过程和踩过的坑。Tue, 03 Nov 2026 02:00:00 GMThttps://gongchenhao.cn/posts/thoughts/why-i-blog/https://gongchenhao.cn/posts/thoughts/why-i-blog/写博客不是为了流量，而是逼自己把事情想清楚。Sun, 01 Nov 2026 13:00:00 GMT