轻风舞动

2018年3月7日

[LeetCode] 208. Implement Trie (Prefix Tree) 实现字典树(前缀树)

摘要： Implement a trie with insert, search, and startsWith methods. Example: Note: You may assume that all inputs are consist of lowercase letters a-z. All 阅读全文

posted @ 2018-03-07 10:18 轻风舞动阅读(626) 评论(0) 推荐(0) 编辑

[LeetCode] 102. Binary Tree Level Order Traversal 二叉树层序遍历

摘要： Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level). For example:Given binary tree {3 阅读全文

posted @ 2018-03-07 09:01 轻风舞动阅读(992) 评论(0) 推荐(0) 编辑

2018年3月6日

[LeetCode] 215. Kth Largest Element in an Array 数组中第k大的元素

摘要： Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element. Example 阅读全文

posted @ 2018-03-06 16:01 轻风舞动阅读(2735) 评论(0) 推荐(0) 编辑

[LeetCode] 23. Merge k Sorted Lists 合并k个有序链表

摘要： Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity. Example: 与21. Merge Two Sorted Lists的拓展，这道题要合并k个有序链阅读全文

posted @ 2018-03-06 10:29 轻风舞动阅读(1379) 评论(0) 推荐(0) 编辑

[LeetCode] 146. LRU Cache 近期最少使用缓存

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

posted @ 2018-03-06 08:36 轻风舞动阅读(671) 评论(0) 推荐(0) 编辑

[LeetCode] 381. Insert Delete GetRandom O(1) - Duplicates allowed 插入删除和获得随机数O(1)时间 - 允许重复

摘要： Design a data structure that supports all following operations in average O(1) time. Note: Duplicate elements are allowed. Example: 380. Insert Delete 阅读全文

posted @ 2018-03-06 07:10 轻风舞动阅读(355) 评论(0) 推荐(0) 编辑

[LeetCode] 380. Insert Delete GetRandom O(1) 插入删除获得随机数O(1)时间

摘要： Design a data structure that supports all following operations in average O(1) time. Example: 设计一个数据结构在O(1)时间内完成：insert(val)，remove(val)，getRandom() 由阅读全文

posted @ 2018-03-06 07:03 轻风舞动阅读(927) 评论(0) 推荐(0) 编辑

[LeetCode] 57. Insert Interval 插入区间

摘要： Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary). You may assume that the intervals were initia 阅读全文

posted @ 2018-03-06 04:42 轻风舞动阅读(488) 评论(0) 推荐(0) 编辑

[LeetCode] 56. Merge Intervals 合并区间

摘要： Given a collection of intervals, merge all overlapping intervals. Example 1: Example 2: 给定一个有重叠的区间集合，合并所有重叠的区间。先对区间以第一个元素进行排序，定义一个变量result记录合并后的区间。然后迭阅读全文

posted @ 2018-03-06 04:39 轻风舞动阅读(608) 评论(0) 推荐(0) 编辑

[LeetCode] 155. Min Stack 最小栈

摘要： Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. push(x) -- Push element x onto stack. pop() -- Remov 阅读全文

posted @ 2018-03-06 02:47 轻风舞动阅读(2430) 评论(0) 推荐(0) 编辑

公告