發(fā)簡信
IP屬地：廣西
-
merge sort 歸并排序
basic merg sort給兩個排好序的序列，將它們混合排序好 NlogN 利用遞歸實現(xiàn)merge sort： bottom up merge sort不用遞歸，從1開始...
-
insertion sort
從頭開始的指針i，保證其左側(cè)都是in order的，右側(cè)都是not yet seen的。i++，若此數(shù)比i小，則與i交換，若還比起左邊的小，則再與左邊的交換…… insert...
-
selection sort
從第一個開始，找到序列中最小的，和第一個交換；然后從第二個開始，找到最小的和第二個交換……O(N*N) selection sort 和input沒有關(guān)系，無論是完全亂序的還...
-
Stacks and Queues
stack：last in first out (LIFO)queue: first in fist out (FIFO) stack API linked-list sta...
-
Union-Find
Quick Find 數(shù)組的每個位置存相應的節(jié)點id，相連接的節(jié)點的位置存相同的id。判斷是否相連（connected）只需判斷兩位置的id是否相同。而將兩節(jié)點連接起來（un...
-
You Don't Know JS: Scope & Closures Chapter 5: Scope Closure
You Don't Know JS: Scope & Closures Chapter 5: Scope Closure We arrive at this point wi...
-
You Don't Know JS: Scope & Closures Chapter 4: Hoisting
You Don't Know JS: Scope & Closures Chapter 4: Hoisting By now, you should be fairly co...
-
You Don't Know JS: Scope & Closures Chapter 3: Function vs. Block Scope
You Don't Know JS: Scope & Closures Chapter 3: Function vs. Block Scope As we explored ...
-
You Don't Know JS: Scope & Closures Chapter 2: Lexical Scope
You Don't Know JS: Scope & Closures Chapter 2: Lexical Scope In Chapter 1, we defined "...
-
You Don't Know JS: Scope & Closures Chapter 1: What is Scope?
You Don't Know JS: Scope & Closures Chapter 1: What is Scope? One of the most fundament...
-
You Don't Know JS建議的繼承模式相對于傳統(tǒng)的“class”型的繼承： you don't know js建議的是object鏈接到object的模式： (objects-linked-to-other-ob...
-
jQuery性能優(yōu)化
使用合適的選擇器 不同的選擇器有性能差異，以下為性能從好到壞： $("#id")使用id來定位無疑是最佳提高性能的方式，因為直接調(diào)用js的document.getElemen...
-
234. Palindrome Linked List
判斷是否為回文的主要思想是取一半然后依次比較判斷。重點是找到中點，利用了fast比slow指針移動速度2倍的特點，當fast到達末尾，slow就到達了中間附近（根據(jù)長度的奇偶...
-
206. Reverse Linked List
用迭代（iteratively）和遞歸（recursively）來完成。其實鏈表反轉(zhuǎn)的基本思想就是：讓當前節(jié)點的next指向其前驅(qū)結(jié)點。
