{"push_id":765528404,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"66f3be5fbbafe7291e8f38f55ad0cbc8ba0ac822","before":"ff171ddcf0d0cf6fe40aa0f19b92acdbe0181809","commits":[{"sha":"66f3be5fbbafe7291e8f38f55ad0cbc8ba0ac822","author":{"email":"f9f020812fd83b8de8865df1074e9f780b8c9967@qq.com","name":"Horst Xu"},"message":"Create leetcode0106ConstructBinaryTreeFromInorderAndPostorderTraversal.java","distinct":true,"url":"https://api.github.com/repos/jinqiangshou/OneAlgorithmExerciseEveryday/commits/66f3be5fbbafe7291e8f38f55ad0cbc8ba0ac822"}]}