LeetCode
Mr.Young
这个作者很懒,什么都没留下…
展开
-
64. Minimum Path Sum
Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.Note: You can only move either down or right at an...原创 2019-05-21 17:51:48 · 81 阅读 · 0 评论 -
Unique Paths
A robot is located at the top-left corner of a m x n grid (marked ‘Start’ in the diagram below).The robot can only move either down or right at any point in time. The robot is trying to reach the bot...原创 2019-05-21 17:53:07 · 210 阅读 · 0 评论 -
二叉树深度
Maximum Depth of Binary TreeGiven a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.Note: A l...原创 2019-05-28 10:21:01 · 114 阅读 · 0 评论 -
验证有效二叉搜索树
Validate Binary Search TreeGiven a binary tree, determine if it is a valid binary search tree (BST).Assume a BST is defined as follows:The left subtree of a node contains only nodes with keys less ...原创 2019-05-28 15:32:44 · 412 阅读 · 1 评论 -
二叉树层次遍历
Binary Tree Level Order TraversalGiven a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level).For example:Given binary tree [3,9,20,null,null...原创 2019-05-28 17:35:06 · 117 阅读 · 0 评论