Judge Route Circle(leetcode)

Judge Route Circle

---

题目

leetcode题目

Initially, there is a Robot at position (0, 0). Given a sequence of its moves, judge if this robot makes a circle, which means it moves back to the original place.
The move sequence is represented by a string. And each move is represent by a character. The valid robot moves are R (Right), L (Left), U (Up) and D (down).
The output should be true or false representing whether the robot makes a circle.
Example 1:

Input: "UD"
Output: true

Example 2:

Input: "LL"
Output: false

题目就是让我们判断input的字符串中U和D的数量是否一致以及L和R的数量是否一致。

---

解决

class Solution {
public:
    bool judgeCircle(string moves) {
        int ud = 0; // 判断UD的数量
        int lr = 0; // 判断LR的数量
        int len = moves.length();
        for (int i = 0; i < len; i++) {
            if (moves[i] == 'U') {
                ud++;
            } else if (moves[i] == 'D') {
                ud--;
            } else if (moves[i] == 'L') {
                lr++;
            } else if (moves[i] == 'R') {
                lr--;
            }
        }
        if (ud == 0 && lr == 0) {
            return true;
        }
        return false;
    }
};