2019.11.8 笔记

数组练习

    // -------------------------------------
    // 找偶数
    var arr = [1,2,3,4,5,6,7,8,9,10];
    for(var i = 1;i <= 10;i++){
        if(i % 2 == 0){
            console.log(i);
        }
    }
    
    // ----------------------------------------------
    // 最大值
    var attr = [4,8,16,7,9,3,10]
    var max = attr[0];
    for (var i = 0; i < attr.length - 1; i++) {
        max = max < attr[i+1] ? attr[i+1] : max;
    }
    console.log(max);
    // --------------------------------------------------
    // 最小值
    var attr = [4,8,16,7,9,3,10]
    var min = attr[0];
    for (var i = 0; i < attr.length - 1; i++) {
        min = min < attr[i+1] ? min : attr[i+1];
    }
    console.log(min);
    // ------------------------------------------------------
    // 最大索引
    var m = 0;
    var attr = [4,8,16,7,9,3,10];
    for(var i = 0;i < attr.length-1;i++){
        m = m < i+1 ? i+1 : m;
    }
    console.log(m);
    // ------------------------------------------------------------
    // 最小索引
    var s = 0;
    var attr = [4,8,16,7,9,3,10];
    for(var i = 0;i < attr.length-1;i++){
        s = s < i+1 ? s : i+1;
    }
    console.log(s);
    // ---------------------------------------------------------------
    // 去重
    var attr = [1,4,7,1,7,9,4,6,4,0,3,7,13,16,18,13];
    var arr =[];
    for(var i = 0;i < attr.length;i++){
        if(arr.indexOf(attr[i]) == -1){
            arr.push(attr[i])
        }
    }
    console.log(arr);

猜你喜欢

转载自www.cnblogs.com/l1314/p/11830472.html
今日推荐