搜狐第二道编程题js代码
function min(arr){
var count = arr[5] + arr[4] + arr[3] + Math.ceil(arr[2]/4);
var n =arr[0]+arr[1]*4+arr[2]*9+arr[3]*16+arr[4]*25+arr[5]*36;
arr[1] = arr[1] - 5*arr[3];
if(arr[2]%4 == 1){
arr[1] = arr[1] - (arr[2]%4)*5;
}else if(arr[2]%4 == 2){
arr[1] = arr[1] - (arr[2]%4)*3;
}else if(arr[2]%4 == 3){
arr[1] = arr[1] - (arr[2]%4);
}
if(arr[1]>0){
count += Math.ceil((4*arr[1])/36);
}
n=n-count*36;
if(n>0){
count += Math.ceil(n/36);
}
console.log(count);
}
min([0,2,0,0,1,0]);

