| | | | |

2019年11月16日

108. Convert Sorted Array to Binary Search Tree

摘要： Given an array where elements are sorted in ascending order, convert it to a height balanced BST. For this problem, a height-balanced binary tree is d 阅读全文

posted @ 2019-11-16 21:01 lychnis 阅读(101) 评论(0) 推荐(0)

146. LRU Cache

摘要： Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and put. get(key) - Get the 阅读全文

posted @ 2019-11-16 20:53 lychnis 阅读(124) 评论(0) 推荐(0)

2019年11月16日

公告