Binary Tree Preorder Traversal 描述 分析 栈 Morris先序遍历 相关题目 Binary Tree Preorder Traversal 描述 Given a binary tree, return the preorder traversal of its nodes' values. For e...
Candy 描述 分析 迭代版 递归版 Candy 描述 There are N children standing in a line. Each child is assigned a rating value. You are giving candies to these children subjected to the f...
Letter Combinations of a Phone Number 描述 分析 递归 迭代 Letter Combinations of a Phone Number 描述 Given a digit string, return all possible letter combinations that the number c...
Binary Tree Preorder Traversal 描述 分析 栈 Morris先序遍历 相关题目 Binary Tree Preorder Traversal 描述 Given a binary tree, return the preorder traversal of its nodes' values. For e...
Candy 描述 分析 迭代版 递归版 Candy 描述 There are N children standing in a line. Each child is assigned a rating value. You are giving candies to these children subjected to the f...
Letter Combinations of a Phone Number 描述 分析 递归 迭代 Letter Combinations of a Phone Number 描述 Given a digit string, return all possible letter combinations that the number c...
Binary Tree Level Order Traversal II 描述 分析 递归版 迭代版 相关题目 Binary Tree Level Order Traversal II 描述 Given a binary tree, return the bottom-up level order traversal of its no...
Climbing Stairs 描述 分析 迭代 数学公式 相关题目 Climbing Stairs 描述 You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps....