{"push_id":1479859270,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"92bec6f63573468085294919d34b68c66527c3cd","before":"adaf7fbc18a2f1f89c48870b2eab9bb584559032","commits":[{"sha":"92bec6f63573468085294919d34b68c66527c3cd","author":{"name":"Yaokai","email":"8d18ed459a7364e90b3873ed284ba57a3aecd1d8@case.edu"},"message":"Create 111. Minimum Depth of Binary Tree","distinct":true,"url":"https://api.github.com/repos/YaokaiYang-assaultmaster/LeetCode/commits/92bec6f63573468085294919d34b68c66527c3cd"}]}
{"actor":{"display_login":"YaokaiYang-assaultmaster"}}