Max Points on a Line LEETCODE

Max Points on a Line

Total Accepted: 289 Total Submissions: 3644

Given n points on a 2D plane, find the maximum number of points that lie on the same straight line.




/**
 * Definition for a point.
 * struct Point {
 *     int x;
 *     int y;
 *     Point() : x(0), y(0) {}
 *     Point(int a, int b) : x(a), y(b) {}
 * };
 */
 
 
class Solution {
public:
    int maxPoints(vector<Point> &points) {
        // IMPORTANT: Please reset any member data you declared, as
        // the same Solution instance will be reused for each test case.
        
        map<float, int> kmap;
        map<float, int>::iterator it;
        int size = points.size();
        int total = 0;
        int sum_cloumn = 0;
        
        if(size<=2)
            return size;
        
        for(int i=0;i<size;i++)
        {
            sum_cloumn = 0;
            int add=1;
            kmap.clear();
            for(int j=0;j<size;j++)
            {
                if(j==i)
                    continue;
                    
                if(points[i].x==points[j].x && points[i].y==points[j].y)   
                {
                    add++;
                    continue ;
                }
                    
                    
                float k = 0;
                
                if(points[i].x!=points[j].x)
                {
                    k = (float)(points[j].y-points[i].y)/(points[j].x-points[i].x);
                    if(kmap.find(k)!=kmap.end())
                    {
                        kmap[k]++;
                    }
                    else
                    {
                        kmap[k] = 1;
                    }
                }else{
                    sum_cloumn++;
                }
            }
            for(it=kmap.begin(); it!=kmap.end();it++)
            {
                if(it->second > sum_cloumn)
                    sum_cloumn = it->second;
            }
            sum_cloumn += add;
            
            if(sum_cloumn > total)
                total = sum_cloumn;
        }
       
        return total;
       
    }
   
};


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 3
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论 3
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值