Introduction - If you have any usage issues, please Google them yourself
Given n points on a 2D plane, find the maximum number of points that lie on the same straight line analysis: first thing to note is that the input array may have duplicate points. Because two points determine a line, a very intuitive solution is to calculate every two points form a straight line, and then merge the same straight line, the final solution of this problem is to include the number of points on a straight line up to the point. We know that a straight line can be expressed by the slope and y-intercept of the two floating-point (x-axis perpendicular to the slope of the line is infinite, the intercept with the x-intercept), but also need to save the points on each line (to avoid duplication). It sounds very troublesome, but there is a simple way to achieve based on this idea: to a point O as the center, and the slope of the other points to calculate it, and if there are two points A, B and O points form the slope equal, then the ABO three points are collinear, if there are a p