{"push_id":1403606155,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"734b42382712426c385870fa48659fb96e5caba5","before":"8d777754dc706821b357272bca77f5f977e13ef0","commits":[{"sha":"734b42382712426c385870fa48659fb96e5caba5","author":{"name":"ly","email":"477a6b29ec51756a858770c8a2419fcbf145d625@qq.com"},"message":"从下至上层序遍历二叉树中的节点，每一层节点集是一个list，返回二叉树的节点集List<List<Integer>>","distinct":true,"url":"https://api.github.com/repos/xiaoqimuyouxi/LeetCode/commits/734b42382712426c385870fa48659fb96e5caba5"}]}
{"actor":{"display_login":"xiaoqimuyouxi"}}