userkang

/**
 * Definition for singly-linked list.
 * function ListNode(val) {
 *     this.val = val;
 *     this.next = null;
 * }
 */
/**
 * @param {ListNode} l1
 * @param {ListNode} l2

userkang

/**
 * @param {string} s
 * @return {string}
 */
var longestPalindrome = function(s) {	
  if (!s) return '';
  var longest = s[0];
  var expandAroundCenter = function (left, right) {
    while (left >= 0 && right < s.length && s[left] === s[right]) {
      left--;

userkang

function curry(fn) {
  var args = []
  var len = fn.length
  
  var result = function(n) {
    args.push(n)
    len--
    if (len > 0) {
      return result
    } else {

userkang

function fn(n) {
  if (n < 1) {
    return 0
  }
  
  if (n === 1) {
    return 1
  }
  
  if (n === 2) {

userkang

/**
 * @param {string} s
 * @return {string}
 */
var longestPalindrome = function(s) {
    var len = s.length
    var maxLen = 0
    var res = ''
    

userkang

function quickSort(arr) {
    // 交换元素
    function swap(arr, a, b) {
        var temp = arr[a];
        arr[a] = arr[b];
        arr[b] = temp;
    }

    function partition(arr, left, right) {
        var pivot = arr[left];

userkang

// ES5版本
function shuffle(a) {
  var i,j,t
  for(i = a.length; i; i--) {
    j = Math.floor(Math.random() * i)
    t = a[i-1]
    a[i-1] = a[j]
    a[j] = t
  }
  return a

userkang

function add() {
	var sum = 0;
	
	function add() {
		for (var i=0; i<arguments.length; i++) {
			sum += Number(arguments[i]);
		}
		return add;
	}
	add.valueOf = function valueOf(){

userkang

function throttle(func, wait, options) {
  var timeout, context, args
  var previous = 0
  if (!options) options = {}

  var later = function() {
    previous = options.leading === false ? 0 : Date.now()
    timeout = null
    func.apply(context, args)

userkang

function debounce(func, wait, immediate) {
  var timeout

  return function() {
    var context = this
    var args = arguments

    if(timeout) clearTimeout(timeout)

    if (immediate) {