摘要:
Given a binary search tree, write a functionkthSmallestto find thekth smallest element in it.Note:You may assume k is always valid, 1 ≤ k ≤ BST's tota... 阅读全文
摘要:
Write an algorithm to determine if a number is "happy". A happy number is a number defined by the following process: Starting with any positive intege 阅读全文
摘要:
Source:http://tech.pro/tutorial/2011/functional-javascript-part-4-function-curryingCurrying is the process of transforming a function that takes multi... 阅读全文
摘要:
Source: https://github.com/getify/You-Dont-Know-JS/blob/master/up%20&%20going/ch2.md#equalityFalse Values in JS""(empty string)0,-0,NaN(invalidnumber)... 阅读全文