Eatswap
/
leetcode-daily
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

feat: simplify 211226

This commit is contained in:
Lam Haoyin 2021-12-26 15:07:36 +08:00
parent 2cbd4da504
commit e9790e25ab
No known key found for this signature in database
GPG Key ID: 8C089CB1A2B7544F
1 changed files with 3 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
2112/211226.cpp
View File

@ -1,16 +1,12 @@
#include <vector> #include <vector>
#include <algorithm> #include <algorithm>
struct EuclideanDistanceCompare {
bool operator()(const std::vector<int>& lhs, const std::vector<int>& rhs) const {
return lhs[0] * lhs[0] + lhs[1] * lhs[1] < rhs[0] * rhs[0] + rhs[1] * rhs[1];
}
};
class Solution { class Solution {
public: public:
static std::vector<std::vector<int>> kClosest(std::vector<std::vector<int>>& points, int k) { static std::vector<std::vector<int>> kClosest(std::vector<std::vector<int>>& points, int k) {
std::sort(points.begin(), points.end(), EuclideanDistanceCompare{}); std::sort(points.begin(), points.end(), [](const std::vector<int>& lhs, const std::vector<int>& rhs){
return lhs[0] * lhs[0] + lhs[1] * lhs[1] < rhs[0] * rhs[0] + rhs[1] * rhs[1];
});
return {points.begin(), points.begin() + k}; return {points.begin(), points.begin() + k};
} }
}; };