石头说钱

Binary Tree Level Order Traversal 二叉树层序遍历 Example BFS方法

石头说钱

94. Binary Tree Inorder Traversal Binary Tree Inorder Traversal中序遍历二叉树 注意二叉树并不是左节点小于父节点...

石头说钱

113. Path Sum II Given a binary tree and a sum, find all root-to-leaf paths where each ...

石头说钱

Path Sum Given a binary tree and a sum, determine if the tree has a root-to-leaf path s...

石头说钱

题目:Balanced Binary Tree Minimum Depth of Binary Tree Example 1Given the following tree ...

石头说钱

题目:Balanced Binary Tree Given a binary tree, determine if it is height-balanced.a binar...

石头说钱

题目 Given an array where elements are sorted in ascending order, convert it to a height ...

石头说钱

107 Binary Tree Level Order Traversal II 题目描述 Given a binary tree, return the bottom-up...

石头说钱

题目 Compute and return the square root of x, where x is guaranteed to be a non-negative ...

石头说钱

题目:找出二叉树的最大深度 Given a binary tree, find its maximum depth.The maximum depth is the numb...

石头说钱

题目判断二叉树是对称 Given a binary tree, check whether it is a mirror of itself (ie, symmetric a...

石头说钱

题目判断二叉树是否完全一样 Given two binary trees, write a function to check if they are the same or...

石头说钱

题目 Say you have an array for which the ith element is the price of a given stock on day...

石头说钱

题目 You are climbing a stair case. It takes n steps to reach to the top.Each time you ca...

石头说钱

题目 Given an array, rotate the array to the right by k steps, where k is non-negative. 将...

石头说钱

题目 You are given an n x n 2D matrix representing an image.Rotate the image by 90 degree...

石头说钱

题目 Given a matrix of m x n elements (m rows, n columns), return all elements of the mat...

石头说钱

题目 Given n non-negative integers representing an elevation map where the width of each ...

石头说钱

题目 Suppose an array sorted in ascending order is rotated at some pivot unknown to you b...

石头说钱

题目 Given an unsorted integer array, find the smallest missing positive integer. 找出数组中缺少...