fatttcat

2019年1月10日

摘要： Given a non-empty array of integers, every element appears three times except for one, which appears exactly once. Find that single one. Note: Your al 阅读全文

posted @ 2019-01-10 14:39 fatttcat 阅读(100) 评论(0) 推荐(0) 编辑

314. Binary Tree Vertical Order Traversal - Medium

摘要： Given a binary tree, return the vertical order traversal of its nodes' values. (ie, from top to bottom, column by column). If two nodes are in the sam 阅读全文

posted @ 2019-01-10 08:51 fatttcat 阅读(147) 评论(0) 推荐(0) 编辑

2019年1月9日

392. Is Subsequence - Medium

摘要： Given a string s and a string t, check if s is subsequence of t. You may assume that there is only lower case English letters in both sand t. t is pot 阅读全文

posted @ 2019-01-09 17:41 fatttcat 阅读(145) 评论(0) 推荐(0) 编辑

222. Count Complete Tree Nodes - Medium

摘要： Given a complete binary tree, count the number of nodes. Note: Definition of a complete binary tree from Wikipedia:In a complete binary tree every lev 阅读全文

posted @ 2019-01-09 05:49 fatttcat 阅读(97) 评论(0) 推荐(0) 编辑

2019年1月7日

Get Keys In Binary Search Tree In Given Range - Easy

摘要： Get the list of keys in a given binary search tree in a given range[min, max] in ascending order, both min and max are inclusive. Examples 5 / \ 3 8 / 阅读全文

posted @ 2019-01-07 17:26 fatttcat 阅读(201) 评论(0) 推荐(0) 编辑

145. Binary Tree Postorder Traversal - Hard

摘要： Given a binary tree, return the postorder traversal of its nodes' values. Example: Input: [1,null,2,3] 1 \ 2 / 3 Output: [3,2,1] Follow up: Recursive 阅读全文

posted @ 2019-01-07 15:02 fatttcat 阅读(111) 评论(0) 推荐(0) 编辑

144. Binary Tree Preorder Traversal - Medium

摘要： Given a binary tree, return the preorder traversal of its nodes' values. Example: Follow up: Recursive solution is trivial, could you do it iterativel 阅读全文

posted @ 2019-01-07 14:11 fatttcat 阅读(141) 评论(0) 推荐(0) 编辑

230. Kth Smallest Element in a BST - Medium

摘要： Given a binary search tree, write a function kthSmallest to find the kth smallest element in it. Note: You may assume k is always valid, 1 ≤ k ≤ BST's 阅读全文

posted @ 2019-01-07 07:52 fatttcat 阅读(122) 评论(0) 推荐(0) 编辑

475. Heaters - Easy

摘要： Winter is coming! Your first job during the contest is to design a standard heater with fixed warm radius to warm all the houses. Now, you are given p 阅读全文

posted @ 2019-01-07 04:53 fatttcat 阅读(178) 评论(0) 推荐(0) 编辑

2019年1月6日

69. Sqrt(x) - Easy

摘要： Implement int sqrt(int x). Compute and return the square root of x, where x is guaranteed to be a non-negative integer. Since the return type is an in 阅读全文

posted @ 2019-01-06 17:27 fatttcat 阅读(101) 评论(0) 推荐(0) 编辑

公告