{"push_id":1205068400,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"df13fd902916dae5b1426f653d08b540fc2f1a5d","before":"6ce444d755524ac745ae625c0d35a920ca4d2cd2","commits":[{"sha":"df13fd902916dae5b1426f653d08b540fc2f1a5d","author":{"name":"YizhouLuo","email":"d2807c53b4e976ec8a977f8b697db28987a8706a@qq.com"},"message":"from the source: https://discuss.leetcode.com/topic/16797/very-concise-o-log-min-m-n-iterative-solution-with-detailed-explanation","distinct":true,"url":"https://api.github.com/repos/ZhouGongZi/Algorithm-Practice/commits/df13fd902916dae5b1426f653d08b540fc2f1a5d"}]}
{"actor":{"display_login":"ZhouGongZi"}}