rigood

ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค Lv0 ์ค‘์•™๊ฐ’ ๊ตฌํ•˜๊ธฐ ๋ณธ๋ฌธ

๐Ÿ“š ์ฝ”๋”ฉํ…Œ์ŠคํŠธ

ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค Lv0 ์ค‘์•™๊ฐ’ ๊ตฌํ•˜๊ธฐ

rigood 2023. 1. 21. 15:15

[์ถœ์ฒ˜] ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค https://school.programmers.co.kr/learn/courses/30/lessons/120811

 

function solution(array){
	return array.sort((a,b)=>a-b)[Math.floor(array.length/2)];
}

์ž๋ฐ”์Šคํฌ๋ฆฝํŠธ์˜ sort() ๋ฉ”์„œ๋“œ๋ฅผ ์‚ฌ์šฉํ•˜๋ฉด ์‰ฝ๊ฒŒ ์ •๋ ฌ๋œ ๋ฐฐ์—ด์„ ์–ป์„ ์ˆ˜ ์žˆ๋‹ค.

array.sort([compareFunction])

// ์˜ค๋ฆ„์ฐจ์ˆœ ์ •๋ ฌ
array.sort((a,b) => a-b)

// ๋‚ด๋ฆผ์ฐจ์ˆœ ์ •๋ ฌ
array.sort((a,b) => b-a)
function solution(array) {

// 1. ์˜ค๋ฆ„์ฐจ์ˆœ์œผ๋กœ ์ •๋ ฌ
// 1-1. ๋ฐฐ์—ด ์ค‘ ๊ฐ€์žฅ ์ž‘์€ ๊ฐ’ ์ฐพ๊ธฐ
// 1-2. ์ƒˆ ๋ฐฐ์—ด์— ์ฐพ์€ ๊ฐ’ ๋„ฃ๊ธฐ
// 1-3. ๊ธฐ์กด ๋ฐฐ์—ด์—์„œ ์ฐพ์€ ๊ฐ’ ๋นผ๊ธฐ
// 1-4. ๋ฐฐ์—ด ๊ธธ์ด๋งŒํผ 1-1~1-3 ์„ ๋ฐ˜๋ณต    
// 2. ๋ฐฐ์—ด์˜ ๊ฐ€์šด๋ฐ ๊ฐ’ ๊บผ๋‚ด๊ธฐ

// 1-4. ๋ฐฐ์—ด ๊ธธ์ด๋งŒํผ 1-1~1-3 ๋ฐ˜๋ณต
let arrayCnt = 0;
let newArray = [];
    
while(arrayCnt < array.length){
    
    // 1-1. ๋ฐฐ์—ด ์ค‘ ๊ฐ€์žฅ ์ž‘์€ ๊ฐ’ ์ฐพ๊ธฐ
    let minNumber = 1000;
    let cnt = 0;
    while(cnt < array.length){
        if(minNumber > array[cnt]){
            minNumber = array[cnt]
        }
        cnt = cnt+1;
    }

    // 1-2. ์ƒˆ ๋ฐฐ์—ด์— ์ฐพ์€ ๊ฐ’ ๋„ฃ๊ธฐ
    newArray.push(minNumber);

    // 1-3. ๊ธฐ์กด ๋ฐฐ์—ด์—์„œ ์ฐพ์€ ๊ฐ’ ๋นผ๊ธฐ(์ฐพ์€ ๊ฐ’์— ํฐ ์ˆซ์ž ๋„ฃ์–ด๋ฒ„๋ฆฌ๊ธฐ๋กœ ๋Œ€์ฒด)
    let cnt2 = 0;
    while(cnt2 < array.length){
        if(minNumber === array[cnt2]){
            array[cnt2] = 1000;
            break;
        }
        cnt2 = cnt2 +1;
    }
    
    arrayCnt = arrayCnt +1;
}   
    
    // 2. ๋ฐฐ์—ด์˜ ๊ฐ€์šด๋ฐ ๊ฐ’ ๊บผ๋‚ด๊ธฐ
    return newArray[Math.floor(array.length/2)];
}

[์ถœ์ฒ˜] ๋ผ๋งค๊ฐœ๋ฐœ์ž https://youtu.be/wnl3UyLecnc

 

Comments