存量题库数据更新

leetcode/problem/get-the-maximum-score.html

@@ -1,4 +1,4 @@
-<p>You are given two <strong>sorted</strong> arrays of distinct integers <code>nums1</code> and <code>nums2.</code></p>
+<p>You are given two <strong>sorted</strong> arrays of distinct integers <code>nums1</code> and <code>nums2</code>.</p>
 
 <p>A <strong>valid<strong><em> </em></strong>path</strong> is defined as follows:</p>
 
@@ -8,12 +8,12 @@
 	<li>If you are reading any value that is present in <code>nums1</code> and <code>nums2</code> you are allowed to change your path to the other array. (Only one repeated value is considered in the valid path).</li>
 </ul>
 
-<p>The <strong>score</strong> is defined as the sum of uniques values in a valid path.</p>
+<p>The <strong>score</strong> is defined as the sum of unique values in a valid path.</p>
 
 <p>Return <em>the maximum score you can obtain of all possible <strong>valid paths</strong></em>. Since the answer may be too large, return it modulo <code>10<sup>9</sup> + 7</code>.</p>
 
 <p>&nbsp;</p>
-<p><strong>Example 1:</strong></p>
+<p><strong class="example">Example 1:</strong></p>
 <img alt="" src="https://assets.leetcode.com/uploads/2020/07/16/sample_1_1893.png" style="width: 500px; height: 151px;" />
 <pre>
 <strong>Input:</strong> nums1 = [2,4,5,8,10], nums2 = [4,6,8,9]
@@ -24,7 +24,7 @@
 The maximum is obtained with the path in green <strong>[2,4,6,8,10]</strong>.
 </pre>
 
-<p><strong>Example 2:</strong></p>
+<p><strong class="example">Example 2:</strong></p>
 
 <pre>
 <strong>Input:</strong> nums1 = [1,3,5,7,9], nums2 = [3,5,100]
@@ -32,7 +32,7 @@ The maximum is obtained with the path in green <strong>[2,4,6,8,10]</strong>.
 <strong>Explanation:</strong> Maximum sum is obtained with the path <strong>[1,3,5,100]</strong>.
 </pre>
 
-<p><strong>Example 3:</strong></p>
+<p><strong class="example">Example 3:</strong></p>
 
 <pre>
 <strong>Input:</strong> nums1 = [1,2,3,4,5], nums2 = [6,7,8,9,10]