<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[AlfredaYu的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/AlfredaYu</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; AlfredaYu]]></copyright><item><title><![CDATA[LeetCode#1474]]></title><link>https://blog.youkuaiyun.com/AlfredaYu/article/details/113768433</link><guid>https://blog.youkuaiyun.com/AlfredaYu/article/details/113768433</guid><author>AlfredaYu</author><pubDate>Tue, 09 Feb 2021 11:45:59 +0800</pubDate><description><![CDATA[Approach 1: Traverse Linked List and Delete In Place
Intuition
The singly linked list can be traversed linearly starting from the head node. As we must delete nn nodes after every mm nodes, we must traverse the first mm nodes, store the m^{th}m
th
node and]]></description><category></category></item><item><title><![CDATA[LeetCode#1086. High Five]]></title><link>https://blog.youkuaiyun.com/AlfredaYu/article/details/113750097</link><guid>https://blog.youkuaiyun.com/AlfredaYu/article/details/113750097</guid><author>AlfredaYu</author><pubDate>Mon, 08 Feb 2021 00:37:55 +0800</pubDate><description><![CDATA[1086. High Five
Example 1:

Input: items =
[[1,91],[1,92],[2,93],[2,97],[1,60],[2,77],[1,65],[1,87],[1,100],[2,100],[2,76]]
Output: [[1,87],[2,88]] Explanation:  The student with ID = 1 got
scores 91, 92, 60, 65, 87, and 100. Their top five average is (100]]></description><category></category></item><item><title><![CDATA[Pandas_AutoReport_财务自动化统计报表]]></title><link>https://blog.youkuaiyun.com/AlfredaYu/article/details/109724289</link><guid>https://blog.youkuaiyun.com/AlfredaYu/article/details/109724289</guid><author>AlfredaYu</author><pubDate>Fri, 25 Dec 2020 16:20:09 +0800</pubDate><description><![CDATA[Input/Output
你好！ 这是你第一次使用 Markdown编辑器 所展示的欢迎页。如果你想学习如何使用Markdown编辑器, 可以仔细阅读这篇文章，了解一下Markdown的基本语法知识。
新的改变
我们对Markdown编辑器进行了一些功能拓展与语法支持，除了标准的Markdown编辑器功能，我们增加了如下几点新功能，帮助你用它写博客：

全新的界面设计 ，将会带来全新的写作体验；
在创作中心设置你喜爱的代码高亮样式，Markdown 将代码片显示选择的高亮样式 进行展示；
增加了 图片拖拽 ]]></description><category></category></item><item><title><![CDATA[Python：日期相关问题总结]]></title><link>https://blog.youkuaiyun.com/AlfredaYu/article/details/110531384</link><guid>https://blog.youkuaiyun.com/AlfredaYu/article/details/110531384</guid><author>AlfredaYu</author><pubDate>Fri, 25 Dec 2020 16:09:11 +0800</pubDate><description><![CDATA[python 日期处理
def past24Mons(time):
    time = time.replace('-', '')
    past24ago = '{}{}'.format(int(datetime.datetime.now().strftime('%Y%m%d')[:4]) - 2,
                              datetime.datetime.now().strftime('%m%d'))
    return time &gt;= past24ag]]></description><category></category></item><item><title><![CDATA[LeetCode#110.Balanced Binary Tree(Tree/Height/DFS/Recursion)]]></title><link>https://blog.youkuaiyun.com/AlfredaYu/article/details/111570215</link><guid>https://blog.youkuaiyun.com/AlfredaYu/article/details/111570215</guid><author>AlfredaYu</author><pubDate>Wed, 23 Dec 2020 00:38:11 +0800</pubDate><description><![CDATA[LeetCode#110.Balanced Binary Tree_Tree/Height/DFS/Recursion
目录LeetCode#110.Balanced Binary Tree_Tree/Height/DFS/Recursion题目要点基本概念参考资料解题解法一解法二
题目
Given a binary tree, determine if it is height-balanced.
For this problem, a height-balanced binary tree is def]]></description><category></category></item><item><title><![CDATA[Tree: Height/Depth/Level]]></title><link>https://blog.youkuaiyun.com/AlfredaYu/article/details/111567952</link><guid>https://blog.youkuaiyun.com/AlfredaYu/article/details/111567952</guid><author>AlfredaYu</author><pubDate>Wed, 23 Dec 2020 00:31:27 +0800</pubDate><description><![CDATA[Tree: Height/Depth/LevelTree: Height/Depth/LevelHeight110.Balanced Binary TreeDepth104. Maximum Depth of Binary Tree111. Minimum Depth of Binary TreeLevel102. Binary Tree Level Order Traversal
Tree: Height/Depth/Level

Height

Height of node:

The height o]]></description><category></category></item></channel></rss>