LeetCode 657. Judge Route Circle

题目链接：https://leetcode.com/problems/judge-route-circle/description/

题目解析：只要记下横竖坐标即可，最终如果移动到原点，那么横竖坐标均为0。

代码如下：4ms Accepted

class Solution {
public:
    bool judgeCircle(string moves) {
        int x = 0, y = 0;
        for (auto c : moves){
            if (c == 'R')
                x++;
            if (c == 'L')
                x--;
            if (c == 'U')
                y++;
            if (c == 'D')
                y--;
        }
        return x == 0 && y == 0; 
    }
};

static int x = []() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(NULL);
    return 0;
}();