bool isRobotBounded(string instructions){
vector<int> direct(4);
int up=0;
int right=0;
int fangxiang=0; //0北 1 南 2 西 3 东
for (int j = 0; j < 4; j++)
{
for (int i = 0; i < instructions.size(); i++)
{
if (instructions[i]=='G')
{
if (fangxiang==0)
{
up++;
}else if(fangxiang==1){
up--;
}
else if(fangxiang==2){
right--;
}
else {
right++;
}
}else if(instructions[i]=='L'){
if (fangxiang==0)
{
fangxiang=2;
}else if(fangxiang==1){
fangxiang=3;
}
else if(fangxiang==2){
fangxiang=1;
}
else {
fangxiang=0;
}
}else if(instructions[i]=='R'){
if (fangxiang==0)
{
fangxiang=3;
}else if(fangxiang==1){
fangxiang=2;
}
else if(fangxiang==2){
fangxiang=0;
}
else {
fangxiang=1;
}
}
}
}
if (right==0&&up==0)
{
/* code */
return true;
}
else return false;
}
机器人有环
最新推荐文章于 2024-05-18 16:42:38 发布