<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Python on Blog</title><link>https://icelemon.top/tags/python/</link><description>Recent content in Python on Blog</description><generator>Hugo</generator><language>zh-CN</language><lastBuildDate>Sat, 24 Oct 2026 00:00:00 +0800</lastBuildDate><atom:link href="https://icelemon.top/tags/python/index.xml" rel="self" type="application/rss+xml"/><item><title>Python 的对象、容器与函数</title><link>https://icelemon.top/tech/foundations/python/</link><pubDate>Sat, 24 Oct 2026 00:00:00 +0800</pubDate><guid>https://icelemon.top/tech/foundations/python/</guid><description>掌握算法和实验常用的 Python 语义，辨别引用、修改与复制。</description></item><item><title>Python 数据结构与算法学习路线</title><link>https://icelemon.top/tech/algorithms/python-algorithms-route/</link><pubDate>Sat, 24 Oct 2026 00:00:00 +0800</pubDate><guid>https://icelemon.top/tech/algorithms/python-algorithms-route/</guid><description>从分析与数据结构走到算法设计、图字符串和可复现的工程练习。</description></item><item><title>SLAM、占据地图与因子图优化</title><link>https://icelemon.top/tech/robotics/slam-factor-graphs/</link><pubDate>Sat, 24 Oct 2026 00:00:00 +0800</pubDate><guid>https://icelemon.top/tech/robotics/slam-factor-graphs/</guid><description>理解边定位边建图的耦合，用一维位姿图检查回环、权重和坐标自由度。</description></item><item><title>并查集与最小生成树</title><link>https://icelemon.top/tech/algorithms/connectivity-mst/</link><pubDate>Sat, 24 Oct 2026 00:00:00 +0800</pubDate><guid>https://icelemon.top/tech/algorithms/connectivity-mst/</guid><description>用集合合并维护连通关系，依据割性质理解 Kruskal 的安全选择。</description></item><item><title>带权最短路：松弛与算法前提</title><link>https://icelemon.top/tech/algorithms/weighted-graphs/</link><pubDate>Sat, 24 Oct 2026 00:00:00 +0800</pubDate><guid>https://icelemon.top/tech/algorithms/weighted-graphs/</guid><description>理解 Dijkstra 的非负权要求、过期堆条目及 Bellman–Ford 的负环判定。</description></item><item><title>递归、分治与回溯剪枝</title><link>https://icelemon.top/tech/algorithms/recursion-backtracking/</link><pubDate>Sat, 24 Oct 2026 00:00:00 +0800</pubDate><guid>https://icelemon.top/tech/algorithms/recursion-backtracking/</guid><description>把递归看成明确的子问题，用选择、递进、撤销生成不重复组合。</description></item><item><title>动力学与反馈控制：PID、LQR和MPC</title><link>https://icelemon.top/tech/robotics/dynamics-feedback/</link><pubDate>Sat, 24 Oct 2026 00:00:00 +0800</pubDate><guid>https://icelemon.top/tech/robotics/dynamics-feedback/</guid><description>从一维质量块理解模型、反馈、扰动和执行器饱和，比较控制器时保留相同条件。</description></item><item><title>动态规划：状态、转移与恢复方案</title><link>https://icelemon.top/tech/algorithms/dynamic-programming/</link><pubDate>Sat, 24 Oct 2026 00:00:00 +0800</pubDate><guid>https://icelemon.top/tech/algorithms/dynamic-programming/</guid><description>从 0/1 背包推导状态和遍历顺序，理解伪多项式成本及方案恢复。</description></item><item><title>二分查找：边界与单调判定</title><link>https://icelemon.top/tech/algorithms/binary-search/</link><pubDate>Sat, 24 Oct 2026 00:00:00 +0800</pubDate><guid>https://icelemon.top/tech/algorithms/binary-search/</guid><description>用半开区间推导 lower_bound，并把二分推广到答案空间。</description></item><item><title>范围查询与窗口：前缀和、单调队列、树状数组</title><link>https://icelemon.top/tech/algorithms/range-patterns/</link><pubDate>Sat, 24 Oct 2026 00:00:00 +0800</pubDate><guid>https://icelemon.top/tech/algorithms/range-patterns/</guid><description>依据查询和更新方式选模型，推导滑动最大值与动态前缀和的不变量。</description></item><item><title>哈希表：键、碰撞与计数</title><link>https://icelemon.top/tech/algorithms/hash-tables/</link><pubDate>Sat, 24 Oct 2026 00:00:00 +0800</pubDate><guid>https://icelemon.top/tech/algorithms/hash-tables/</guid><description>区分哈希与相等性，理解碰撞、装载因子及哈希表的平均成本。</description></item><item><title>机器学习中的数据、模型与评估</title><link>https://icelemon.top/tech/foundations/machine-learning/</link><pubDate>Sat, 24 Oct 2026 00:00:00 +0800</pubDate><guid>https://icelemon.top/tech/foundations/machine-learning/</guid><description>建立训练、验证、测试和基线意识，为具身学习做准备。</description></item><item><title>排序与选择：稳定性、分治与 Top-K</title><link>https://icelemon.top/tech/algorithms/sorting-selection/</link><pubDate>Sat, 24 Oct 2026 00:00:00 +0800</pubDate><guid>https://icelemon.top/tech/algorithms/sorting-selection/</guid><description>推导归并排序，比较常见排序的适用条件，并区分全排序和选择问题。</description></item><item><title>树、平衡树与优先队列</title><link>https://icelemon.top/tech/algorithms/trees-heaps/</link><pubDate>Sat, 24 Oct 2026 00:00:00 +0800</pubDate><guid>https://icelemon.top/tech/algorithms/trees-heaps/</guid><description>区分搜索树和堆的不变量，用固定大小堆实现流式 Top-K。</description></item><item><title>算法分析：正确性、复杂度与摊还</title><link>https://icelemon.top/tech/algorithms/analysis-correctness/</link><pubDate>Sat, 24 Oct 2026 00:00:00 +0800</pubDate><guid>https://icelemon.top/tech/algorithms/analysis-correctness/</guid><description>用循环不变量解释程序为什么正确，再区分增长率、最坏情况、期望和摊还成本。</description></item><item><title>算法工程：测量、随机化与问题边界</title><link>https://icelemon.top/tech/algorithms/algorithm-engineering/</link><pubDate>Sat, 24 Oct 2026 00:00:00 +0800</pubDate><guid>https://icelemon.top/tech/algorithms/algorithm-engineering/</guid><description>用可复现的查询测量、蓄水池抽样和顶点覆盖近似，理解性能与保证的差别。</description></item><item><title>算法工程与项目练习路线</title><link>https://icelemon.top/tech/algorithms/engineering-practice-route/</link><pubDate>Sat, 24 Oct 2026 00:00:00 +0800</pubDate><guid>https://icelemon.top/tech/algorithms/engineering-practice-route/</guid><description>从项目约束回到结构与算法，用正确性基线、复杂度和实际测量完成交付。</description></item><item><title>算法面试：从规格到反例与可验证实现</title><link>https://icelemon.top/tech/algorithms/interview-method/</link><pubDate>Sat, 24 Oct 2026 00:00:00 +0800</pubDate><guid>https://icelemon.top/tech/algorithms/interview-method/</guid><description>用原创连续区间问题演示如何澄清规格、建立基线、选择模型和证明去重规则。</description></item><item><title>算法面试练习路线</title><link>https://icelemon.top/tech/algorithms/interview-practice-route/</link><pubDate>Sat, 24 Oct 2026 00:00:00 +0800</pubDate><guid>https://icelemon.top/tech/algorithms/interview-practice-route/</guid><description>按规格澄清、基础结构、题型推导与沟通复盘组织练习，复用系统知识点。</description></item><item><title>贪心算法：局部选择与交换论证</title><link>https://icelemon.top/tech/algorithms/greedy-algorithms/</link><pubDate>Sat, 24 Oct 2026 00:00:00 +0800</pubDate><guid>https://icelemon.top/tech/algorithms/greedy-algorithms/</guid><description>证明最早结束的区间选择为何正确，并识别带权目标下的失败边界。</description></item><item><title>图遍历：BFS、DFS与拓扑顺序</title><link>https://icelemon.top/tech/algorithms/graph-traversal/</link><pubDate>Sat, 24 Oct 2026 00:00:00 +0800</pubDate><guid>https://icelemon.top/tech/algorithms/graph-traversal/</guid><description>用层次队列恢复最少边路径，区分访问状态、环检测和有向依赖顺序。</description></item><item><title>线性容器：数组、链表、栈与队列</title><link>https://icelemon.top/tech/algorithms/linear-containers/</link><pubDate>Sat, 24 Oct 2026 00:00:00 +0800</pubDate><guid>https://icelemon.top/tech/algorithms/linear-containers/</guid><description>从访问方式选择容器，用括号检查和广度队列理解线性结构的成本与不变量。</description></item><item><title>正逆运动学、雅可比与奇异性</title><link>https://icelemon.top/tech/robotics/kinematics-jacobians/</link><pubDate>Sat, 24 Oct 2026 00:00:00 +0800</pubDate><guid>https://icelemon.top/tech/robotics/kinematics-jacobians/</guid><description>用两连杆机械臂理解关节与末端的映射，数值检查雅可比，并识别不可达目标和奇异位形。</description></item><item><title>状态估计：Kalman、EKF与粒子滤波</title><link>https://icelemon.top/tech/robotics/state-estimation/</link><pubDate>Sat, 24 Oct 2026 00:00:00 +0800</pubDate><guid>https://icelemon.top/tech/robotics/state-estimation/</guid><description>把运动预测和带噪观测合并，检查协方差、创新和缺测，而不是只追求平滑曲线。</description></item><item><title>字符串算法：前缀、匹配与编码边界</title><link>https://icelemon.top/tech/algorithms/string-algorithms/</link><pubDate>Sat, 24 Oct 2026 00:00:00 +0800</pubDate><guid>https://icelemon.top/tech/algorithms/string-algorithms/</guid><description>推导 KMP 的失败转移，比较 Trie、滚动哈希与前缀编码的适用场景。</description></item><item><title>综合练习：本地倒排索引与检索</title><link>https://icelemon.top/tech/algorithms/search-index/</link><pubDate>Sat, 24 Oct 2026 00:00:00 +0800</pubDate><guid>https://icelemon.top/tech/algorithms/search-index/</guid><description>用词项到文档的反向映射实现多词 AND 查询，处理规范化、替换和确定性排序。</description></item><item><title>综合练习：依赖调度与关键路径</title><link>https://icelemon.top/tech/algorithms/dependency-planner/</link><pubDate>Sat, 24 Oct 2026 00:00:00 +0800</pubDate><guid>https://icelemon.top/tech/algorithms/dependency-planner/</guid><description>建立可验证的 DAG 调度器，报告环与未知依赖，并计算无限资源下的最早完成时间。</description></item></channel></rss>