发简信
IP属地：甘肃
-
merge sort 归并排序
basic merg sort给两个排好序的序列，将它们混合排序好 NlogN 利用递归实现merge sort： bottom up merge sort不用递归，从1开始...
-
insertion sort
从头开始的指针i，保证其左侧都是in order的，右侧都是not yet seen的。i++，若此数比i小，则与i交换，若还比起左边的小，则再与左边的交换…… insert...
-
selection sort
从第一个开始，找到序列中最小的，和第一个交换；然后从第二个开始，找到最小的和第二个交换……O(N*N) selection sort 和input没有关系，无论是完全乱序的还...
-
Stacks and Queues
stack：last in first out (LIFO)queue: first in fist out (FIFO) stack API linked-list sta...
-
Union-Find
Quick Find 数组的每个位置存相应的节点id，相连接的节点的位置存相同的id。判断是否相连（connected）只需判断两位置的id是否相同。而将两节点连接起来（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建议的继承模式相对于传统的“class”型的继承： you don't know js建议的是object链接到object的模式： (objects-linked-to-other-ob...
-
jQuery性能优化
使用合适的选择器 不同的选择器有性能差异，以下为性能从好到坏： $("#id")使用id来定位无疑是最佳提高性能的方式，因为直接调用js的document.getElemen...
-
234. Palindrome Linked List
判断是否为回文的主要思想是取一半然后依次比较判断。重点是找到中点，利用了fast比slow指针移动速度2倍的特点，当fast到达末尾，slow就到达了中间附近（根据长度的奇偶...
