update

leetcode-cn/originData/maximum-length-of-repeated-subarray.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>给两个整数数组&nbsp;<code>nums1</code>&nbsp;和&nbsp;<code>nums2</code>&nbsp;，返回 <em>两个数组中 <strong>公共的</strong> 、长度最长的子数组的长度&nbsp;</em>。</p>\n\n<p>&nbsp;</p>\n\n<p><strong>示例 1：</strong></p>\n\n<pre>\n<strong>输入：</strong>nums1 = [1,2,3,2,1], nums2 = [3,2,1,4,7]\n<strong>输出：</strong>3\n<strong>解释：</strong>长度最长的公共子数组是 [3,2,1] 。\n</pre>\n\n<p><strong>示例 2：</strong></p>\n\n<pre>\n<strong>输入：</strong>nums1 = [0,0,0,0,0], nums2 = [0,0,0,0,0]\n<strong>输出：</strong>5\n</pre>\n\n<p>&nbsp;</p>\n\n<p><strong>提示：</strong></p>\n\n<ul>\n\t<li><code>1 &lt;= nums1.length, nums2.length &lt;= 1000</code></li>\n\t<li><code>0 &lt;= nums1[i], nums2[i] &lt;= 100</code></li>\n</ul>\n",
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 655,
+            "likes": 676,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"Minimum Size Subarray Sum\", \"titleSlug\": \"minimum-size-subarray-sum\", \"difficulty\": \"Medium\", \"translatedTitle\": \"\\u957f\\u5ea6\\u6700\\u5c0f\\u7684\\u5b50\\u6570\\u7ec4\"}]",
@@ -167,7 +167,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"110.3K\", \"totalSubmission\": \"194.9K\", \"totalAcceptedRaw\": 110329, \"totalSubmissionRaw\": 194884, \"acRate\": \"56.6%\"}",
+            "stats": "{\"totalAccepted\": \"117.7K\", \"totalSubmission\": \"207.7K\", \"totalAcceptedRaw\": 117700, \"totalSubmissionRaw\": 207714, \"acRate\": \"56.7%\"}",
             "hints": [
                 "Use dynamic programming.  dp[i][j] will be the answer for inputs A[i:], B[j:]."
             ],