<?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>数据结构 on Jeanphilo Blog</title><link>https://shio-chan-dev.github.io/jeanblog/zh/tags/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/</link><description>Recent content in 数据结构 on Jeanphilo Blog</description><generator>Hugo -- 0.159.2</generator><language>zh-cn</language><lastBuildDate>Sat, 24 Jan 2026 13:20:24 +0800</lastBuildDate><atom:link href="https://shio-chan-dev.github.io/jeanblog/zh/tags/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/index.xml" rel="self" type="application/rss+xml"/><item><title>用队列实现栈：单队列旋转法</title><link>https://shio-chan-dev.github.io/jeanblog/zh/dev/algorithm/queue-to-stack/</link><pubDate>Sat, 24 Jan 2026 13:20:24 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/dev/algorithm/queue-to-stack/</guid><description>解释如何用队列模拟栈，并给出可运行实现与复杂度分析。</description></item><item><title>用栈实现队列：双栈法的思路与实现</title><link>https://shio-chan-dev.github.io/jeanblog/zh/dev/algorithm/stack-to-queue/</link><pubDate>Sat, 24 Jan 2026 13:20:24 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/dev/algorithm/stack-to-queue/</guid><description>解释如何用两个栈模拟队列，并给出可运行实现与复杂度分析。</description></item></channel></rss>