update

leetcode-cn/originData/maximum-length-of-pair-chain.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>给出 <code>n</code> 个数对。 在每一个数对中，第一个数字总是比第二个数字小。</p>\n\n<p>现在，我们定义一种跟随关系，当且仅当 <code>b < c</code> 时，数对<code>(c, d)</code> 才可以跟在 <code>(a, b)</code> 后面。我们用这种形式来构造一个数对链。</p>\n\n<p>给定一个数对集合，找出能够形成的最长数对链的长度。你不需要用到所有的数对，你可以以任何顺序选择其中的一些数对来构造。</p>\n\n<p> </p>\n\n<p><strong>示例：</strong></p>\n\n<pre>\n<strong>输入：</strong>[[1,2], [2,3], [3,4]]\n<strong>输出：</strong>2\n<strong>解释：</strong>最长的数对链是 [1,2] -> [3,4]\n</pre>\n\n<p> </p>\n\n<p><strong>提示：</strong></p>\n\n<ul>\n\t<li>给出数对的个数在 <code>[1, 1000]</code> 范围内。</li>\n</ul>\n",
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 213,
+            "likes": 214,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"Longest Increasing Subsequence\", \"titleSlug\": \"longest-increasing-subsequence\", \"difficulty\": \"Medium\", \"translatedTitle\": \"\\u6700\\u957f\\u9012\\u589e\\u5b50\\u5e8f\\u5217\"}, {\"title\": \"Increasing Subsequences\", \"titleSlug\": \"increasing-subsequences\", \"difficulty\": \"Medium\", \"translatedTitle\": \"\\u9012\\u589e\\u5b50\\u5e8f\\u5217\"}]",
@@ -155,7 +155,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"26.8K\", \"totalSubmission\": \"46.2K\", \"totalAcceptedRaw\": 26844, \"totalSubmissionRaw\": 46234, \"acRate\": \"58.1%\"}",
+            "stats": "{\"totalAccepted\": \"26.9K\", \"totalSubmission\": \"46.4K\", \"totalAcceptedRaw\": 26930, \"totalSubmissionRaw\": 46391, \"acRate\": \"58.1%\"}",
             "hints": [],
             "solution": null,
             "status": null,