{"push_id":1083261042,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"dd17ede2f8f12b596b4a6fd791e20bfbd05a9a5c","before":"6e958bde354e0f684ebdc1a269e74956257c4e90","commits":[{"sha":"dd17ede2f8f12b596b4a6fd791e20bfbd05a9a5c","author":{"email":"6cd35da56a61eb83c27fc85782f109c45499d01e@gmail.com","name":"Ryo"},"message":"Leetcode 111. Minimum Depth of Binary Tree","distinct":true,"url":"https://api.github.com/repos/RyoDream/Leetcode_Java/commits/dd17ede2f8f12b596b4a6fd791e20bfbd05a9a5c"}]}