[leetcode]657. Judge Route Circle

[leetcode]657. Judge Route Circle

---

Analysis

ummmm~—— [ummmm~]

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.
很简单的题，判断是否回到原点，所以向左走和向右走的次数要想等，并且向上走和向下走的次数也要相等。

Implement

class Solution {
public:
    bool judgeCircle(string moves) {
        int cnt_U = 0;
        int cnt_D = 0;
        int cnt_R = 0;
        int cnt_L = 0;
        for(auto move:moves){
            if(move == 'U')
                cnt_U++;
            if(move == 'D')
                cnt_D++;
            if(move == 'R')
                cnt_R++;
            if(move == 'L')
                cnt_L++;
        }
        if(cnt_U == cnt_D && cnt_R == cnt_L)
            return true;
        return false;
    }
};