{"push_id":1247626300,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"565e80f782fa3931e300f60aa202923e6aa02fc0","before":"af84359385ef727ed68ddd1405b07760632d0354","commits":[{"sha":"565e80f782fa3931e300f60aa202923e6aa02fc0","author":{"name":"lilelr","email":"ce1789ce533208249ff8b345edc5dd972cd84d7b@163.com"},"message":"138 Copy List with Random Pointer  classic ,make the minimus\nspace complexity\nA solution with constant space complexity O(1) and linear time complexity O(N)","distinct":true,"url":"https://api.github.com/repos/lilelr/LeecodeProblemSolutionByJava/commits/565e80f782fa3931e300f60aa202923e6aa02fc0"}]}
{"actor":{"display_login":"lilelr"}}