{"push_id":1140914869,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"3d2643efa036b4377990d87a130b327a4eb305ee","before":"befa4d55827edb157f42ecf233ca099d6ee819ae","commits":[{"sha":"3d2643efa036b4377990d87a130b327a4eb305ee","author":{"name":"JimmyXie123","email":"e4039668b37a47ba82eb3891a750772aecada660@gmail.com"},"message":"[111. Minimum Depth of Binary Tree][Time Limit Exceeded]committed by LeetCode Extension","distinct":true,"url":"https://api.github.com/repos/JimmyXie123/leetcode_extension/commits/3d2643efa036b4377990d87a130b327a4eb305ee"}]}
{"actor":{"display_login":"JimmyXie123"}}