Skip to content

Commit

Permalink
adding JudgeRouteCircle.java
Browse files Browse the repository at this point in the history
  • Loading branch information
Kevin Naughton Jr authored and Kevin Naughton Jr committed Jun 1, 2018
1 parent 668d511 commit f9c25d6
Show file tree
Hide file tree
Showing 2 changed files with 60 additions and 0 deletions.
30 changes: 30 additions & 0 deletions company/google/JudgeRouteCircle.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,30 @@
//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.
//
//Example 1:
//Input: "UD"
//Output: true
//Example 2:
//Input: "LL"
//Output: false

class JudgeRouteCircle {
public boolean judgeCircle(String moves) {
int UD = 0;
int LR = 0;
for(int i = 0; i < moves.length(); i++) {
if(moves.charAt(i) == 'U') {
UD++;
} else if(moves.charAt(i) == 'D') {
UD--;
} else if(moves.charAt(i) == 'L') {
LR++;
} else if(moves.charAt(i) == 'R') {
LR--;
}
}

return UD == 0 && LR == 0;
}
}
30 changes: 30 additions & 0 deletions leetcode/string/JudgeRouteCircle.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,30 @@
//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.
//
//Example 1:
//Input: "UD"
//Output: true
//Example 2:
//Input: "LL"
//Output: false

class JudgeRouteCircle {
public boolean judgeCircle(String moves) {
int UD = 0;
int LR = 0;
for(int i = 0; i < moves.length(); i++) {
if(moves.charAt(i) == 'U') {
UD++;
} else if(moves.charAt(i) == 'D') {
UD--;
} else if(moves.charAt(i) == 'L') {
LR++;
} else if(moves.charAt(i) == 'R') {
LR--;
}
}

return UD == 0 && LR == 0;
}
}

0 comments on commit f9c25d6

Please sign in to comment.