{"push_id":1172579939,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"6d65c0cd5bf2bc9c5f5fdef09a4d9e60e348956d","before":"7f8c213fcd3954cf38b2777ea62591f8faa7ebca","commits":[{"sha":"6d65c0cd5bf2bc9c5f5fdef09a4d9e60e348956d","author":{"name":"shineyr","email":"8bb2d8ddd9b0452a1a7cdc0c5ee70779ba6c66fa@163.com"},"message":"7 二叉树的序列化和反序列化","distinct":true,"url":"https://api.github.com/repos/shineyr/LintCode/commits/6d65c0cd5bf2bc9c5f5fdef09a4d9e60e348956d"}]}
{"actor":{"display_login":"shineyr"}}