js 数组一些简单应用

把两个数组连接成按从小到大的一个数组例如:

var allowVlan = '23-25,45,4-6,67,50-53';

var unTagVlan = '1-5';

完成时应该是1-6,23-25,45,67,50-53;

本例中用到了数组的方法:

1.数组连接

2.数组包含,

3.数组排序

4、数组去重

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/html; charset=gb2312" />
<title>无标题文档</title>
<script>

    window.onload = function(){
    //    var allowVlan = '23-25,45,4-6,67,50-53';
    //    var unTagVlan = '20-30';
        var allowVlan = '';
        var unTagVlan = '1-5';
        //重新排序
        
        var arrAllowVlan = vlanListSort(allowVlan);
        var arrUnTagVlan = vlanListSort(unTagVlan);
        
        alert("arrAllowVlan:"+arrAllowVlan+"arrUnTagVlan:"+arrUnTagVlan);
        //判断是不是包含关系
        if(includeRelation(arrAllowVlan,arrUnTagVlan)){
            /*是包含关系*/
            alert('1');
        }else{
            /*不是包含关系,需要重新组合*/
            alert('2');
            
            var tmpArr = arrAllowVlan.concat(arrUnTagVlan);
            alert("tmpArr:"+tmpArr);
            tmpArr.sort(function(a,b){
                return a-b;
            });
            alert("result:"+listCombinationStr(tmpArr));
            }
        };
    
    /*判断两个数组是不是包含关系*/
    function includeRelation(arrParent,arrChild){
    
        if(arrChild.length > arrParent.length){
            return false;
        }
        for(var i=0;i< arrChild.length;i++){
            var bContent = true;    
            for(var j=0;j<arrParent.length;j++){
                if(arrChild[i] == arrParent[j]){
                    bContent = false;
                    break;
                }
            }
            if(bContent){
                return false;
            }
        }
        return true;
    }
    
    /*排序*/
    function vlanListSort(str){
        var newArrAllow = [];
        var arrAllow = '';
        if(!str.length){
            return newArrAllow;
        } 
        arrAllow= str.split(',');
        for(var i=0;i<arrAllow.length;i++){
            if(arrAllow[i].indexOf('-') != -1){
                var tmpArr = arrAllow[i].split('-');
                for(var j=parseInt(tmpArr[0]);j<=parseInt(tmpArr[1]);j++){ //这里需要注意下'2'>'12';
                    newArrAllow.push(j);
                }
            }else{
                newArrAllow.push(parseInt(arrAllow[i]));
            }
        }
        newArrAllow.sort(function(a,b){
            return a-b;
        });
        
        return newArrAllow;
    }
    
    /*排好序的数组重新组合成新的列表,可能包含有重复的*/
    function listCombinationStr(tmpArr){    
            var outArr = [];
            var outStr = '';
            var tmpStr = '';
            
            tmpArr = deleteNumber(tmpArr);
            var tmpValue = tmpArr[0];
            for(var i=1;i<tmpArr.length;i++){
                if(tmpArr[i] == (tmpArr[i-1]+1)){
                    tmpStr = tmpValue+'-'+tmpArr[i];
                    if(i == tmpArr.length-1){
                        outStr += tmpStr+',';
                    }
                }else{
                    if(tmpStr != ''){
                        outStr += tmpStr+',';
                        tmpStr = '';
                    }else{
                        outStr += tmpValue+',';
                    }
                    
                    if(i == tmpArr.length-1){
                        outStr += tmpArr[i]+',';
                    }
                    tmpValue = tmpArr[i];
                }
            }
            outStr = outStr.substring(0,outStr.length-1);
            return outStr;
        }
        

    /*排好序的数组去重*/
    function deleteNumber(tmpArr){
        var tmp = tmpArr[0];
        
        for(var i=1;i<tmpArr.length;i++){
            if(tmpArr[i] == tmp){
                tmpArr.splice(i,1);
                i--;    
            }else{
                tmp = tmpArr[i];
            }
        }
        return tmpArr;
    }
    
</script>
</head>

<body>
</body>
</html>


自己测试了没有什么问题,如果看到的人有什么新的思路,或者其他好的方法,欢迎来踩,一起讨论

猜你喜欢

转载自www.cnblogs.com/moon-yyl/p/9056889.html