92hackers

# 1: sort a list
data = [{'cid': 32, 'haha': 'nice'},
 {'cid': 31, 'haha': 'nice'},
 {'cid': 30, 'haha': 'nice'},
 {'cid': 29, 'haha': 'nice'},
 {'cid': 28, 'haha': 'nice'},
 {'cid': 27, 'haha': 'nice'},
 {'cid': 26, 'haha': 'nice'},
 {'cid': 25, 'haha': 'nice'},
 {'cid': 24, 'haha': 'nice'},

92hackers

This text now lives at https://github.com/MarcDiethelm/contributing/blob/master/README.md. I turned it into a Github repo so you can, you know, contribute to it by making pull requests.

---

Contributing

If you want to contribute to a project and make it better, your help is very welcome. Contributing is also a great way to learn more about social coding on Github, new technologies and and their ecosystems and how to make constructive, helpful bug reports, feature requests and the noblest of all contributions: a good, clean pull request.

92hackers

/**
 * 在一个无序数组中找出最长的连续增长片段，步长为 1
 *
 * 该算法时间复杂度为： O(n)
 * 空间复杂度为常数
 *
 * @author 陈元
 * @email cy476571@gmail.com
 */

92hackers

set -g default-command 'reattach-to-user-namespace $SHELL --login'
set-option -g default-shell $SHELL
set -g default-terminal 'screen-256color'
setw -g automatic-rename off
setw -g mode-keys vi
setw -g mode-mouse on
setw -g mouse-select-pane on
setw -g mouse-utf8 on

unbind C-b