<rss xmlns:atom="http://www.w3.org/2005/Atom" version="2.0">
    <channel>
        <title>Ubuk</title>
        <link>http://localhost:1313/</link>
        <description>这是我的全新 Hugo 网站</description>
        <generator>Hugo -- gohugo.io</generator><language>zh-CN</language><managingEditor>mymail_yjj@qq.com (o( ￣⌣￣ )o)</managingEditor>
            <webMaster>mymail_yjj@qq.com (o( ￣⌣￣ )o)</webMaster><lastBuildDate>Sun, 28 Jun 2026 10:06:39 &#43;0800</lastBuildDate>
            <atom:link href="http://localhost:1313/index.xml" rel="self" type="application/rss+xml" />
        <item>
    <title>高等数学笔记（上册）</title>
    <link>http://localhost:1313/posts/about_math/%E9%AB%98%E6%95%B0%E4%B8%8A/</link>
    <pubDate>Sun, 28 Jun 2026 10:06:39 &#43;0800</pubDate>
    <author>o( ￣⌣￣ )o</author>
    <guid>http://localhost:1313/posts/about_math/%E9%AB%98%E6%95%B0%E4%B8%8A/</guid>
    <description><![CDATA[<h2 id="参考资料">参考资料</h2>
<ul>
<li><a href="https://gitee.com/jason_ren/advanced-math-note/tree/main/notes" target="_blank" rel="noopener noreffer ">https://gitee.com/jason_ren/advanced-math-note/tree/main/notes</a></li>
<li><a href="https://www.cnblogs.com/ixtwuko/p/advanced-mathematics.html" target="_blank" rel="noopener noreffer ">https://www.cnblogs.com/ixtwuko/p/advanced-mathematics.html</a></li>
<li>2023版张宇考研数学基础30讲</li>
</ul>
<h1 id="第一章-函数与极限">第一章 函数与极限</h1>
<h2 id="11-函数">1.1 函数</h2>
<h3 id="函数的定义">函数的定义</h3>
<p>设 $x$ 和 $y$ 是两个变量, $D$ 是一个非空实数集。如果对于每一个 $x \in D$, 按照某个确定的对应法则 $f$, 都有 <strong>唯一确定的实数</strong> $y$ 与之对应, 则称 $f$ 为定义在 $D$ 上的 <strong>函数</strong>, 记作</p>]]></description>
</item>
<item>
    <title>Python进阶手册</title>
    <link>http://localhost:1313/posts/about_python/python%E8%BF%9B%E9%98%B6%E6%89%8B%E5%86%8C/</link>
    <pubDate>Tue, 02 Jun 2026 23:03:54 &#43;0800</pubDate>
    <author>o( ￣⌣￣ )o</author>
    <guid>http://localhost:1313/posts/about_python/python%E8%BF%9B%E9%98%B6%E6%89%8B%E5%86%8C/</guid>
    <description><![CDATA[<h2 id="参考资料">参考资料</h2>
<ul>
<li>
<p><a href="https://github.com/stacklens/django-knowledge-base/blob/master/md/250-Python" target="_blank" rel="noopener noreffer ">https://github.com/stacklens/django-knowledge-base/blob/master/md/250-Python</a>装饰器入门：从理解到应用.md</p>]]></description>
</item>
<item>
    <title>Python学习</title>
    <link>http://localhost:1313/posts/about_python/python%E5%AD%A6%E4%B9%A0/</link>
    <pubDate>Mon, 01 Jun 2026 22:51:14 &#43;0800</pubDate>
    <author>o( ￣⌣￣ )o</author>
    <guid>http://localhost:1313/posts/about_python/python%E5%AD%A6%E4%B9%A0/</guid>
    <description><![CDATA[<h2 id="参考资料">参考资料</h2>
<ul>
<li><a href="https://blog.csdn.net/appleyk/category_7067539.html" target="_blank" rel="noopener noreffer ">https://blog.csdn.net/appleyk/category_7067539.html</a></li>
</ul>
<h2 id="切片">切片</h2>
<p>对于有序对象，列表和元组，我们如果要获取其中的元素，可以通过下标索引访问<br>
对于字典，我们可以通过 .get 获取对应键的值<br>
对于集合，无法通过下标索引访问，一般我们是把 <strong>需要去重</strong> 的内容放进集合中</p>]]></description>
</item>
<item>
    <title>数据科学</title>
    <link>http://localhost:1313/posts/about_python/%E6%95%B0%E6%8D%AE%E7%A7%91%E5%AD%A6/</link>
    <pubDate>Sat, 16 May 2026 14:31:32 &#43;0800</pubDate>
    <author>o( ￣⌣￣ )o</author>
    <guid>http://localhost:1313/posts/about_python/%E6%95%B0%E6%8D%AE%E7%A7%91%E5%AD%A6/</guid>
    <description><![CDATA[<h2 id="参考资料">参考资料</h2>
<p>Data 100 Fall 2022 website 公开课</p>
<h2 id="data-100">Data 100</h2>
<h3 id="lec-01">lec 01</h3>
<ul>
<li>
<p>读取压缩文件内容</p>
<div class="highlight"><div class="chroma">
<table class="lntable"><tr><td class="lntd">
<pre tabindex="0" class="chroma"><code><span class="lnt">1
</span><span class="lnt">2
</span><span class="lnt">3
</span><span class="lnt">4
</span><span class="lnt">5
</span><span class="lnt">6
</span></code></pre></td>
<td class="lntd">
<pre tabindex="0" class="chroma"><code class="language-python" data-lang="python"><span class="line"><span class="cl"><span class="k">with</span> <span class="n">zipfile</span><span class="o">.</span><span class="n">ZipFile</span><span class="p">(</span><span class="n">filename</span><span class="p">,</span> <span class="s2">&#34;r&#34;</span><span class="p">)</span> <span class="k">as</span> <span class="n">zf</span><span class="p">:</span>
</span></span><span class="line"><span class="cl">    <span class="c1"># 列出压缩包内的文件</span>
</span></span><span class="line"><span class="cl">    <span class="nb">print</span><span class="p">(</span><span class="n">zf</span><span class="o">.</span><span class="n">filelist</span><span class="p">)</span>
</span></span><span class="line"><span class="cl">    <span class="n">f</span> <span class="o">=</span> <span class="s1">&#39;想要打开的文件名&#39;</span>
</span></span><span class="line"><span class="cl">    <span class="k">with</span> <span class="n">zf</span><span class="o">.</span><span class="n">open</span><span class="p">(</span><span class="n">f</span><span class="p">)</span> <span class="k">as</span> <span class="n">fp</span><span class="p">:</span>
</span></span><span class="line"><span class="cl">        <span class="o">......</span>
</span></span></code></pre></td></tr></table>
</div>
</div></li>
<li>
<p>透视表</p>
<div class="highlight"><div class="chroma">
<table class="lntable"><tr><td class="lntd">
<pre tabindex="0" class="chroma"><code><span class="lnt"> 1
</span><span class="lnt"> 2
</span><span class="lnt"> 3
</span><span class="lnt"> 4
</span><span class="lnt"> 5
</span><span class="lnt"> 6
</span><span class="lnt"> 7
</span><span class="lnt"> 8
</span><span class="lnt"> 9
</span><span class="lnt">10
</span></code></pre></td>
<td class="lntd">
<pre tabindex="0" class="chroma"><code class="language-python" data-lang="python"><span class="line"><span class="cl"><span class="p">(</span>
</span></span><span class="line"><span class="cl">    <span class="n">pd</span><span class="o">.</span><span class="n">pivot_table</span><span class="p">(</span>
</span></span><span class="line"><span class="cl">        <span class="n">babynames</span><span class="p">[</span><span class="n">babynames</span><span class="p">[</span><span class="s1">&#39;Name&#39;</span><span class="p">]</span><span class="o">.</span><span class="n">isin</span><span class="p">(</span><span class="n">subset_names</span><span class="p">)],</span>
</span></span><span class="line"><span class="cl">        <span class="n">index</span><span class="o">=</span><span class="p">[</span><span class="s1">&#39;Name&#39;</span><span class="p">,</span> <span class="s1">&#39;Year&#39;</span><span class="p">],</span> <span class="n">columns</span><span class="o">=</span><span class="s1">&#39;Sex&#39;</span><span class="p">,</span> <span class="n">values</span><span class="o">=</span><span class="s1">&#39;Count&#39;</span><span class="p">,</span>
</span></span><span class="line"><span class="cl">        <span class="n">aggfunc</span><span class="o">=</span><span class="s1">&#39;sum&#39;</span><span class="p">,</span> <span class="n">fill_value</span><span class="o">=</span><span class="mi">0</span><span class="p">,</span> <span class="n">margins</span><span class="o">=</span><span class="kc">True</span>
</span></span><span class="line"><span class="cl">    <span class="p">)</span>
</span></span><span class="line"><span class="cl">    <span class="o">.</span><span class="n">drop</span><span class="p">(</span><span class="n">labels</span><span class="o">=</span><span class="s1">&#39;All&#39;</span><span class="p">,</span> <span class="n">level</span><span class="o">=</span><span class="mi">0</span><span class="p">,</span> <span class="n">axis</span><span class="o">=</span><span class="mi">0</span><span class="p">)</span> <span class="c1"># 删除汇总行</span>
</span></span><span class="line"><span class="cl">    <span class="o">.</span><span class="n">rename_axis</span><span class="p">(</span><span class="kc">None</span><span class="p">,</span> <span class="n">axis</span><span class="o">=</span><span class="mi">1</span><span class="p">)</span> <span class="c1"># 去掉列索引名</span>
</span></span><span class="line"><span class="cl">    <span class="c1"># .reset_index() # 把 (Name, Year) 从索引挪回列</span>
</span></span><span class="line"><span class="cl"><span class="p">)</span>
</span></span></code></pre></td></tr></table>
</div>
</div><p>如上, 对于过长的链式代码可以用括号包裹并分行书写, 提高可读性</p>]]></description>
</item>
<item>
    <title>软件开发概念配套练习</title>
    <link>http://localhost:1313/posts/about_other/%E8%BD%AF%E4%BB%B6%E5%BC%80%E5%8F%91%E6%A6%82%E5%BF%B5%E9%85%8D%E5%A5%97%E7%BB%83%E4%B9%A0/</link>
    <pubDate>Sat, 16 May 2026 14:21:45 &#43;0800</pubDate>
    <author>o( ￣⌣￣ )o</author>
    <guid>http://localhost:1313/posts/about_other/%E8%BD%AF%E4%BB%B6%E5%BC%80%E5%8F%91%E6%A6%82%E5%BF%B5%E9%85%8D%E5%A5%97%E7%BB%83%E4%B9%A0/</guid>
    <description><![CDATA[<p>以下是一个为期 10 周、每周末练习一个核心概念的实战任务清单。我们以 <strong>Python + FastAPI</strong> 为技术栈，从零开始构建一个“简易订单系统”，逐步把前面学到的理论点全部落地。</p>]]></description>
</item>
<item>
    <title>软件开发概念</title>
    <link>http://localhost:1313/posts/about_other/%E8%BD%AF%E4%BB%B6%E5%BC%80%E5%8F%91%E6%A6%82%E5%BF%B5/</link>
    <pubDate>Sat, 16 May 2026 13:36:45 &#43;0800</pubDate>
    <author>o( ￣⌣￣ )o</author>
    <guid>http://localhost:1313/posts/about_other/%E8%BD%AF%E4%BB%B6%E5%BC%80%E5%8F%91%E6%A6%82%E5%BF%B5/</guid>
    <description><![CDATA[<h2 id="一solid-原则重点sod">一、SOLID 原则（重点：S、O、D）</h2>
<p>SOLID 是面向对象设计的五个原则，其中三个与依赖注入直接相关。</p>
<h3 id="1-单一职责原则srp">1. 单一职责原则（SRP）</h3>
<blockquote>
<p>一个类应该只有一个引起它变化的原因。</p></blockquote>
<p><strong>通俗讲</strong>：一个类只做一件事。<br>
<strong>与依赖注入的关系</strong>：如果一个类负责创建依赖、又执行业务逻辑、又做日志记录，它的职责就不单一。DI 把“创建依赖”的职责移除，让类只关注核心逻辑。</p>]]></description>
</item>
<item>
    <title>LeetCode 100题-7</title>
    <link>http://localhost:1313/posts/about_algorithm/leetcode100%E9%A2%98-7/</link>
    <pubDate>Sun, 10 May 2026 10:21:48 &#43;0800</pubDate>
    <author>o( ￣⌣￣ )o</author>
    <guid>http://localhost:1313/posts/about_algorithm/leetcode100%E9%A2%98-7/</guid>
    <description><![CDATA[]]></description>
</item>
<item>
    <title>LeetCode 100题-6</title>
    <link>http://localhost:1313/posts/about_algorithm/leetcode100%E9%A2%98-6/</link>
    <pubDate>Sun, 10 May 2026 10:16:48 &#43;0800</pubDate>
    <author>o( ￣⌣￣ )o</author>
    <guid>http://localhost:1313/posts/about_algorithm/leetcode100%E9%A2%98-6/</guid>
    <description><![CDATA[]]></description>
</item>
<item>
    <title>LeetCode 100题-5</title>
    <link>http://localhost:1313/posts/about_algorithm/leetcode100%E9%A2%98-5/</link>
    <pubDate>Sun, 10 May 2026 10:03:48 &#43;0800</pubDate>
    <author>o( ￣⌣￣ )o</author>
    <guid>http://localhost:1313/posts/about_algorithm/leetcode100%E9%A2%98-5/</guid>
    <description><![CDATA[]]></description>
</item>
<item>
    <title>LeetCode 100题-4</title>
    <link>http://localhost:1313/posts/about_algorithm/leetcode100%E9%A2%98-4/</link>
    <pubDate>Sat, 09 May 2026 23:25:48 &#43;0800</pubDate>
    <author>o( ￣⌣￣ )o</author>
    <guid>http://localhost:1313/posts/about_algorithm/leetcode100%E9%A2%98-4/</guid>
    <description><![CDATA[]]></description>
</item>
</channel>
</rss>
