{"push_id":1216844224,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"84732438a962e1cd0b660e13c74e4a8226a4f0b9","before":"4c86431c0e56ec4a438da1736830f883e701a999","commits":[{"sha":"84732438a962e1cd0b660e13c74e4a8226a4f0b9","author":{"name":"Fan Zhitao","email":"06f12644b2eefce2ae165456d7c570e21a37d587@gmail.com"},"message":"96. Unique Binary Search Trees.","distinct":true,"url":"https://api.github.com/repos/FanZhitao/LeetCode/commits/84732438a962e1cd0b660e13c74e4a8226a4f0b9"}]}
{"actor":{"display_login":"FanZhitao"}}