{"push_id":2685423948,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"59a748aed169b14c53c0e2722f3863735a052ce0","before":"033c318a1396d235361ead51aacdb25fb677bccb","commits":[{"sha":"59a748aed169b14c53c0e2722f3863735a052ce0","author":{"name":"Neo0one","email":"a17caff59d568bcf4d20dd2f6133150de34b1197@vip.qq.com"},"message":"Create 5. Longest Palindromic Substring\n\nGiven a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.\r\n\r\nExample 1:\r\n\r\nInput: \"babad\"\r\nOutput: \"bab\"\r\nNote: \"aba\" is also a valid answer.\r\nExample 2:\r\n\r\nInput: \"cbbd\"\r\nOutput: \"bb\"","distinct":true,"url":"https://api.github.com/repos/Neo0one/Leetcode/commits/59a748aed169b14c53c0e2722f3863735a052ce0"}]}
{"actor":{"display_login":"Neo0one"}}