{"push_id":2966602497,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"ad217572b11b1f26934454a4eb1206d5d74e6cce","before":"49097b47e329085f4eb04450b26c32efd3dd3f17","commits":[{"sha":"ad217572b11b1f26934454a4eb1206d5d74e6cce","author":{"name":"midiexiang","email":"b2bad22d54ed4198d99924a0988cb36a5aec689e@7lk.com"},"message":"32_n叉树的深度和缓存策略","distinct":true,"url":"https://api.github.com/repos/qsyPython/ArithmeticNice/commits/ad217572b11b1f26934454a4eb1206d5d74e6cce"}]}
{"actor":{"display_login":"qsyPython"}}