{"push_id":1424709834,"size":1,"distinct_size":1,"ref":"refs/heads/DP","head":"66d497dbe02484a8bb76ed999188dee11c8eadc1","before":"21243da1b381158442dff6ca1cd03a2ad270c6fe","commits":[{"sha":"66d497dbe02484a8bb76ed999188dee11c8eadc1","author":{"name":"Yi Gu","email":"673e7581059ad6672eef94e7d91613227433f4b9@gmail.com"},"message":"[DP] add a solution to Minimum Path Sum","distinct":true,"url":"https://api.github.com/repos/soapyigu/LeetCode_Swift/commits/66d497dbe02484a8bb76ed999188dee11c8eadc1"}]}
{"actor":{"display_login":"soapyigu"}}