AlfredaYu的博客

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

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

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

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