题解 | #华为NO.17 坐标移动#
坐标移动
http://www.nowcoder.com/practice/119bcca3befb405fbe58abe9c532eb29
暴力解法 将输入转化成字符串数组,然后将每个字符串再转换成char数组,然后通过判断和switch完成解答
public class Main {
public static void main(String[] args) {
//字符串问题
Scanner sc = new Scanner(System.in);
//根据输入,创建[以;分隔]的一个字符串数组
String[] s = sc.next().split(";");
int[] ans = new int[2];
for (int i = 0; i < s.length; i++) {
char[] c = s[i].toCharArray();
if (c.length==2&&(c[0]=='W'||c[0]=='A'||c[0]=='S'||c[0]=='D')&&c[1]>='1'&&c[1]<='9') {
int num = c[1]-'0';
switch (c[0]){
case 'W':
ans[1]+=num;
break;
case 'A':
ans[0]-=num;
break;
case 'S':
ans[1]-=num;
break;
case 'D':
ans[0]+=num;
break;
}
} else if (c.length==3&&(c[0]=='W'||c[0]=='A'||c[0]=='S'||c[0]=='D')&&c[1]>='1'&&c[1]<='9'&&c[2]>='0'&&c[2]<='9') {
int num = (c[1]-'0')*10 + (c[2]-'0');
switch (c[0]){
case 'W':
ans[1]+=num;
break;
case 'A':
ans[0]-=num;
break;
case 'S':
ans[1]-=num;
break;
case 'D':
ans[0]+=num;
break;
}
}
}
System.out.println(ans[0]+","+ans[1]);
}
}