mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-10-21 13:06:47 +08:00
update
This commit is contained in:
@@ -12,7 +12,7 @@
|
||||
"translatedContent": "<p>在一个由 <code>'L'</code> , <code>'R'</code> 和 <code>'X'</code> 三个字符组成的字符串(例如<code>"RXXLRXRXL"</code>)中进行移动操作。一次移动操作指用一个<code>"LX"</code>替换一个<code>"XL"</code>,或者用一个<code>"XR"</code>替换一个<code>"RX"</code>。现给定起始字符串<code>start</code>和结束字符串<code>end</code>,请编写代码,当且仅当存在一系列移动操作使得<code>start</code>可以转换成<code>end</code>时, 返回<code>True</code>。</p>\n\n<p> </p>\n\n<p><strong>示例 :</strong></p>\n\n<pre><strong>输入:</strong> start = "RXXLRXRXL", end = "XRLXXRRLX"\n<strong>输出:</strong> True\n<strong>解释:</strong>\n我们可以通过以下几步将start转换成end:\nRXXLRXRXL ->\nXRXLRXRXL ->\nXRLXRXRXL ->\nXRLXXRRXL ->\nXRLXXRRLX\n</pre>\n\n<p> </p>\n\n<p><strong>提示:</strong></p>\n\n<ul>\n\t<li><code>1 <= len(start) = len(end) <= 10000</code>。</li>\n\t<li><code>start</code>和<code>end</code>中的字符串仅限于<code>'L'</code>, <code>'R'</code>和<code>'X'</code>。</li>\n</ul>\n",
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Medium",
|
||||
"likes": 112,
|
||||
"likes": 113,
|
||||
"dislikes": 0,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[]",
|
||||
@@ -143,7 +143,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"6.3K\", \"totalSubmission\": \"19.4K\", \"totalAcceptedRaw\": 6283, \"totalSubmissionRaw\": 19350, \"acRate\": \"32.5%\"}",
|
||||
"stats": "{\"totalAccepted\": \"6.3K\", \"totalSubmission\": \"19.4K\", \"totalAcceptedRaw\": 6295, \"totalSubmissionRaw\": 19379, \"acRate\": \"32.5%\"}",
|
||||
"hints": [
|
||||
"Think of the L and R's as people on a horizontal line, where X is a space. The people can't cross each other, and also you can't go from XRX to RXX."
|
||||
],
|
||||
|
Reference in New Issue
Block a user