2019年6月23日
40.Unique Binary Search Trees（不同的二叉搜索树）
摘要： Given *n*, how many structurally unique **BST's** (binary search trees) that store values 1 ... *n*? 阅读全文
posted @ 2019-06-23 23:34 yjxyy 阅读(107) 评论(0) 推荐(0)
39.Binary Tree Inorder Traversal（二叉树中序遍历）
摘要： Given a binary tree, return the *inorder* traversal of its nodes' values. 阅读全文
posted @ 2019-06-23 23:29 yjxyy 阅读(129) 评论(0) 推荐(0)
38.Subsets（子集和）
摘要： Given a set of **distinct** integers, *nums*, return all possible subsets (the power set). 阅读全文
posted @ 2019-06-23 23:24 yjxyy 阅读(144) 评论(0) 推荐(0)
37.Sort Colors（颜色排序）
摘要： Given an array with *n* objects colored red, white or blue, sort them **in-place** so that objects of the same color are adjacent, with the colors in the order red, white and blue. 阅读全文
posted @ 2019-06-23 23:15 yjxyy 阅读(302) 评论(0) 推荐(0)
36.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. 阅读全文
posted @ 2019-06-23 23:09 yjxyy 阅读(138) 评论(0) 推荐(0)