{"push_id":1253054232,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"a04a0099e455b3c0c3b4616a1ebc185ccb4f9781","before":"2e4dc978a0efffa2b6e03e8d4a5196b14d57d0e9","commits":[{"sha":"a04a0099e455b3c0c3b4616a1ebc185ccb4f9781","author":{"name":"Di Wang","email":"fbe0e4924ef9aeba4f924dc114909a5b8928cdac@users.noreply.github.com"},"message":"[368. Largest Divisible Subset][]committed by Di","distinct":true,"url":"https://api.github.com/repos/gxwangdi/Leetcode/commits/a04a0099e455b3c0c3b4616a1ebc185ccb4f9781"}]}
{"actor":{"display_login":"gxwangdi"}}