{"push_id":982639453,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"99c58fe1c271ee37793d78e82d0b7f1ff027113b","before":"ba853689353a8ccc28529f6ec403a5cb9977fbaf","commits":[{"sha":"99c58fe1c271ee37793d78e82d0b7f1ff027113b","author":{"email":"2b97043ea94938b79872c0bbf5238519d86a885a@qq.com","name":"Yin Wen"},"message":"从已排序链表中建立平衡的搜索二叉树","distinct":true,"url":"https://api.github.com/repos/YinWenAtBIT/LeetCode/commits/99c58fe1c271ee37793d78e82d0b7f1ff027113b"}]}