개발야옹

https://school.programmers.co.kr/learn/courses/30/lessons/1845?language=javascript 

function solution(nums) {
    const hash = {};
    
    nums.forEach((n) => {
        if(hash[n] === undefined) hash[n] = 1;
        else hash[n] += 1;
    });
    
    const M = nums.length/2;
    const keyList = Object.keys(hash);

    return M >= keyList.length ? keyList.length : M;
}

https://school.programmers.co.kr/learn/courses/30/lessons/42583?language=javascript 

function solution(bridge_length, weight, truck_weights) {
    const bridge = new Array(bridge_length).fill().map((v) => 0);
    
    let time = 0;
    let bridge_weight = 0
    let truck_number = truck_weights.length;
    
    while(truck_number > 0) {
        // console.log(bridge, time);
        time++;
        bridge_weight = bridge.reduce((partialSum, a) => partialSum + a, 0);
        if(bridge_weight <= weight
           && bridge_weight + truck_weights[0] <= weight) {
            let b = bridge.shift();
            if(b > 0) truck_number--;
            bridge.push(truck_weights.shift());
        } else if(bridge_weight <= weight 
                 && bridge_weight + truck_weights[0] > weight) {
            let b = bridge.shift();
            if(b > 0) truck_number--;
            bridge_weight = bridge.reduce((partialSum, a) => partialSum + a, 0);
            if(bridge_weight <= weight 
                 && bridge_weight + truck_weights[0] <= weight) {
                bridge.push(truck_weights.shift());
            } else bridge.push(0);
        } else if(bridge_weight <= weight && truck_weights.length === 0){
            let b = bridge.shift();
            if(b > 0) truck_number--;
            bridge.push(0);
        }
    }
        
    return time;
}

코드가 많이 지저분하다..

코딩테스트 연습 - 기능개발

function solution(progresses, speeds) {
    let days = []; 
    const answer = [];
    for(let i = 0 ; i < progresses.length ; i++) {
        const calc = Math.ceil((100-progresses[i])/(speeds[i]));
        days.push(calc);
        // days.push(Math.round((100-progresses[i])/speeds[i]));
    }
    
    let today = days[0];
    let cnt = 0;
    days.forEach((d) => {
        if(d <= today) {
            cnt++;
        } else {
            answer.push(cnt);
            cnt = 1;
            today = d;
        }
    });
        
    answer.push(cnt);
    
    return answer;
}

https://school.programmers.co.kr/learn/courses/30/lessons/42587?language=javascript 

function solution(priorities, location) {
    // priorities 중요도
    // location 내가 인쇄를 요청한 문서가 현재 대기목록의 어떤 위치에 있는지 알려주는 변수
    // answer 내가 요청한 문서가 몇 번째로 인쇄되는지 return
    
    let printed = 0;
    priorities = priorities.map((p,index) => {
        if(index === location) return {prio: p, target: true};
        return {prio: p, target: false};
    });
        
    while(true) {
        const arr = priorities.map(p => {
            return p.prio;
        });
        let max = Math.max(...arr);
        
        if(priorities[0]['prio'] !== max) {
            let prio = priorities.shift();
            priorities.push(prio);
        } else {
            if(priorities[0]['target'] === true) {
                return ++printed;
            }
            priorities.shift();
            printed++;
        }
    }
}