https://jiat-t.github.io/tags/c++/Recent content in C++ on 榎aaaa的个人主页https://jiat-t.github.io/images/avatar.jpghttps://jiat-t.github.io/images/avatar.jpgHugozh-CNThu, 02 Jul 2026 15:17:55 +0000https://jiat-t.github.io/leetcode/string/medium/reverse-integer/Tue, 17 Mar 2026 07:29:04 +0000https://jiat-t.github.io/leetcode/string/medium/reverse-integer/整数反转的解题思路与 C++ 实现。https://jiat-t.github.io/leetcode/string/medium/string-to-integer-atoi/Tue, 17 Mar 2026 07:29:04 +0000https://jiat-t.github.io/leetcode/string/medium/string-to-integer-atoi/字符串转换整数 (atoi)的解题思路与 C++ 实现。https://jiat-t.github.io/leetcode/technique/easy/palindrome-number/Tue, 17 Mar 2026 07:29:04 +0000https://jiat-t.github.io/leetcode/technique/easy/palindrome-number/回文数的解题思路与 C++ 实现。https://jiat-t.github.io/leetcode/string/easy/longest-common-prefix/Tue, 17 Mar 2026 07:29:04 +0000https://jiat-t.github.io/leetcode/string/easy/longest-common-prefix/最长公共前缀的解题思路与 C++ 实现。https://jiat-t.github.io/leetcode/double-pointers/easy/remove-element/Sat, 11 Apr 2026 05:23:52 +0000https://jiat-t.github.io/leetcode/double-pointers/easy/remove-element/移除元素的解题思路与 C++ 实现。https://jiat-t.github.io/leetcode/array/medium/maximum-subarray/Tue, 21 Apr 2026 09:45:56 +0000https://jiat-t.github.io/leetcode/array/medium/maximum-subarray/最大子数组和的解题思路与 C++ 实现。https://jiat-t.github.io/leetcode/array/medium/merge-intervals/Tue, 21 Apr 2026 09:45:56 +0000https://jiat-t.github.io/leetcode/array/medium/merge-intervals/合并区间的解题思路与 C++ 实现。https://jiat-t.github.io/leetcode/substring/hard/leetcode-substring-hard/Wed, 03 Jun 2026 04:09:47 +0000https://jiat-t.github.io/leetcode/substring/hard/leetcode-substring-hard/最小覆盖子串的解题思路与 C++ 实现。https://jiat-t.github.io/leetcode/stack/hard/leetcode-stack-hard/Tue, 02 Jun 2026 04:40:08 +0000https://jiat-t.github.io/leetcode/stack/hard/leetcode-stack-hard/柱状图中最大的矩形的解题思路与 C++ 实现。https://jiat-t.github.io/leetcode/binary-tree/hard/leetcode-binary-tree-hard/Tue, 02 Jun 2026 14:00:22 +0000https://jiat-t.github.io/leetcode/binary-tree/hard/leetcode-binary-tree-hard/二叉树中的最大路径和的解题思路与 C++ 实现。https://jiat-t.github.io/leetcode/double-pointers/easy/valid-palindrome/Sat, 11 Apr 2026 05:23:52 +0000https://jiat-t.github.io/leetcode/double-pointers/easy/valid-palindrome/验证回文串的解题思路与 C++ 实现。https://jiat-t.github.io/leetcode/heap/easy/leetcode-heap-easy/Mon, 25 May 2026 10:57:48 +0000https://jiat-t.github.io/leetcode/heap/easy/leetcode-heap-easy/库存管理 III的解题思路与 C++ 实现。https://jiat-t.github.io/leetcode/array/medium/rotate-array/Tue, 21 Apr 2026 09:45:56 +0000https://jiat-t.github.io/leetcode/array/medium/rotate-array/轮转数组的解题思路与 C++ 实现。https://jiat-t.github.io/leetcode/graph/medium/number-of-islands/Sun, 12 Apr 2026 04:30:04 +0000https://jiat-t.github.io/leetcode/graph/medium/number-of-islands/岛屿数量的解题思路与 C++ 实现。https://jiat-t.github.io/leetcode/array/medium/product-of-array-except-self/Tue, 21 Apr 2026 09:45:56 +0000https://jiat-t.github.io/leetcode/array/medium/product-of-array-except-self/除了自身以外数组的乘积的解题思路与 C++ 实现。https://jiat-t.github.io/leetcode/sliding-window/hard/leetcode-sliding-window-hard/Sat, 30 May 2026 02:42:58 +0000https://jiat-t.github.io/leetcode/sliding-window/hard/leetcode-sliding-window-hard/滑动窗口最大值的解题思路与 C++ 实现。https://jiat-t.github.io/leetcode/double-pointers/easy/move-zeroes/Sat, 11 Apr 2026 05:23:52 +0000https://jiat-t.github.io/leetcode/double-pointers/easy/move-zeroes/移动零的解题思路与 C++ 实现。https://jiat-t.github.io/leetcode/string/easy/leetcode-string-easy/Thu, 11 Jun 2026 03:16:27 +0000https://jiat-t.github.io/leetcode/string/easy/leetcode-string-easy/字符串相加的解题思路与 C++ 实现。https://jiat-t.github.io/leetcode/substring/medium/leetcode-substring-medium/Mon, 04 May 2026 04:06:55 +0000https://jiat-t.github.io/leetcode/substring/medium/leetcode-substring-medium/和为 K 的子数组的解题思路与 C++ 实现。https://jiat-t.github.io/leetcode/graph/medium/rotting-oranges/Sun, 12 Apr 2026 04:30:04 +0000https://jiat-t.github.io/leetcode/graph/medium/rotting-oranges/腐烂的橘子的解题思路与 C++ 实现。https://jiat-t.github.io/cpp/network-and-os-notes/Thu, 02 Jul 2026 14:15:14 +0000https://jiat-t.github.io/cpp/network-and-os-notes/整理进程与线程、同步与内存管理，以及网络协议和游戏客户端通信中的常见基础问题。https://jiat-t.github.io/graphics/pathtracer-code-notes/Tue, 02 Jun 2026 06:16:19 +0000https://jiat-t.github.io/graphics/pathtracer-code-notes/按路径追踪、几何与 BVH、材质接口、PBR 和 IBL/MIS 梳理个人渲染器的代码职责与工程优化。https://jiat-t.github.io/cpp/sorting-algorithms/Sat, 30 May 2026 11:44:59 +0000https://jiat-t.github.io/cpp/sorting-algorithms/记录快速排序的区间划分、基准值放置和递归实现，保留对应 C++ 代码与参考链接。https://jiat-t.github.io/graphics/pathtracer-project-details/Tue, 26 May 2026 05:46:15 +0000https://jiat-t.github.io/graphics/pathtracer-project-details/整理个人 CPU 路径追踪器的模块分工、PBR 与 IBL、MIS 采样及 BVH 和多线程性能优化。https://jiat-t.github.io/posts/design-modes/Wed, 20 May 2026 00:00:00 +0800https://jiat-t.github.io/posts/design-modes/整理单例模式与工厂模式的基础定义、实现方式和常见问题。https://jiat-t.github.io/leetcode/back-track/backtracking-overview/Sun, 26 Apr 2026 06:46:04 +0000https://jiat-t.github.io/leetcode/back-track/backtracking-overview/记录回溯算法的结果集合、当前路径、终止条件以及撤销操作的 C++ 模板。https://jiat-t.github.io/graphics/games101-assignment-5/Thu, 26 Mar 2026 07:38:19 +0000https://jiat-t.github.io/graphics/games101-assignment-5/整理从像素坐标生成相机光线的空间变换流程，以及三角形求交的基础实现。https://jiat-t.github.io/graphics/games101-assignment-4/Sun, 22 Mar 2026 06:46:41 +0000https://jiat-t.github.io/graphics/games101-assignment-4/记录 De Casteljau 递归插值绘制 Bézier 曲线的方法，以及采样步长与曲线绘制代码。https://jiat-t.github.io/graphics/games101-assignment-2/Thu, 19 Mar 2026 06:55:49 +0000https://jiat-t.github.io/graphics/games101-assignment-2/记录三角形内部判断、包围盒遍历、重心坐标与深度测试的光栅化实现。