{"push_id":1333284836,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"7510113f8249e680c91a0fbc95381fef675c360b","before":"7a1ec33813d2b1f8bebc0b11237a22e5cd7b7873","commits":[{"sha":"7510113f8249e680c91a0fbc95381fef675c360b","author":{"name":"SHiL0NG","email":"e2f053b1c46af3650b3e1b8da599d2a7bc516fba@gmail.com"},"message":"BTree flatten solution recursive accept","distinct":true,"url":"https://api.github.com/repos/SHiL0NG/LeetCode/commits/7510113f8249e680c91a0fbc95381fef675c360b"}]}
{"actor":{"display_login":"SHiL0NG"}}