TIL-2024.08.08-programmers-lv2-42586.기능개발

 

 

 

 

 

 

URL

https://school.programmers.co.kr/learn/courses/30/lessons/42586

 

CODE

 

// URL > https://school.programmers.co.kr/learn/courses/30/lessons/42586

const solution = (progresses, speeds) => {
	let resultArr = [];
	const tempArr = progresses.map((item, i) => Math.ceil(( 100 - progresses[i] ) / speeds[i]));

	let point = -1;
	let count = 0;
	for (let i = 0; i < tempArr.length; i++) {
		if (point === -1 || point >= tempArr[i]) {
			count += 1;
		} else {
			resultArr.push(count);
			count = 1;
		}
		point = tempArr[i];
		if (i === tempArr.length - 1) resultArr.push(count);

	}
	return resultArr;
};

console.log("result:: ", solution([93, 30, 55], [1, 30, 5]));
console.log("result:: ", solution([95, 90, 99, 99, 80, 99], [1, 1, 1, 1, 1, 1]));