zoukankan      html  css  js  c++  java
  • 玩一玩数组

    1.// 摇号( 随机抽取不重复数组 )

    var arr = '01234'.split('');
            var time = arr.length;
            var count = 0;
            changeArr(arr);
    
            function changeArr(arr) {
                // var len = arr.length;           
                // var ran = Math.floor(len * Math.random());
                // var arrOut = [];
                // for (var i = 0; i < len; i++) {
                //     if (i !== ran) {
                //         arrOut.push(arr[i]);
                //     }
                // }
                // console.log(arr[ran],arrOut.join(''));
                // count++;
                // if(count>=time){
                //     return;
                // }else{                
                //     changeArr(arrOut);
                // }      
    
                var len = arr.length;           
                var ran = Math.floor(len * Math.random());
                var arrIndex=arr[ran];
                arr.splice(ran,1);
                console.log(arrIndex,arr.join(''));
                count++;
                if(count>=time){
                    return;
                }else{                
                    changeArr(arr);
                } 
    
            }

    2.字符串 / 数组 乱序

            // var str = '0123456789';
            // str=str.split('').sort(function(){return Math.random()-0.5}).join('');
            // console.log(str);

    3.删除数组 指定项数组

    var arr1 = [1, 2, 3, 4];
            var arr2 = [1, '3'];
    
            function deleteArr(arr, arrEle) {
                if (typeof arrEle === 'string' || typeof arrEle === 'number') {
                    var temp = [];
                    temp.push(arrEle);
                    arrEle = temp;
                }
                if (arrEle.length === 0) {
                    return arr;
                }
                var arrOut = [];
                var flag = 0;
                for (var i = 0, j = arr.length; i < j; i++) {
                    flag = 0;
                    for (var m = 0, n = arrEle.length; m < n; m++) {
                        if (arr[i] !== arrEle[m]) {
                            flag++;
                        }
                    }
                    if (flag === n) {
                        arrOut.push(arr[i]);
                    }
                }
                return arrOut;
            }
            console.log(deleteArr(arr1, arr2));
  • 相关阅读:
    python execfile
    ubuntu速度慢的原因之内存和swap分区
    AFAIK=as far as i know
    Python中静态方法的实现
    KirbyBasepure python text database
    A Novel Approach to Data Retrieval and Instrumentation Control at Remote Field Sites using Python and Network News
    stackoverflow将成我的新的csdn

    Lynx
    mutliprocessing
  • 原文地址:https://www.cnblogs.com/justSmile2/p/10063218.html
Copyright © 2011-2022 走看看