标签： 算法
-
leetcode讲解–559. Maximum Depth of N-ary Tree
The maximum depth is the number of nodes along the long…
-
leetcode讲解–867. Transpose Matrix
The transpose of a matrix is the matrix flipped over it…
-
leetcode讲解–908. Smallest Range I
Given an array A of integers, for each integer A[i] we …
-
leetcode讲解–883. Projection Area of 3D Shapes
On a N * N grid, we place some 1 * 1 * 1 cubes that are…
-
leetcode讲解–590. N-ary Tree Postorder Traversal
Given an n-ary tree, return the postorder traversal of …
-
经典算法：位图排序
最近发现一个有趣的排序算法，通过位图来完成排序。位图排序其实就是基数排序，只不过位图排序的下标是比特位。
-
leetcode讲解–700. Search in a Binary Search Tree
Given the root node of a binary search tree (BST) and a…
-
leetcode讲解–589. N-ary Tree Preorder Traversal
Given an n-ary tree, return the preorder traversal of i…
-
leetcode讲解–961. N-Repeated Element in Size 2N Array
In a array A of size 2N, there are N+1 unique elements,…
-
leetcode讲解–951. Flip Equivalent Binary Trees
For a binary tree T, we can define a flip operation as …