摘要：
参考链接：https://www.joinquant.com/post/2227?f=study&m=math；一只兔子帮你理解KNN https://www.joinquant.com/post/2627?f=study&m=math；kd 树算法之思路篇 https://www.joinquan 阅读全文
摘要：
Given a non-empty array of integers, return the third maximum number in this array. If it does not exist, return the maximum number. The time complexi 阅读全文