题目描述链接:https://leetcode-cn.com/problems/robot-return-to-origin/
LeetCode 解题C++代码:
class Solution { public: int a[2];//记录位置 bool judgeCircle(string moves) { for(int i=0;i<moves.size();i++){ if(moves[i]=='R'){ a[1]++; } if(moves[i]=='L'){ a[1]--; } if(moves[i]=='U'){ a[0]--; } if(moves[i]=='D'){ a[0]++; } } if(a[0]==0&&a[1]==0){ return true; } return false; } };