Javascript 查找数组中的值并对其计数

Javascript 查找数组中的值并对其计数,javascript,Javascript,我有一个数组,我循环到数组中,找到一行中值为“100,0或rest”的值 var num100=100,num0=0,rest,count100=0,count0=0,countrest=0; var array1= [ /* Reduced data set */ [ "Manoj", 100, 1, 1, 1 ], [ "Jai", 0, 0, 0, 0 ], [ "Pradeep", 1, 1, 1, 1 ], [ "Reena", 0, 0, 0, 0 ], [ "San

我有一个数组,我循环到数组中,找到一行中值为“100,0或rest”的值

 var num100=100,num0=0,rest,count100=0,count0=0,countrest=0;
 var array1= [
 /* Reduced data set */
 [ "Manoj", 100, 1, 1, 1 ],
 [ "Jai", 0, 0, 0, 0 ],
 [ "Pradeep", 1, 1, 1, 1 ],
 [ "Reena", 0, 0, 0, 0 ],
 [ "Santos", 100, 1, 1, 1 ],
 [ "Brock", 0, 1, 1, 1]         
 ];    

for(var i=0;i<array1.length;i++) {
   for(var j=1;j<array1[i][j].length;j++) {
     if(array1[i][j]==100){count100++;}
     else if(array1[i][j]==0){count0++;}
     else countrest++; 
   }
}
var num100=100,num0=0,rest,count100=0,count0=0,countrest=0;
变量数组1=[
/*简化数据集*/
[“Manoj”,100,1,1,1],
[“Jai”,0,0,0,0],
[“Pradeep”,1,1,1,1],
[“Reena”,0,0,0,0],
[“桑托斯”,100,1,1,1],
[“布鲁克”,0,1,1,1]
];    

对于(var i=0;i如果数组结构始终相同

for(var i=0;i<array1.length;i++){
    if(array1[i][1] == array1[i][2] == array1[i][3] == array1[i][4]){
        if(array1[i][1]==100){count100++;}
        else if(array1[i][1]==0){count0++;}
    }else{
        countrest++; 
    }
}

for(var i=0;i这应该可以做到。对于要测试的每个子阵列,一些变量被设置为true。如果结果显示其中一个项不是0或不是100,则相应的变量被设置为false。随后捕获并解释结果

var count0 = 0; var count100 = 0; var countrest = 0;
for(var a = 0 ; a < array1.length ; a++){
    var zero = true; var hundred = true;
    for(var b = 1 ; b < array1[a].length ; b++){
        if(array1[a][b] != 0){zero = false;}
        else if(array1[a][b] != 100){hundred = false;}
    }
    if(zero == true){count0++;}
    else if(hundred == true){count100++;}
    else{countrest++;}
}
var count0=0;var count100=0;var countrest=0;
对于(var a=0;a
结构不同…..它可以在一行中有多于“5”的值…如[“jai”、0,1,0,1,0,10,1,50等]。。。。。。
for(key in array1){
    if(array1[key].indexOf(100)!=-1){
        count100++;
    }
    else if(array1[key].indexOf(1)!=1){
        countrest++;
    }
    else{
        count0++;
    }
}