您的位置:首页 > 编程语言 > Java开发

蓝桥杯第五届javaA8兰顿蚂蚁

2015-02-11 16:01 218 查看
package fifth;

import java.util.Scanner;

public class Test8 {
public static int m,n,i,j,step;
public static int[][] a;
public static char c;

public static void main(String[] args){

Scanner scanner = new Scanner(System.in);
m = scanner.nextInt();
n = scanner.nextInt();

a = new int[m]
;

for(int i=0;i<m;i++){
for(int j=0;j<n;j++){
a[i][j]=scanner.nextInt();//获取矩阵数列
}
}
i = scanner.nextInt();//当前位置坐标
j = scanner.nextInt();
c = scanner.next().charAt(0);

step = scanner.nextInt();

String str = "URDL";//方向标志
int strNum = str.indexOf(c); 

while(step>0){

if(strNum>3)strNum = 0;//方向标志循环
if(strNum<0)strNum = 3;
char ch = str.charAt(strNum);
switch(ch){
case 'U':

if(a[i][j]==1){

strNum++;//右转

a[i][j]=0;

j++;//前进

}else{

//左转

strNum--;

a[i][j]=1;

//前进

j--;
};break;
case 'R':
if(a[i][j]==1){
strNum++;
a[i][j]=0;
i++;
}else{
strNum--;
a[i][j]=1;
i--;
};break;

case 'D':
if(a[i][j]==1){
strNum++;
a[i][j]=0;
j--;
}else{
strNum--;
a[i][j]=1;
j++;
};break;

case 'L':
if(a[i][j]==1){
strNum++;
a[i][j]=0;
i--;
}else{
strNum--;
a[i][j]=1;
i++;
};break;

}
step--;
}
System.out.println(i+" "+j);
}

}
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签:  兰顿蚂蚁