{"push_id":926960679,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"352c16d8478ff5df9c475291d185c72f96824e59","before":"2a7995e63d01c7389800129138739125e6488106","commits":[{"sha":"352c16d8478ff5df9c475291d185c72f96824e59","author":{"email":"3ce790d98190c10bf94a31647052a9fb6efbda26@126.com","name":"GloomyMouse Xu"},"message":"Merge k Sorted Lists\n\nMerge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.","distinct":true,"url":"https://api.github.com/repos/gloomymouse/LeetCode/commits/352c16d8478ff5df9c475291d185c72f96824e59"}]}