Using Python's built-in defaultdict we can easily define a tree data structure:
def tree(): return defaultdict(tree)That's it!
xuefeng Huang xuefeng-huang
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| # location ~/.tmux.conf | |
| #change prefix from C-b to C-a | |
| unbind C-b | |
| set -g prefix C-a | |
| bind C-a send-prefix | |
| #set mouse off/on | |
| set -g mouse on | |
| #256 colours |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| // Place your settings in this file to overwrite the default settings | |
| { | |
| "editor.cursorBlinking": "solid", | |
| //for terminal to have the correct PATH variable | |
| "terminal.integrated.shellArgs.osx": [ | |
| "-l" | |
| ], | |
| "editor.lineNumbers": "relative", | |
| "editor.renderIndentGuides": true, | |
| "editor.wordWrap": "on", |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| def pairs_range(limit1, limit2): | |
| for i1 in range(limit1): | |
| for i2 in range(limit2): | |
| yield i1, i2 | |
| for x, y in pairs_range(10, 20): | |
| if some_condition(x, y): | |
| break | |
| do_something(x, y) |
xuefeng-huang
/ gmail_downloader.py
Created
August 6, 2016 09:44
gmail download and save on disk encrypted
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #!/usr/bin/env python | |
| """ | |
| command line program to download gmail inbox messages between specified dates | |
| """ | |
| from __future__ import print_function | |
| import argparse | |
| import pprint | |
| import base64 |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| for x in xrange(100): | |
| print ('fizz'[x % 3 * 4:] + 'buzz'[x % 5 * 4:] or x) |
xuefeng-huang
/ tree.md
Created
April 20, 2016 05:49
— forked from hrldcpr/tree.md
one-line tree in python
xuefeng-huang
/ find_longest_palindrome.py
Created
April 18, 2016 10:29
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| def longest_palindrome(s): | |
| for i in range(len(s), 0, -1): | |
| for j in range(len(s)-i+1): | |
| sub = s[j:j+i] | |
| if sub == sub[::-1]: | |
| return i | |
| return 0 |
xuefeng-huang
/ find_outlier.py
Created
April 1, 2016 02:38
find the outlier(odd from even or vice versa) from group of integers
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| def find_outlier(integers): | |
| """return the outlier from integer list""" | |
| parity = [n % 2 for n in integers] | |
| return integers[parity.index(1)] if sum(parity) == 1 else integers[parity.index(0)] |