forked from kdn251/interviews
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Kevin Naughton Jr
authored and
Kevin Naughton Jr
committed
Jun 1, 2018
1 parent
668d511
commit f9c25d6
Showing
2 changed files
with
60 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
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; | ||
} | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
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; | ||
} | ||
} |