{"push_id":3786790672,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"6a601cbced28958e563fce925a9a824e6aee5362","before":"e9dc817f6575eac66664f40dab01e6fe7e0a0799","commits":[{"sha":"6a601cbced28958e563fce925a9a824e6aee5362","author":{"name":"ylem27149","email":"ba13bf8eb19f4e20969cadf51d50d4fdf82cbe56@users.noreply.github.com"},"message":"100\n\n修改了nearest(),不再用最小距离作为参数。\r\n *  因为它是原始类型，当向上回溯去搜索另一边子节点时，使用的最小距离实际上还会是没有进行任何搜索时候的旧值，并没有被已经完成搜索的子树的最小距离值取代。","distinct":true,"url":"https://api.github.com/repos/ylem27149/Coursera-Algorithms-/commits/6a601cbced28958e563fce925a9a824e6aee5362"}]}
{"actor":{"display_login":"ylem27149"}}