coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 23:41:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

存量题库数据更新

Browse Source
This commit is contained in:
小墨
2023-12-09 18:42:21 +08:00
parent a788808cd7
commit c198538f10
10843 changed files with 288489 additions and 248355 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/problem/robot-bounded-in-circle.html
View File

@@ -20,7 +20,7 @@
<p>Return <code>true</code> if and only if there exists a circle in the plane such that the robot never leaves the circle.</p>
<p>&nbsp;</p>
<p><strong>Example 1:</strong></p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong> instructions = &quot;GGLLGG&quot;
@@ -36,7 +36,7 @@ Repeating the instructions, the robot goes into the cycle: (0, 0) --&gt; (0, 1)
Based on that, we return true.
</pre>
<p><strong>Example 2:</strong></p>
<p><strong class="example">Example 2:</strong></p>
<pre>
<strong>Input:</strong> instructions = &quot;GG&quot;
@@ -48,7 +48,7 @@ Repeating the instructions, keeps advancing in the north direction and does not
Based on that, we return false.
</pre>
<p><strong>Example 3:</strong></p>
<p><strong class="example">Example 3:</strong></p>
<pre>
<strong>Input:</strong> instructions = &quot;GL&quot;