add leetcode problem-cn part2

算法题（国内版）/problem (English)/交点(English) [intersection-lcci].html

@@ -0,0 +1,36 @@
+<p>Given two straight line segments (represented as a start point and an end point), compute the point of intersection, if any. If there&#39;s no intersection, return an empty array.</p>
+The absolute error should not exceed 10^-6. If there are more than one intersections, return the one with smallest X axis value. If there are more than one intersections that have same X axis value, return the one with smallest Y axis value.
+
+<p><strong>Example 1: </strong></p>
+
+<pre>
+<strong>Input: </strong>
+line1 = {0, 0}, {1, 0}
+line2 = {1, 1}, {0, -1}
+<strong>Output: </strong> {0.5, 0}
+</pre>
+
+<p><strong>Example 2: </strong></p>
+
+<pre>
+<strong>Input: </strong>
+line1 = {0, 0}, {3, 3}
+line2 = {1, 1}, {2, 2}
+<strong>Output: </strong> {1, 1}
+</pre>
+
+<p><strong>Example 3: </strong></p>
+
+<pre>
+<strong>Input: </strong>
+line1 = {0, 0}, {1, 1}
+line2 = {1, 0}, {2, 1}
+<strong>Output: </strong> {}  (no intersection)
+</pre>
+
+<p><strong>Note: </strong></p>
+
+<ul>
+	<li>The absolute value of coordinate value will not exceed 2^7.</li>
+	<li>All coordinates are valid 2D coordinates.</li>
+</ul>