var scoreStr = "小明:87;小花:81;小紅:97;小天:76;小張:74;小小:94;小西:90;小伍:76;小迪:64;小曼:76";
var str=scoreStr.split(';');
var sum=0;
var str2=new Array();
for(var i=0;i<str.length;i++){
str2[i]=str[i].substring(3);
sum=sum+parseInt(str2[i])
}
var res=Math.round(sum/str2.length);
document.write(res);
var str=scoreStr.split(';');
var sum=0;
var str2=new Array();
for(var i=0;i<str.length;i++){
str2[i]=str[i].substring(3);
sum=sum+parseInt(str2[i])
}
var res=Math.round(sum/str2.length);
document.write(res);
2019-05-13
var max ;
function compare(x,y){
if(x>y){
max = x;
}else if(x == y){
document .write("一樣大");
}else{
max = y;
}
}
compare(5,4);
document.write(" 5 和 4 的較大值是:"+max+"<br>");
compare(6,3);
document.write(" 6 和 3 的較大值是:"+max );
function compare(x,y){
if(x>y){
max = x;
}else if(x == y){
document .write("一樣大");
}else{
max = y;
}
}
compare(5,4);
document.write(" 5 和 4 的較大值是:"+max+"<br>");
compare(6,3);
document.write(" 6 和 3 的較大值是:"+max );
2019-05-06
function app2(x,y)
{ var sum,x,y;
sum = x * y;
return sum;
}
app2(1,2);
{ var sum,x,y;
sum = x * y;
return sum;
}
app2(1,2);
2019-05-03
var myarr = new Array();
for(var i = 0; i < 3; i++)
{
myarr[i] = new Array();
for(var j = 0; j < 6; j++)
{
myarr[i][j] = i * j;
document.write("myarr[" + i + "][" + j + "]的值:" + myarr[i][j] + "<br>");
}
}
這個就可以很清晰的看到數(shù)組中每個值
for(var i = 0; i < 3; i++)
{
myarr[i] = new Array();
for(var j = 0; j < 6; j++)
{
myarr[i][j] = i * j;
document.write("myarr[" + i + "][" + j + "]的值:" + myarr[i][j] + "<br>");
}
}
這個就可以很清晰的看到數(shù)組中每個值
2019-05-02
function f(a, b) {
if (a > b) {
return a;
} else if (a < b) {
return b;
}
}
result1 = c(5, 4);
result2 = c(6, 3);
document.write("5和4比較,"+result1+"大<br />");
document.write("6和3比較,"+result2+"大");
if (a > b) {
return a;
} else if (a < b) {
return b;
}
}
result1 = c(5, 4);
result2 = c(6, 3);
document.write("5和4比較,"+result1+"大<br />");
document.write("6和3比較,"+result2+"大");
2019-04-30
另一種方式
var arr = ['*','##',"***","&&","****","##*"];
//給數(shù)組索引1處賦值(['*','**',"***","&&","****","##*"];)
arr[1] = "**";
//將數(shù)組內(nèi)容輸出,完成達到的效果。
arr.forEach(function(a){
//在forEach的回調(diào)函數(shù)中判斷數(shù)組第一位是否是*,如果是則打印
if(a.indexOf("*") > -1 && a.indexOf("*") <1){
document.write(a +"<br/>");
}
})
var arr = ['*','##',"***","&&","****","##*"];
//給數(shù)組索引1處賦值(['*','**',"***","&&","****","##*"];)
arr[1] = "**";
//將數(shù)組內(nèi)容輸出,完成達到的效果。
arr.forEach(function(a){
//在forEach的回調(diào)函數(shù)中判斷數(shù)組第一位是否是*,如果是則打印
if(a.indexOf("*") > -1 && a.indexOf("*") <1){
document.write(a +"<br/>");
}
})
2019-04-30
更加清晰https://blog.csdn.net/k491022087/article/details/52629743
2019-04-29