穿点最多的直线LeetCode中等题

最新推荐文章于 2022-05-28 01:35:33 发布

xy21

最新推荐文章于 2022-05-28 01:35:33 发布

阅读量627

点赞数 1

分类专栏： Leetcode编程题刷题笔记C++ 文章标签： leetcode 算法数据结构 c++

本文链接：https://blog.csdn.net/weixin_61118018/article/details/122662893

版权

Leetcode编程题刷题笔记C++ 专栏收录该内容

54 篇文章 1 订阅

订阅专栏

已知一个点集vector<point>p和点集的大小n,点都在一个二维平面上且横坐标各不相同,找到一条穿过点数最多的直线，返回值为vector<double>，代表所求直线的斜率和截距。</double></point>

方法一：线性回归方程

/*
struct Point {
    int x;
    int y;
    Point() :
            x(0), y(0) {
    }
    Point(int xx, int yy) {
        x = xx;
        y = yy;
    }
};*/
class DenseLine {
public:
    vector<double> getLine(vector<Point> p, int n) {
        // write code here
        double xave = 0, yave = 0, up = 0, down = 0;
        for(int i = 0; i < n; i++){
            xave += p[i].x;
            yave += p[i].y;
        }
        xave /= n;
        yave /= n;
        for(int i = 0; i < n; i++){
            up += (p[i].x - xave) * (p[i].y - yave);
            down += (p[i].x - xave) * (p[i].x - xave);
        }
        double k = up / down;
        double b = yave - k*xave;
        return vector<double> ({k, b});
    }
};

方法二：暴力解法

/*
struct Point {
    int x;
    int y;
    Point() :
            x(0), y(0) {
    }
    Point(int xx, int yy) {
        x = xx;
        y = yy;
    }
};*/
class DenseLine {
public:
    vector<double> getLine(vector<Point> p, int n) {
        // write code here
        map<pair<double,double>, int> mp;
        for(int i=0; i<n; i++){
            for(int j=i+1; j<n; j++){
                ++mp[calLine(p[i], p[j])];
            }
        }
        auto index = mp.begin();
        for(auto it = mp.begin(); it != mp.end(); it++){
            if(it->second > index->second) index = it;
        }
        return vector<double> ({index->first.first, index->first.second});
    }
    pair<double,double> calLine(Point p1, Point p2){
        double k = (double)(p1.y - p2.y)/(p1.x - p2.x);
        double b = (double)p1.y - k*p1.x;
        return make_pair(k, b);
    }
};