{"push_id":1243959121,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"eaae1923320bfbe8bd27af4412b570ff17f1cf79","before":"1b3542fea00bffac494fc4491a85cb8f4aac2f10","commits":[{"sha":"eaae1923320bfbe8bd27af4412b570ff17f1cf79","author":{"name":"YupengGao","email":"9f2d06cbfec322fe19f4f28352943ae7dc85cdb9@outlook.com"},"message":"Update 349. Intersection of Two Arrays","distinct":true,"url":"https://api.github.com/repos/YupengGao/leetcode/commits/eaae1923320bfbe8bd27af4412b570ff17f1cf79"}]}
{"actor":{"display_login":"YupengGao"}}