{"push_id":2561429477,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"f84eb5303eb68adec9201b8cbec057c481e07e73","before":"70dfdb269ac11a6f6bd5e0c5d65bf6c90cbf7e11","commits":[{"sha":"f84eb5303eb68adec9201b8cbec057c481e07e73","author":{"name":"huanglong0438","email":"d990ebabb479122edb0a9106f1b2ef69f1b113fb@qq.com"},"message":"37. DFS解数独问题","distinct":true,"url":"https://api.github.com/repos/huanglong0438/Leetcode/commits/f84eb5303eb68adec9201b8cbec057c481e07e73"}]}
{"actor":{"display_login":"huanglong0438"}}