{"push_id":3166275255,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"416182d450587f03c72bc03ea8224f1ea4fee092","before":"c35be2639e4bfc686c8734f5207bd7c581d9951b","commits":[{"sha":"416182d450587f03c72bc03ea8224f1ea4fee092","author":{"name":"hekun123","email":"3e175e6306c88405f716852f6e69bb7d7d32dd26@163.com"},"message":"【添加】：\n1、hdu1542\n   线段树求面积总和。维护线段区间的有效长度有难度。\n【删除】：\n删除测试用的无用代码。","distinct":true,"url":"https://api.github.com/repos/hekun123/LeetcodeSolver/commits/416182d450587f03c72bc03ea8224f1ea4fee092"}]}
{"actor":{"display_login":"hekun123"}}