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 阅读(214) 评论(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 阅读(193) 评论(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 阅读(227) 评论(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 阅读(269) 评论(0) 推荐(0)