
我的私房菜
文章平均质量分 82
_王川
屌丝程序员
展开
-
学习笔记1:c++实现LRU算法
#include #include #include #include #include #include #include #include #include #include using namespace std;#define MAX 10000#define MOD 9991struct node{int key;int val;node *pre;node *next;node(i原创 2014-01-12 15:30:41 · 2244 阅读 · 0 评论 -
学习笔记2:c++位运算-异或运算
先看一道题: Single Number Given an array of integers, every element appears twice except for one. Find that single one. Note: Your algorithm should have a linear runtime complexity. Coul原创 2014-01-13 23:17:43 · 1069 阅读 · 0 评论 -
随笔记
个人笔记: 学习笔记1:c++实现LRU算法原创 2014-03-13 16:36:37 · 734 阅读 · 0 评论