<p>Given an array of <code>points</code> where <code>points[i] = [x<sub>i</sub>, y<sub>i</sub>]</code> represents a point on the <strong>X-Y</strong> plane, return <em>the maximum number of points that lie on the same straight line</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/02/25/plane1.jpg" style="width: 300px; height: 294px;" />
<pre>
<strong>Input:</strong> points = [[1,1],[2,2],[3,3]]
<strong>Output:</strong> 3
</pre>

<p><strong class="example">Example 2:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/02/25/plane2.jpg" style="width: 300px; height: 294px;" />
<pre>
<strong>Input:</strong> points = [[1,1],[3,2],[5,3],[4,1],[2,3],[1,4]]
<strong>Output:</strong> 4
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= points.length &lt;= 300</code></li>
	<li><code>points[i].length == 2</code></li>
	<li><code>-10<sup>4</sup> &lt;= x<sub>i</sub>, y<sub>i</sub> &lt;= 10<sup>4</sup></code></li>
	<li>All the <code>points</code> are <strong>unique</strong>.</li>
</ul>

class Solution {
public:
    int maxPoints(vector<vector<int>>& points) {
      int max = 0;
      if(points.size() == 1) return 1;

      for(int i = 0; i < points.size()-1; i++)
      {
        vector<int> point_1 = points[i];
        unordered_map<double, int> record;
        for(int j = i+1; j < points.size(); j++)
        {
            vector<int> point_2 = points[j];
            double slope = caculate_slope(point_1, point_2);
            printf("slope:%lf\n", slope);
            printf("\n");
            record[slope]+=1;
            max = record[slope] > max? record[slope]: max;
        }
      }
      max++;
      return max;

        
    }

    double caculate_slope(vector<int> point_a, vector<int> point_b)
    {
        printf("point_1:%d\n", point_a[0]);
        printf("point_2:%d\n", point_b[0]);
        if(point_a[0] == point_b[0]) return INT_MIN;
        double  dvided =  (point_a[0] - point_b[0]);
        return (point_a[1] - point_b[1]) / dvided;
    }
};
26708