LRU CacheDesign and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations:getandset.get(key)- Get...
分类：
系统相关 时间：
2014-11-19 20:29:44
阅读次数：
289
Given an integer n, generate a square matrix filled with elements from 1 to n2 in spiral order.
For example,
Given n = 3,
You should return the following matrix:
[
[ 1, 2, 3 ],
[ 8, 9, 4 ],
[...
分类：
其他好文 时间：
2014-11-19 16:05:08
阅读次数：
143
Given a linked list, swap every two adjacent nodes and return its head.For example,Given1->2->3->4, you should return the list as2->1->4->3.Your algor...
分类：
其他好文 时间：
2014-11-19 15:41:29
阅读次数：
165
Follow up for "Remove Duplicates":What if duplicates are allowed at mosttwice?For example,Given sorted array A =[1,1,1,2,2,3],Your function should ret...
分类：
其他好文 时间：
2014-11-19 14:01:24
阅读次数：
134
一道LeetCode OJ上的题目，要求设计一个LRU（Least Recently Used）算法，题目描述如下：Design and implement a data structure for Least Recently Used (LRU) cache. It should support...
分类：
编程语言 时间：
2014-11-19 13:51:25
阅读次数：
222
Given a linked list, swap every two adjacent nodes and return its head.For example,Given1->2->3->4, you should return the list as2->1->4->3.Your algor...
分类：
其他好文 时间：
2014-11-19 00:15:33
阅读次数：
284
Given a linked list and a valuex, partition it such that all nodes less thanxcome before nodes greater than or equal tox.You should preserve the origi...
分类：
其他好文 时间：
2014-11-18 23:45:02
阅读次数：
222
Given an array of integers, every element appearsthreetimes except for one. Find that single one.Note:Your algorithm should have a linear runtime comp...
分类：
其他好文 时间：
2014-11-18 23:22:33
阅读次数：
206
Given an array of integers, every element appearstwiceexcept for one. Find that single one.Note:Your algorithm should have a linear runtime complexity...
分类：
其他好文 时间：
2014-11-18 23:06:47
阅读次数：
188
http://www.oschina.net/news/57107/30-css-selector-you-should-remeber大 概大家读知道`id`,`class`以及`descendant`选择器，并且整体都在使用它们，那么你正在错误拥有更大级别的灵活性的选择方式。这篇 文章里面提到的...
分类：
Web程序 时间：
2014-11-18 23:03:19
阅读次数：
477
