<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[DeveloperKangK的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/DeveloperKangK</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; DeveloperKangK]]></copyright><item><title><![CDATA[leetcode 146. LRU Cache]]></title><link>https://blog.youkuaiyun.com/DeveloperKangK/article/details/87927870</link><guid>https://blog.youkuaiyun.com/DeveloperKangK/article/details/87927870</guid><author>DeveloperKangK</author><pubDate>Tue, 26 Feb 2019 01:19:39 +0800</pubDate><description><![CDATA[leetcode 146. LRU Cache
看了Discuss理解了,关键是:

用了一个doublely linkedlist 来记录order. 用了head, tail避免corner case里面npe.
用了HashMap记录key和相应node的位置.
用到的function和parameter比较多, 安全起见多用this关键字,防止collision.

class LRUCa...]]></description><category></category></item><item><title><![CDATA[leetcode 284. Peeking Iterator]]></title><link>https://blog.youkuaiyun.com/DeveloperKangK/article/details/87916402</link><guid>https://blog.youkuaiyun.com/DeveloperKangK/article/details/87916402</guid><author>DeveloperKangK</author><pubDate>Mon, 25 Feb 2019 14:26:54 +0800</pubDate><description><![CDATA[leetcode 284. Peeking Iterator
https://leetcode.com/problems/peeking-iterator/
看了Discuss理解了, 关键是:
在class里面 cache两个variable,

next用来store下一个Integer,这样每次peek都只用看next,不用move forward
noSuchElement用来store是...]]></description><category></category></item></channel></rss>