{"push_id":3126635236,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"2b1dc6971d1beeba1c3c5c0aacee79d6281d7d37","before":"4d3e93e7864e352328cce42c698745c1d9f557ab","commits":[{"sha":"2b1dc6971d1beeba1c3c5c0aacee79d6281d7d37","author":{"name":"stanleyguo0207","email":"fc53060d8548f9a4b6bfed6674729f8489e17523@163.com"},"message":"[algorithm] N叉树的最大深度\n\nSigned-off-by: stanleyguo0207 <stanleyguo0207@163.com>","distinct":true,"url":"https://api.github.com/repos/stanleyguo0207/notes/commits/2b1dc6971d1beeba1c3c5c0aacee79d6281d7d37"}]}
{"actor":{"display_login":"stanleyguo0207"}}