发简信
IP属地：台湾
-
-
-
Memcache-网络线程模型-源码分析介绍 memcache 网络模型是典型的单进程多线程模型，采用libevent处理网络请求，主进程负责将新来的连接分配给work线程，work线程负责处理连接，有点类似与负载...
-
专业打杂，写代码~~~
-
WEB请求处理二：Nginx请求反向代理上一篇《WEB请求处理一：浏览器请求发起处理》，我们讲述了浏览器端请求发起过程，通过DNS域名解析服务器IP，并建立TCP连接，发送HTTP请求。本文将讲述请求到达反向代理服...
-
打蛇打七寸，架构悟认知，亦知海行舟，方悠然自得。
-
web development basics
Web development Interpolation: whenever you need to communicate properties(variables, o...
-
ubuntu freeze
If it locks up completely, you can REISUB it, which is a safer alternative to just cold...
-
378 Kth Smallest Element in a Sorted Matrix
378 Kth Smallest Element in a Sorted Matrix Given a n x n matrix where each of the rows...
-
A trick to solve most "substring" problem
I will first give the solution then show you the magic template. The code of solving th...
-
Bit Manipulation
Wiki Bit manipulation is the act of algorithmically manipulating bits or other pieces o...
-
DP unique BST trees
The problem can be solved in a dynamic programming way. I’ll explain the intuition and ...
-
Longest Substring with At Least K Repeating Characters
First, we consider the situation that only one kind of char satisfies the condition, wh...
-
Design compressed string iterator
Design and implement a data structure for a compressed string iterator. It should suppo...
-
int[] to Integer[]
There is no shortcut for converting from int[] to List as Arrays.asList does not deal ...
-
Iterative way to solve preorder/inorder/postorder traverse of tree
Here I summarize the iterative implementation for preorder, inorder, and postorder trav...
-
BST vs min Heap
https://stackoverflow.com/questions/6147242/heap-vs-binary-search-tree-bst/29548834#295...
