LeetCode-657 Robot Return to Origin Solution (with Java)

1. Description:

2. Examples:

3.Solutions:

/**
 * Created by sheepcore on 2019-02-24
 * best    time complexity: O(n)
 * average time complexity: O(n)
 * worst   time complexity: O(n)
 * space complexity: O(4);
 */
class Solution {
    public boolean judgeCircle(String moves) {
        int lefts = 0, rights = 0, ups = 0, downs = 0;
        for (int i = 0; i < moves.length(); i++) {
            if (moves.charAt(i) == 'L' || moves.charAt(i) == 'l')
                lefts++;
            else if (moves.charAt(i) == 'R' || moves.charAt(i) == 'r')
                rights++;
            else if (moves.charAt(i) == 'U' || moves.charAt(i) == 'u')
                ups++;
            else if (moves.charAt(i) == 'D' || moves.charAt(i) == 'd')
                downs++;
        }
        if (lefts == rights && ups == downs)
            return true;
        else
            return false;  
    }
}