搜索(DFS||BFS)
文章平均质量分 81
别哔哔好伐
安静的coder
展开
-
leetcode-64-Minimum Path Sum
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 o原创 2015-07-08 19:06:46 · 611 阅读 · 0 评论 -
leetcode-111-Minimum Depth of Binary Tree
Minimum Depth of Binary Tree Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf原创 2015-07-23 22:04:57 · 508 阅读 · 0 评论 -
leetcode-104-Maximum Depth of Binary Tree
Maximum Depth of Binary Tree Given 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 nod原创 2015-06-20 13:10:25 · 485 阅读 · 0 评论 -
leetcode-102-Binary Tree Level Order Traversal
Binary Tree Level Order Traversal Given 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,#,原创 2015-09-22 20:16:08 · 351 阅读 · 0 评论