Veritas_des_Liberty

2018年12月10日

摘要： Remove the minimum number of invalid parentheses in order to make the input string valid. Return all possible results. Note: The input string may cont 阅读全文

posted @ 2018-12-10 21:58 Veritas_des_Liberty 阅读(213) 评论(0) 推荐(0)

199. Binary Tree Right Side View

摘要： Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom. Example 阅读全文

posted @ 2018-12-10 18:00 Veritas_des_Liberty 阅读(210) 评论(0) 推荐(0)

129. Sum Root to Leaf Numbers

摘要： Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number. An example is the root-to-leaf path 1->2->3 whic 阅读全文

posted @ 2018-12-10 17:15 Veritas_des_Liberty 阅读(204) 评论(0) 推荐(0)

124. Binary Tree Maximum Path Sum

摘要： Given a non-empty binary tree, find the maximum path sum. For this problem, a path is defined as any sequence of nodes from some starting node to any 阅读全文

posted @ 2018-12-10 12:05 Veritas_des_Liberty 阅读(199) 评论(0) 推荐(0)

114. Flatten Binary Tree to Linked List

摘要： Given a binary tree, flatten it to a linked list in-place. For example, given the following tree: The flattened tree should look like: Approach #1: C+ 阅读全文

posted @ 2018-12-10 10:11 Veritas_des_Liberty 阅读(170) 评论(0) 推荐(0)

2018年12月9日

113. Path Sum II

摘要： Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum. Note: A leaf is a node with no children. Exampl 阅读全文

posted @ 2018-12-09 21:13 Veritas_des_Liberty 阅读(210) 评论(0) 推荐(0)

111. 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 l 阅读全文

posted @ 2018-12-09 18:53 Veritas_des_Liberty 阅读(187) 评论(0) 推荐(0)

99. Recover Binary Search Tree

摘要： Two elements of a binary search tree (BST) are swapped by mistake. Recover the tree without changing its structure. Example 1: Input: [1,3,null,null,2 阅读全文

posted @ 2018-12-09 18:14 Veritas_des_Liberty 阅读(222) 评论(0) 推荐(0)

Weekly Contest 114

摘要： 955. Delete Columns to Make Sorted II We are given an array A of N lowercase letter strings, all of the same length. Now, we may choose any set of del 阅读全文

posted @ 2018-12-09 17:02 Veritas_des_Liberty 阅读(265) 评论(0) 推荐(0)

2018年12月8日

95. Unique Binary Search Trees II

摘要： Given an integer n, generate all structurally unique BST's (binary search trees) that store values 1 ... n. Example: Input: 3 Output: [ [1,null,3,2], 阅读全文

posted @ 2018-12-08 21:40 Veritas_des_Liberty 阅读(223) 评论(0) 推荐(0)

Veritas des Liberty

公告