- 博客(6)
- 收藏
- 关注
RSS订阅原创 LeetCode#1474
Approach 1: Traverse Linked List and Delete In PlaceIntuitionThe 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}mthnode and
2021-02-09 11:45:59
517
原创 LeetCode#1086. High Five
1086. High FiveExample 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 gotscores 91, 92, 60, 65, 87, and 100. Their top five average is (100
2021-02-08 00:37:55
276
原创 Pandas_AutoReport_财务自动化统计报表
Input/Output你好！ 这是你第一次使用 Markdown编辑器 所展示的欢迎页。如果你想学习如何使用Markdown编辑器, 可以仔细阅读这篇文章，了解一下Markdown的基本语法知识。新的改变我们对Markdown编辑器进行了一些功能拓展与语法支持，除了标准的Markdown编辑器功能，我们增加了如下几点新功能，帮助你用它写博客：全新的界面设计 ，将会带来全新的写作体验；在创作中心设置你喜爱的代码高亮样式，Markdown 将代码片显示选择的高亮样式 进行展示；增加了 图片拖拽
2020-12-25 16:20:09
377
2
原创 Python：日期相关问题总结
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 >= past24ag
2020-12-25 16:09:11
182
原创 LeetCode#110.Balanced Binary Tree(Tree/Height/DFS/Recursion)
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
2020-12-23 00:38:11
231
3
原创 Tree: Height/Depth/Level
Tree: Height/Depth/LevelTree: Height/Depth/LevelHeight110.Balanced Binary TreeDepth104. Maximum Depth of Binary Tree111. Minimum Depth of Binary TreeLevel102. Binary Tree Level Order TraversalTree: Height/Depth/LevelHeightHeight of node:The height o
2020-12-23 00:31:27
880
1
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人