leetcode/closestPoint.cpp at master · Revtm/leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
#include<bits/stdc++.h>
using namespace std;

class comparepoint{
public:
    bool operator()(vector<int> a, vector<int> b){
        float aL = sqrt((pow(a[0], 2.0) + pow(a[1],2.0)));
        float bL = sqrt((pow(b[0], 2.0) + pow(b[1],2.0)));
        return (aL > bL);
    }
};

struct structcompares {
  bool operator()(vector<int> a, vector<int> b){
        float aL = sqrt((pow(a[0], 2.0) + pow(a[1],2.0)));
        float bL = sqrt((pow(b[0], 2.0) + pow(b[1],2.0)));
        return (aL > bL);
    }
} veccompare;

vector<vector<int>> kClosest0(vector<vector<int>>& points, int k) {
    priority_queue<vector<int>, vector<vector<int>>, comparepoint> closest;
    vector<vector<int>> closestVec;

    for(vector<int> point : points){
        closest.push(point);
    }

    for(int i = 0 ; i < k ; i++){
        closestVec.push_back(closest.top());
        closest.pop();
    }

    return closestVec;
}


vector<vector<int>> kClosest(vector<vector<int>>& points, int k) {
    make_heap(points.begin(), points.end(), veccompare);
    vector<vector<int>> closestVec;

    while(points.size() > k){
        points.pop_back();
    }

    return points;
}

int main(){
    vector<vector<int>> points = {{1,3},{-2,2}, {3,2}};
    vector<vector<int>> closest = kClosest(points, 2);

    for(vector<int> x : closest){
        cout << "[" << x[0] << "," << x[1] << "]";
    }
    return 0;
}