add leetcode problem-cn part2

算法题（国内版）/problem (English)/稀疏相似度(English) [sparse-similarity-lcci].html

@@ -0,0 +1,28 @@
+<p>The similarity of two documents (each with distinct words) is defined to be the size of the intersection divided by the size of the union. For example, if the documents consist of integers, the similarity of {1, 5, 3} and {1, 7, 2, 3} is 0.4, because the intersection has size 2 and the union has size 5.&nbsp;We have a long list of documents (with distinct values and each with an associated ID) where the similarity is believed to be &quot;sparse&quot;. That is, any two arbitrarily selected documents are very likely to have similarity 0. Design an algorithm that returns a list of pairs of document IDs and the associated similarity.</p>
+
+<p>Input is a 2D array&nbsp;<code>docs</code>, where&nbsp;<code>docs[i]</code>&nbsp;is the document with id&nbsp;<code>i</code>. Return an array of strings, where each string represents a pair of documents with similarity greater than 0. The string should be formatted as&nbsp; <code>{id1},{id2}: {similarity}</code>, where <code>id1</code>&nbsp;is the smaller id in the two documents, and <code>similarity</code> is the similarity rounded to four decimal places. You can return the array in any order.</p>
+
+<p><strong>Example:</strong></p>
+
+<pre>
+<strong>Input:</strong> 
+<code>[
+&nbsp; [14, 15, 100, 9, 3],
+&nbsp; [32, 1, 9, 3, 5],
+&nbsp; [15, 29, 2, 6, 8, 7],
+&nbsp; [7, 10]
+]</code>
+<strong>Output:</strong>
+[
+&nbsp; &quot;0,1: 0.2500&quot;,
+&nbsp; &quot;0,2: 0.1000&quot;,
+&nbsp; &quot;2,3: 0.1429&quot;
+]</pre>
+
+<p><strong>Note: </strong></p>
+
+<ul>
+	<li><code>docs.length &lt;= 500</code></li>
+	<li><code>docs[i].length &lt;= 500</code></li>
+	<li>The number of document pairs with similarity greater than 0 will not exceed 1000.</li>
+</ul>