{"push_id":675106058,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"0f9fd90e6e9f838f1b62bbcd1e4a3eaa5488d51b","before":"3106f5137a2aff87d2cb937580f5e72a8b1b45f0","commits":[{"sha":"0f9fd90e6e9f838f1b62bbcd1e4a3eaa5488d51b","author":{"email":"52c8dcd40a309e31b1a9ed206e0c4f70a30d9fa2@126.com","name":"Zhao Wei"},"message":"最长回文子串-Manacher\n\n1. 在oj上报re错误，不知道为何。\n2. Mnancher算法的原理比较tricky，就当扩展知识面了。","distinct":true,"url":"https://api.github.com/repos/pkuzw/LeetCode-Zhao-Wei-/commits/0f9fd90e6e9f838f1b62bbcd1e4a3eaa5488d51b"}]}