{"push_id":1350907386,"size":2,"distinct_size":2,"ref":"refs/heads/master","head":"d707ce36025ce03b503584649c835084c99c77e8","before":"db9779ab12e285a4a4ff2a6fa1ccd358c521d295","commits":[{"sha":"658c43272599bdaf0131b91b4c2fdd6030955243","author":{"name":"Joseph","email":"b9de0fd1c1bc9b673e91c1482017c63d632d2fa4@192.168.2.12"},"message":"96. Unique Binary Search Trees","distinct":true,"url":"https://api.github.com/repos/JosephChenEcho/LeetCode/commits/658c43272599bdaf0131b91b4c2fdd6030955243"},{"sha":"d707ce36025ce03b503584649c835084c99c77e8","author":{"name":"Joseph","email":"b9de0fd1c1bc9b673e91c1482017c63d632d2fa4@192.168.2.12"},"message":"100. Same Tree","distinct":true,"url":"https://api.github.com/repos/JosephChenEcho/LeetCode/commits/d707ce36025ce03b503584649c835084c99c77e8"}]}
{"actor":{"display_login":"JosephChenEcho"}}