{"push_id":2180779591,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"81d5ce8b11efd30973df9a076b4f4c78014f9cc1","before":"e3a325f6cc092ef1675f6953a0ec1a471bbeff88","commits":[{"sha":"81d5ce8b11efd30973df9a076b4f4c78014f9cc1","author":{"name":"bighuang624","email":"afc2bce40488a0bb5452bf5aa311667caecfe48a@qq.com"},"message":":sparkles:add 671.Second_Minimum_Node_In_a_Binary_Tree","distinct":true,"url":"https://api.github.com/repos/bighuang624/LeetCode-everyday/commits/81d5ce8b11efd30973df9a076b4f4c78014f9cc1"}]}
{"actor":{"display_login":"bighuang624"}}