【Lintcode】1104. Judge Route Circle

题目地址：

https://www.lintcode.com/problem/judge-route-circle/description

在平面直角坐标系里，以方向给一个出发点在$(0,0)$的机器人发指令。问它的路径是否构成一个环。其实就是判断是否回到了原点。代码如下：

public class Solution {
    /**
     * @param moves: a sequence of its moves
     * @return: if this robot makes a circle
     */
    public boolean judgeCircle(String moves) {
        // Write your code here
        int U = 0, R = 0;
        for (int i = 0; i < moves.length(); i++) {
            char m = moves.charAt(i);
            if (m == 'U') {
                U++;
            } else if (m == 'D') {
                U--;
            } else if (m == 'R') {
                R++;
            } else {
                R--;
            }
        }
        
        return U == 0 && R == 0;
    }
}

时间复杂度$O(n)$，空间$O(1)$。