{"push_id":3030495669,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"85b8db12d93a6ce72d1cdaf49d1ac2bcdb6d1d10","before":"abe325a1db4868e4dceb0daf7a00bf0b2a2e7834","commits":[{"sha":"85b8db12d93a6ce72d1cdaf49d1ac2bcdb6d1d10","author":{"name":"Einsler Lee","email":"ae1c9fc9a731331a98b9b04ffc16dd7109a9aa96@163.com"},"message":"Q97,动态规划问题，值得复习。","distinct":true,"url":"https://api.github.com/repos/Geass-LL/LeetCode/commits/85b8db12d93a6ce72d1cdaf49d1ac2bcdb6d1d10"}]}
{"actor":{"display_login":"Geass-LL"}}