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

 1 /**
 2  * Created by sheepcore on 2019-02-24
 3  * best    time complexity: O(n)
 4  * average time complexity: O(n)
 5  * worst   time complexity: O(n)
 6  * space complexity: O(4);
 7  */
 8 class Solution {
 9     public boolean judgeCircle(String moves) {
10         int lefts = 0, rights = 0, ups = 0, downs = 0;
11         for (int i = 0; i < moves.length(); i++) {
12             if (moves.charAt(i) == ‘L‘ || moves.charAt(i) == ‘l‘)
13                 lefts++;
14             else if (moves.charAt(i) == ‘R‘ || moves.charAt(i) == ‘r‘)
15                 rights++;
16             else if (moves.charAt(i) == ‘U‘ || moves.charAt(i) == ‘u‘)
17                 ups++;
18             else if (moves.charAt(i) == ‘D‘ || moves.charAt(i) == ‘d‘)
19                 downs++;
20         }
21         if (lefts == rights && ups == downs)
22             return true;
23         else
24             return false;  
25     }
26 }