{"push_id":871409165,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"a110d8793f4d95fd8ede139ba63d5f90c9204854","before":"c2b938fded0d9666c12b6cff3141617f1dfb6743","commits":[{"sha":"a110d8793f4d95fd8ede139ba63d5f90c9204854","author":{"email":"6f8d473e913d8f1b8bed9345c7475d49bd02154e@qq.com","name":"Ircc"},"message":"算法实现-最大连续子串和","distinct":true,"url":"https://api.github.com/repos/ircc/test-code-backup/commits/a110d8793f4d95fd8ede139ba63d5f90c9204854"}]}