Portfolio

풀이

김영준


function solution(intStrs, k, s, l) {
    let answer = [];
    return answer = intStrs.map((str) => parseInt(str.substr(s, l))).filter((num) => num > k);
}

이종현


function solution(intStrs, k, s, l) {
    const answer = [];
    
    intStrs.map((item) => {
        const num = +item.split('').splice(s, l).join('');
        if (num > k) answer.push(num);
    });
    
    return answer;
}

박노철


function solution(intStrs, k, s, l) {
   const answer=intStrs.reduce((acc,cur)=>{
       let e= s+l;
       const t=cur.slice(s,e);
       if(t>k)acc.push(+t);
       return acc
   },[])
   return answer
}

이민희


function solution(intStrs, k, s, l) {
    return intStrs.map(str => + str.slice(s, s + l)).filter(num => num > k)
}

박건우


function solution(intStrs, k, s, l) {
    const answer = intStrs.map(v => v.slice(s, s+l)).map(v => +v).filter(v => v > k);
    return answer;
}

// 고차함수 퍼레이드

박주연


function solution(intStrs, k, s, l) {
    const answer = [];
    for(let num of intStrs){
        let x = Number(num.split('').splice(s,l).join(''));
        console.log(x)
        x>k ?answer.push(x):''
    }
    
    return answer
}

배열4

풀이