{"push_id":1202450524,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"1ee107c0b4221bba748c57408f96b36242377e01","before":"d4592dbd7fdfb9aa2e9704feb9d5d2477901ec86","commits":[{"sha":"1ee107c0b4221bba748c57408f96b36242377e01","author":{"name":"arsenejiang","email":"25745fd6cb0247e11bcb32583c6893d37cc23b30@outlook.com"},"message":"[111. Minimum Depth of Binary Tree][]","distinct":true,"url":"https://api.github.com/repos/arsenejiang/leetcode/commits/1ee107c0b4221bba748c57408f96b36242377e01"}]}
{"actor":{"display_login":"arsenejiang"}}