{"push_id":955088558,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"0ecc0e52c7c827955cb524948a89f8b97339c723","before":"bcf23b292b7c25e5c9cc490b5904c5c7aa93b568","commits":[{"sha":"0ecc0e52c7c827955cb524948a89f8b97339c723","author":{"email":"57bf02f2813975543aa96afa0c8875468b9f81ad@qq.com","name":"VioletLove"},"message":"判读无环链表是否相交，简单法","distinct":true,"url":"https://api.github.com/repos/VioletLove/algorithm/commits/0ecc0e52c7c827955cb524948a89f8b97339c723"}]}