update

leetcode-cn/originData/route-between-nodes-lcci.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>节点间通路。给定有向图，设计一个算法，找出两个节点之间是否存在一条路径。</p>\n\n<p><strong>示例1:</strong></p>\n\n<pre><strong> 输入</strong>：n = 3, graph = [[0, 1], [0, 2], [1, 2], [1, 2]], start = 0, target = 2\n<strong> 输出</strong>：true\n</pre>\n\n<p><strong>示例2:</strong></p>\n\n<pre><strong> 输入</strong>：n = 5, graph = [[0, 1], [0, 2], [0, 4], [0, 4], [0, 1], [1, 3], [1, 4], [1, 3], [2, 3], [3, 4]], start = 0, target = 4\n<strong> 输出</strong> true\n</pre>\n\n<p><strong>提示：</strong></p>\n\n<ol>\n\t<li>节点数量n在[0, 1e5]范围内。</li>\n\t<li>节点编号大于等于 0 小于 n。</li>\n\t<li>图中可能存在自环和平行边。</li>\n</ol>\n",
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 51,
+            "likes": 57,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[]",
@@ -149,7 +149,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"22.1K\", \"totalSubmission\": \"41.4K\", \"totalAcceptedRaw\": 22125, \"totalSubmissionRaw\": 41410, \"acRate\": \"53.4%\"}",
+            "stats": "{\"totalAccepted\": \"23K\", \"totalSubmission\": \"43.1K\", \"totalAcceptedRaw\": 23008, \"totalSubmissionRaw\": 43065, \"acRate\": \"53.4%\"}",
             "hints": [
                 "有两个众所周知的算法可以做到这一点。其利弊是什么？"
             ],