2種格式數(shù)據(jù)排重

一、對(duì)數(shù)組中對(duì)象直接排重代赁，序號(hào)據(jù)用"缆镣，"分割

/**
 * 對(duì)數(shù)組中對(duì)象的某一個(gè)屬性進(jìn)行排重
 * 實(shí)現(xiàn)原理： 新建2個(gè)數(shù)組,一個(gè)保存去重后的數(shù)據(jù)(List),一個(gè)保存屬性(key),遍歷data數(shù)組,查找List數(shù)組中
 *是否存在key的值,如果存在,對(duì)序號(hào)進(jìn)行處理，不存在就保存在List中,輸出List
 * [listPaiChong 數(shù)據(jù)排重]
 * @param  {[type]} data [要排重的數(shù)組]
 * @param  {[type]} key  [數(shù)組對(duì)象中屬性]
 * @return {[type]}      [Array]
 */
function listPaiChong(data, key) {
    var List = []; // 去重后的數(shù)據(jù)
    var item = []; //臨時(shí)保存的數(shù)據(jù)(key的值)
    for (var i = 0; i < data.length; i++) {
        var value = item.indexOf(data[i][key]);
        if (value === -1) {
            item.push(data[i][key]);
            List.push(data[i]);
        } else {
            //取最早的重復(fù)數(shù)據(jù)
            var number = List[value].NUMBER; //保存重復(fù)的序號(hào)
            List[value].NUMBER = number + "," + List[value].NUMBER;
        }
    }
    return List;
}

二、數(shù)據(jù)排重為特定格式

var testS = "1,2,3,5,7,9,14,15,16,17,19,21,22,24,26,27,29,30,32,33,34,37";
console.log(testS);
var testArray = testS.split(",");
var resultArray = ["0"];
for (var i = 0; i < testArray.length; i++) {
    var index = parseInt(testArray[i]),
        resultLastIndex = resultArray[resultArray.length - 1];
    if (resultLastIndex.indexOf("-") > 0) {
        var resultLastIndexArray = resultLastIndex.split("-");
        resultLastIndex = resultLastIndexArray[resultLastIndexArray.length - 1];
        if (index - (parseInt(resultLastIndex)) === 1) {
            resultArray[resultArray.length - 1] = resultLastIndexArray[0] + "-" + index;
        } else {
            resultArray.push(index.toString());
        }
    } else {
        if (index - (parseInt(resultLastIndex)) === 1) {
            resultArray[resultArray.length - 1] = resultLastIndex + "-" + index;
        } else {
            resultArray.push(index.toString());
        }
    }
}
if (resultArray[0].indexOf("0-") === 0) {
    var headArray = resultArray[0].split("-");
    for (var i = 0; i < testArray.length - 1; i++) {
        if (parseInt(testArray[i]) > parseInt(headArray[0]) && parseInt(testArray[i]) <= parseInt(headArray[1])) {
            resultArray[0] = parseInt(testArray[i]) === parseInt(headArray[1]) ? headArray[1] : testArray[i] + "-" + headArray[1]
            break;
        }
    }
} else {
    resultArray.splice(0, 1);
}
console.log(resultArray.join(","));