2019年1月2日
【leetcode】538. Convert BST to Greater Tree
摘要： 题目如下： Given a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is changed to the original key plus sum o 阅读全文
posted @ 2019-01-02 14:32 seyjs 阅读(154) 评论(0) 推荐(0) 编辑
【leetcode】388. Longest Absolute File Path
摘要： 题目如下： Suppose we abstract our file system by a string in the following manner: The string "dir\n\tsubdir1\n\tsubdir2\n\t\tfile.ext"represents: The dir 阅读全文
posted @ 2019-01-02 13:33 seyjs 阅读(239) 评论(0) 推荐(0) 编辑