leetcode
大狐猫
这个作者很懒,什么都没留下…
展开
-
O(1)时间编程实现LFU算法
比起LRU算法,LFU算法就是多了一个优先级,LRU是最近最少使用淘汰,LFU是在使用次数最少的前提下淘汰最早的那个页面。为此跟上次一样,用一个 unordered_map mkey,跟一个双向链表存储节点,不同的是我们需要加一个unordered_map mcount, mount【i】存储的是所有访问次数为i的最后一个节点。接下来就简单了,只要某个节点被访问,就令它的次数num加1,从原来的...原创 2018-08-20 21:58:55 · 1711 阅读 · 0 评论 -
leetcode: 834. Sum of Distances in Tree O(N)时间复杂度
An undirected, connected tree with N nodes labelled 0...N-1 and N-1 edges are given.The ith edge connects nodes edges[i][0] and edges[i][1] together.Return a list ans, where ans[i] is the sum of t...原创 2018-07-09 20:53:49 · 980 阅读 · 0 评论 -
leetcode: 827. Making A Large Island
In a 2D grid of 0s and 1s, we change at most one 0 to a 1.After, what is the size of the largest island? (An island is a 4-directionally connected group of 1s).Example 1:Input: [[1, 0], [0, 1]]Output...原创 2018-07-09 21:03:35 · 268 阅读 · 0 评论