liancheng

" Loads default settings when startup {{{

source $VIMRUNTIME/vimrc_example.vim

if filereadable($HOME . "/.vimpath")
    source $HOME/.vimpath
endif

call pathogen#infect()

liancheng

#!/bin/bash
# License: Public Domain.
# Author:  Joseph Wecker, 2012
#
# -- DEPRICATED --
# This gist is slow and is missing .bashrc_once
# Use the one in the repo instead! https://github.com/josephwecker/bashrc_dispatch
# (Thanks gioele)
#
# Are you tired of trying to remember what .bashrc does vs .bash_profile vs .profile?

liancheng

require 'cgi'
require 'digest/md5'
require 'net/https'
require 'uri'

module Jekyll
  class GistTag < Liquid::Tag
    def initialize(tag_name, text, token)
      super
      @text           = text

liancheng

#include <limits>

namespace std {

template<>
struct numeric_limits<mpz_class> {
public:
    static const bool is_specialized = true;

    static mpz_class min() throw() {

liancheng

(import (sample))

(hello-world)

liancheng

Decode Ways
  https://github.com/liancheng/leetcode/blob/master/solutions/decode-ways/dp.hpp

Partition List
  https://github.com/liancheng/leetcode/blob/master/solutions/partition-list/solution.hpp

Flatten Binary Tree to Linked List
  https://github.com/liancheng/leetcode/blob/master/solutions/flatten-binary-tree-to-linked-list/solution.hpp

Binary Tree Inorder Traversal

liancheng

• Next Permutation

  STL风格版本 https://gitcafe.com/liancheng/leetcode/blob/master/solutions/next-permutation/solution.hpp

  利用reverse_iterator简化边界判断，可处理重复元素。参见：生成全排列、下一个排列、第k个排列的。

• Unique Binary Search Trees

  一维DP版本 https://gitcafe.com/liancheng/leetcode/blob/master/solutions/unique-binary-search-trees/dp.hpp

liancheng

string reverseSentence (string const& s)
{
    string t (s.rbegin (), s.rend ());

    for (auto p = begin (t), q = begin (t); p != end (t); ) {
        p = find_if (p, end (t), [] (char c) { return c != ' '; });
        q = find (p, end (t), ' ');
        reverse (p, q);
        p = q;
    }

liancheng

import scala.actors._
import Actor._

def sleepSort(xs : List[Int]) : List[Int] = {
   def sorter(aggregator : Actor, n : Int) = actor {
      reactWithin(n * 1000) {
        case TIMEOUT => {
           aggregator ! n
           exit
        }

liancheng

#!/bin/bash

mkdir -p data

for i in `seq $1`; do
    file=data/$i

    for j in `seq $2`; do
        echo ${RANDOM} >> $file
    done