摘要：每天練習(xí)一點(diǎn)點(diǎn)，每天收獲一點(diǎn)點(diǎn)算法題收集網(wǎng)絡(luò)，僅供學(xué)習(xí)參考字符串重復(fù)次數(shù)字符串重復(fù)次數(shù)統(tǒng)計(jì)字符重復(fù)出現(xiàn)的個(gè)數(shù)過濾對(duì)象數(shù)組中指定的對(duì)象過濾對(duì)象數(shù)組中指定的對(duì)象過濾方法數(shù)組遞歸實(shí)現(xiàn)過濾指定項(xiàng)數(shù)組遞歸實(shí)現(xiàn)過濾指定項(xiàng)測(cè)試數(shù)據(jù)過濾方法數(shù)組交集補(bǔ)集數(shù)組

每天練習(xí)一點(diǎn)點(diǎn)，每天收獲一點(diǎn)點(diǎn)！！（算法題收集網(wǎng)絡(luò)，僅供學(xué)習(xí)參考）

字符串重復(fù)次數(shù)

var str = "abcdeacdbe"; //統(tǒng)計(jì)字符重復(fù)出現(xiàn)的個(gè)數(shù)；

function findRepeatNum(str) {
    return str.split("").reduce((pre,cur) => {
        if(cur in pre) {
            pre[cur] += 1;
        }else{
            pre[cur] = 1;
        }
        return pre;
    },{})
}
console.log(findRepeatNum(str)) //{a: 2, b: 2, c: 2, d: 2, e: 2}

過濾對(duì)象數(shù)組中指定的對(duì)象

var arr1 = [1,2];
var arr2 = [{id:1,name:"s"},{id:2,name:"ds"},{id:3,name:"gg"}]
//過濾方法
arr3 = arr2.filter((item) => !arr1.includes(item.id)); //[{id:3,name:"gg"}]

數(shù)組遞歸實(shí)現(xiàn)過濾指定項(xiàng)

//測(cè)試數(shù)據(jù)
var data = [{
    isextend:1,                                              
    vaL:0,
    children:[{
        isextend:1,
        vaL:1,
        children:[{
            isextend:0,
            vaL:4
        },{
            isextend:1,
            vaL:5
        }]
    },{
       isextend:1,
       vaL:2,
       children:[]
    },{
       isextend:1,
       vaL:3,
       children:[]
    }]
}]

//過濾方法
function deleteNode(arr, key,targetValue) {
    return arr.filter(function(item, i) {
        if (item.children) {
            item.children = deleteNode(item.children, key,targetValue)
        }
        return item[key] !== targetValue;
    })
}

console.log(deleteNode(data, "isextend",0))

數(shù)組交集補(bǔ)集

//測(cè)試數(shù)據(jù)（過濾isextend為0的項(xiàng)）
const a = [1, 2, 3, 4];
const b = [2, 3, 5, 6];

//過濾方法
function filterArr(arr1,arr2,type) {
    let diffArr = [];
    let sameArr = [];
    sameArr = arr1.filter(v => {
        return arr2.some(a => {
            return v == a
        })
    })
    let mergeArr = [...arr1,...arr2];
    diffArr = mergeArr.filter(v => {
        return !sameArr.includes(v)
    })
    if (type == "same") {
        return sameArr
    } else {
        return diffArr
    }
}

console.log(filterArr(a,b,"same")) // [2,3]
console.log(filterArr(a,b,"diff")) // [1,4,5,6]

獲取當(dāng)前日期前n天的日期

function getIntervalDate(days) {
    let arrDateKeys = [...Array(days).keys()];
    let result = arrDateKeys.map(v => {
    let TimeStampOneDay = 24*60*60*1000;
    let d = new Date(Date.now() - TimeStampOneDay*v);
    let str = `${d.getFullYear()}年${d.getMonth() + 1}月${d.getDate()}日`;
        return str
    })
    return result;
}
console.log(getIntervalDate(3)) // ["2019年6月3日", "2019年6月2日", "2019年6月1日"]

計(jì)算數(shù)組中的最大差值

var arr = [1,3,5,7,9,0,11,14,8,6]; //在一個(gè)整數(shù)數(shù)組中，一個(gè)數(shù)字減去它左邊的數(shù)字得到一個(gè)差值，求最大差值的數(shù)字

function findMaxDiffValue(arr) {
    var minValue = arr[0];
    var MaxDiffValue = 0;
    arr.forEach((v,index) => {
        if(minValue > v) minValue = v;
        var diff = v-minValue;
        if(diff > MaxDiffValue) MaxDiffValue = diff;
    })
    return MaxDiffValue
}
console.log(findMaxDiffValue(arr)) //14

對(duì)數(shù)組中重復(fù)對(duì)象進(jìn)行操作

//數(shù)據(jù)樣例
var arr = [
    { time: "20190807", cabin: "w",  dcp: 37 },
    { time: "20190806", cabin: "w",  dcp: 37 },
    { time: "20190805", cabin: "a",  dcp: 37 },
    { time: "20190806", cabin: "w",  dcp: 37 },
    { time: "20190807", cabin: "w",  dcp: 37 },
    { time: "20190804", cabin: "w",  dcp: 37 },
    { time: "20190803", cabin: "w",  dcp: 37 },
    { time: "20190805", cabin: "w",  dcp: 37 },
    { time: "20190802", cabin: "w",  dcp: 37 },
    { time: "20190806", cabin: "j",  dcp: 37 }, 
] 
//如果time，cabin相同，那么dcp字段的數(shù)值就相加,并且把cabin字段的value取出來變?yōu)橐粋€(gè)新的字段加入當(dāng)前對(duì)象，值為累加次數(shù);
  
function filterArr(arr) {
    return arr.reduce((pre,cur,index) => {
        let {time,cabin,dcp} = cur;
        let isHas = pre.findIndex(v => v.time == time && v.cabin == cabin);
        if(isHas > -1){
            let cur = pre[isHas];
            cur["dcp"] += cur["dcp"];
            cur[cabin]++;
        }else{
            let clone = {...cur,[cabin]:1};
            pre.push(clone)
        }    
        return pre;
    },[])
}