{"push_id":1067833103,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"a643d9bf9ab1e68a34b55bc09696007829a84315","before":"6e2f393f45d1a5b86a7d427b6b651c62823a24e3","commits":[{"sha":"a643d9bf9ab1e68a34b55bc09696007829a84315","author":{"email":"4b2b9c25bb50ecb21388cf156ba6fb6cccbfa405@126.com","name":"paine1690"},"message":"116. Populating Next Right Pointers in Each Node\n\n空间要求没有满足 要再优化","distinct":true,"url":"https://api.github.com/repos/paine1690/LeetCode/commits/a643d9bf9ab1e68a34b55bc09696007829a84315"}]}