华为笔试题
第一题：骰子题12345表示最初状态，LRFBAC分别表示向左翻转，向右翻转，向前，向后，逆时针90度，顺时针90度，输入字母后判断最后的状态
var readline = require("readline");
var rl = readline.createInterface(process.stdin, process.stdout);
var args = [];
rl.on("line", function(str){
args.push(str);
rl.close();
});
rl.on("close", function(){
var arr = args.trim().split(" ");//输入的三个数字
var num = "123456".split("");
var arr = arr.split("");
for(var i=0;i<arr.length;i++){
switch(arr){
case 'L':
swap(num,0,5);
swap(num,1,4);
swap(num,0,1);
break;
case 'R':
swap(num,0,5);
swap(num,1,4);
swap(num,4,5);
break;
case 'F':
swap(num,2,4);
swap(num,3,5);
swap(num,4,5);
break;
case 'B':
swap(num,2,4);
swap(num,3,5);
swap(num,2,3);
break;
case 'A':
swap(num,0,3);
swap(num,1,2);
swap(num,2,3);
break;
case 'C':
swap(num,0,3);
swap(num,1,2);
swap(num,0,1);
break;
}
}
console.log(num.join(""));
});
function swap(arr,i,j){
var temp;
temp = arr;
arr = arr;
arr = temp;
}
第二题：写一个recerseAdd函数，输入的两个整数反转后求和
var readline = require("readline");
var rl = readline.createInterface(process.stdin, process.stdout);
var args = [];
rl.on("line", function(str){
args.push(str);
rl.close();
});
rl.on("close", function(){
var arr = args.trim().split("，");//输入的三个数字
var num = 0;
var num1 = parseInt(arr.split("").reverse().join(""));
var num2 = parseInt(arr.split("").reverse().join(""));
num = num1+num2;
console.log(num);
});
页:
[1]