update: 添加问题“657.机器人能否返回原点”的代码和题解 (#1484)

657: AC.cpp (#1483) - AC,100.00%,40.47% + word(en)

Signed-off-by: LetMeFly666 <Tisfy@qq.com>

Author: LetMeFly666

.commitmsg

@@ -0,0 +1 @@
+657: AC.cpp (#1483) - AC,100.00%,40.47% + word(en)

Codes/0657-robot-return-to-origin.cpp

@@ -0,0 +1,39 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2026-04-05 13:03:58
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2026-04-05 13:26:08
+ */
+#ifdef _DEBUG
+#include "_[1,2]toVector.h"
+#endif
+
+class Solution {
+public:
+    bool judgeCircle(string moves) {
+        int x = 0, y = 0;
+        for (char c : moves) {
+            switch (c) {
+            case 'U':
+                y++;
+                break;
+
+            case 'D':
+                y--;
+                break;
+
+            case 'L':
+                x--;
+                break;
+
+            case 'R':
+                x++;
+                break;
+            
+            default:
+                break;
+            }
+        }
+        return !x && !y;
+    }
+};

README.md

@@ -380,6 +380,7 @@
 |0646.最长数对链|中等|<a href="https://leetcode.cn/problems/maximum-length-of-pair-chain/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2022/09/03/LeetCode%200646.%E6%9C%80%E9%95%BF%E6%95%B0%E5%AF%B9%E9%93%BE/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/126682589" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/maximum-length-of-pair-chain/solution/letmefly-646zui-chang-shu-dui-lian-by-ti-bia2/" target="_blank">LeetCode题解</a>|
 |0654.最大二叉树|中等|<a href="https://leetcode.cn/problems/maximum-binary-tree/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2022/08/20/LeetCode%200654.%E6%9C%80%E5%A4%A7%E4%BA%8C%E5%8F%89%E6%A0%91/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/126443463" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/maximum-binary-tree/solution/letmefly-shi-pin-yan-shi-654zui-da-er-ch-2fcl/" target="_blank">LeetCode题解</a>|
 |0655.输出二叉树|中等|<a href="https://leetcode.cn/problems/print-binary-tree/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2022/08/22/LeetCode%200655.%E8%BE%93%E5%87%BA%E4%BA%8C%E5%8F%89%E6%A0%91/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/126461060" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/print-binary-tree/solution/letmefly-655shu-chu-er-cha-shu-by-tisfy-5xj2/" target="_blank">LeetCode题解</a>|
+|0657.机器人能否返回原点|简单|<a href="https://leetcode.cn/problems/robot-return-to-origin/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2026/04/05/LeetCode%200657.%E6%9C%BA%E5%99%A8%E4%BA%BA%E8%83%BD%E5%90%A6%E8%BF%94%E5%9B%9E%E5%8E%9F%E7%82%B9/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/159855671" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/robot-return-to-origin/solutions/3945044/letmefly-657ji-qi-ren-neng-fou-fan-hui-y-2gss/" target="_blank">LeetCode题解</a>|
 |0661.图片平滑器|简单|<a href="https://leetcode.cn/problems/image-smoother/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/11/18/LeetCode%200661.%E5%9B%BE%E7%89%87%E5%B9%B3%E6%BB%91%E5%99%A8/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/143867615" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/image-smoother/solutions/2992934/letmefly-661tu-pian-ping-hua-qi-mo-ni-by-g8s7/" target="_blank">LeetCode题解</a>|
 |0662.二叉树最大宽度|中等|<a href="https://leetcode.cn/problems/maximum-width-of-binary-tree/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2022/08/27/LeetCode%200662.%E4%BA%8C%E5%8F%89%E6%A0%91%E6%9C%80%E5%A4%A7%E5%AE%BD%E5%BA%A6/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/126558271" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/maximum-width-of-binary-tree/solution/letmefly-662er-cha-shu-zui-da-kuan-du-by-yny2/" target="_blank">LeetCode题解</a>|
 |0667.优美的排列II|中等|<a href="https://leetcode.cn/problems/beautiful-arrangement-ii/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2022/09/08/LeetCode%200667.%E4%BC%98%E7%BE%8E%E7%9A%84%E6%8E%92%E5%88%97II/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/126759880" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/beautiful-arrangement-ii/solution/letmefly-667you-mei-de-pai-lie-ii-by-tis-2dzp/" target="_blank">LeetCode题解</a>|

Solutions/LeetCode 0657.机器人能否返回原点.md

@@ -0,0 +1,102 @@
+---
+title: 657.机器人能否返回原点：模拟
+date: 2026-04-05 13:27:28
+tags: [题解, LeetCode, 简单, 字符串, 模拟]
+categories: [题解, LeetCode]
+---
+
+# 【LetMeFly】657.机器人能否返回原点：模拟
+
+力扣题目链接：[https://leetcode.cn/problems/robot-return-to-origin/](https://leetcode.cn/problems/robot-return-to-origin/)
+
+<p>在二维平面上，有一个机器人从原点 <code>(0, 0)</code> 开始。给出它的移动顺序，判断这个机器人在完成移动后是否在<strong>&nbsp;<code>(0, 0)</code> 处结束</strong>。</p>
+
+<p>移动顺序由字符串&nbsp;<code>moves</code>&nbsp;表示。字符 <code>move[i]</code> 表示其第 <code>i</code> 次移动。机器人的有效动作有&nbsp;<code>R</code>（右），<code>L</code>（左），<code>U</code>（上）和 <code>D</code>（下）。</p>
+
+<p>如果机器人在完成所有动作后返回原点，则返回 <code>true</code>。否则，返回 <code>false</code>。</p>
+
+<p><strong>注意：</strong>机器人“面朝”的方向无关紧要。 <code>“R”</code> 将始终使机器人向右移动一次，<code>“L”</code> 将始终向左移动等。此外，假设每次移动机器人的移动幅度相同。</p>
+
+<p>&nbsp;</p>
+
+<p><strong>示例 1:</strong></p>
+
+<pre>
+<strong>输入:</strong> moves = "UD"
+<strong>输出:</strong> true
+<strong>解释：</strong>机器人向上移动一次，然后向下移动一次。所有动作都具有相同的幅度，因此它最终回到它开始的原点。因此，我们返回 true。</pre>
+
+<p><strong>示例 2:</strong></p>
+
+<pre>
+<strong>输入:</strong> moves = "LL"
+<strong>输出:</strong> false
+<strong>解释：</strong>机器人向左移动两次。它最终位于原点的左侧，距原点有两次 “移动” 的距离。我们返回 false，因为它在移动结束时没有返回原点。</pre>
+
+<p>&nbsp;</p>
+
+<p><strong>提示:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= moves.length &lt;= 2 * 10<sup>4</sup></code></li>
+	<li><code>moves</code>&nbsp;只包含字符&nbsp;<code>'U'</code>,&nbsp;<code>'D'</code>,&nbsp;<code>'L'</code>&nbsp;和&nbsp;<code>'R'</code></li>
+</ul>
+
+
+    
+## 解题方法：模拟
+
+假设机器人处在x轴正方向水平向右y轴正方向水平向上的坐标系的原点：
+
++ 每次`U`: `y++`
++ 每次`L`: `x--`
++ 每次`R`: `x++`
++ 每次`D`: `y--`
+
+最终看机器人是否处在`(0, 0)`就好了。
+
++ 时间复杂度$O(len(moves))$
++ 空间复杂度$O(1)$
+
+### AC代码
+
+#### C++
+
+```cpp
+/*
+ * @LastEditTime: 2026-04-05 13:26:08
+ */
+class Solution {
+public:
+    bool judgeCircle(string moves) {
+        int x = 0, y = 0;
+        for (char c : moves) {
+            switch (c) {
+            case 'U':
+                y++;
+                break;
+
+            case 'D':
+                y--;
+                break;
+
+            case 'L':
+                x--;
+                break;
+
+            case 'R':
+                x++;
+                break;
+            
+            default:
+                break;
+            }
+        }
+        return !x && !y;
+    }
+};
+```
+
+> 同步发文于[CSDN](https://letmefly.blog.csdn.net/article/details/159855671)和我的[个人博客](https://blog.letmefly.xyz/)，原创不易，转载经作者同意后请附上[原文链接](https://blog.letmefly.xyz/2026/04/05/LeetCode%200657.%E6%9C%BA%E5%99%A8%E4%BA%BA%E8%83%BD%E5%90%A6%E8%BF%94%E5%9B%9E%E5%8E%9F%E7%82%B9/)哦~
+>
+> 千篇源码题解[已开源](https://github.com/LetMeFly666/LeetCode)

Solutions/Other-English-LearningNotes-SomeWords.md

@@ -643,7 +643,7 @@ categories: [自用]
 |odour|n. 气味，意味，迹象，名声|
 |ramble|n. 漫步，散步，杂乱无章的长篇大论<br/>v. 漫谈，闲聊，漫步，蔓生|
 |<font color="#28bea0" title="二次复习">nausea</font>|n. 恶心，反胃，作呕|
-|celery|n. 芹菜，(调味用)|
+|celery|n. 芹菜，(调味用)香芹粉|
 |<font color="#28bea0" title="二次复习">jug</font>|n. (有柄有嘴的)壶/罐，一壶/罐(的量)|
 |zealous|adj. 热情的，热烈的，充满激情的|
 |regime|n. 组织方法，管理体制，政权，政体|

todo

@@ -1,5 +1,6 @@
 # newSolution.py go自动4space2tab
 # 源码转md时自动tab24space
+# remove last empty line
 
 # 记录iphone快捷指令 自动化 当到达某位置时触发