發(fā)簡信
IP屬地：重慶
-
-
-
Memcache-網(wǎng)絡(luò)線程模型-源碼分析介紹 memcache 網(wǎng)絡(luò)模型是典型的單進程多線程模型，采用libevent處理網(wǎng)絡(luò)請求，主進程負責(zé)將新來的連接分配給work線程，work線程負責(zé)處理連接，有點類似與負載...
-
專業(yè)打雜，寫代碼~~~
-
WEB請求處理二：Nginx請求反向代理上一篇《WEB請求處理一：瀏覽器請求發(fā)起處理》，我們講述了瀏覽器端請求發(fā)起過程，通過DNS域名解析服務(wù)器IP，并建立TCP連接，發(fā)送HTTP請求。本文將講述請求到達反向代理服...
-
打蛇打七寸，架構(gòu)悟認知，亦知海行舟，方悠然自得。
-
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...
