{"push_id":1336570629,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"1183698be669ac419533ce28038730947fd10067","before":"c43b2dd15232dd19d43dd5c796e762dc2290f7b1","commits":[{"sha":"1183698be669ac419533ce28038730947fd10067","author":{"name":"danwang","email":"a81c92971a6dd55e88ee444fec7b7fbb6ef80422@freewheel.tv"},"message":"optimized O(n) time and O(1) space","distinct":true,"url":"https://api.github.com/repos/empiredan/leetcode/commits/1183698be669ac419533ce28038730947fd10067"}]}
{"actor":{"display_login":"empiredan"}}