[Programmers] (Javascript) ์ถ”์„ ํŠธ๋ž˜ํ”ฝ

2022. 4. 26. 17:30ยท๐Ÿ’ฏ CodingTest/Programmers

https://programmers.co.kr/learn/courses/30/lessons/17676#qna

 

์ฝ”๋”ฉํ…Œ์ŠคํŠธ ์—ฐ์Šต - [1์ฐจ] ์ถ”์„ ํŠธ๋ž˜ํ”ฝ

์ž…๋ ฅ: [ "2016-09-15 20:59:57.421 0.351s", "2016-09-15 20:59:58.233 1.181s", "2016-09-15 20:59:58.299 0.8s", "2016-09-15 20:59:58.688 1.041s", "2016-09-15 20:59:59.591 1.412s", "2016-09-15 21:00:00.464 1.466s", "2016-09-15 21:00:00.741 1.581s", "2016-09-1

programmers.co.kr

 

โ–ถ ์ฝ”๋“œ : 

function solution(lines) {
    let answer = 0;
    let data = [];
    let minTime = 100000000;
    let maxTime = 0;

    for (const line of lines)
    {
        var temp = line.split(' ');
        var time = temp[1].split(':');
        var h = parseInt(time[0]) * 3600;
        var m = parseInt(time[1]) * 60;
        var s = parseFloat(time[2]);

        var endTime = (h + m + s) * 1000;
        var startTime = endTime - (parseFloat(temp[2].split('s').join(''))*1000 - 1);
        data.push([startTime, endTime]);
    }
   
    // ๋ฌธ์ž์—ด์„ ์ˆซ์ž๋กœ ๋ฐ”๊พธ์–ด ์ €์žฅ
    // ์ดˆ๋กœ ๋ณ€ํ™˜ํ•ด์„œ ํ•ด๋ณด์ž

    let count = 0;

    for (let i =0; i < data.length; i++)
    {
        let boundL = data[i][1];
        let boundR = boundL + 999;
        let temp = 1;

        for (let j = i+1; j<data.length; j++)
        {
            if (data[j][0] > boundR)
            {
                continue;
            }
            else
            {
                temp+=1;
            }
        }

        if (temp > count)
        {
            count = temp;
        }
    }
    return count;
}

 

โ–ถ ๋ฌธ์ œ ํ’€์ด : 

1. ์ดˆ๊ธฐ ๊ฐ๊ฐ์˜ ๋กœ๊ทธ ์ •๋ณด ๋ฌธ์ž์—ด๋“ค์— ๋Œ€ํ•ด ์‹œ๊ฐ„์„ ์ดˆ์˜ ๋ˆ„์ ์œผ๋กœ ๋ณ€ํ™˜ํ•œ๋‹ค. 

  - ํ•ด๋‹น ๋ฌธ์ œ์˜ ๊ฒฝ์šฐ ์†Œ์ˆ˜์  ์…‹์งธ์ž๋ฆฌ๊นŒ์ง€ ๋‚˜ํƒ€๋‚˜ ์žˆ๊ธฐ์— 1000์„ ๊ณฑํ•˜์—ฌ ์ •์ˆ˜ํ˜•ํƒœ๋กœ ๋ณ€ํ™˜ํ•œ๋’ค ์‹œ์ž‘์‹œ๊ฐ„๊ณผ ๋์‹œ๊ฐ„์˜ ์ดˆ(second)๋ˆ„์ ๊ฐ’์„ data ๋ฐฐ์—ด์— ์ €์žฅํ–ˆ๋‹ค.

2. ์ด์ œ ํ•ด๋‹น ๊ฐ’๋“ค์„ ์ด์šฉํ•ด ํƒ์ƒ‰ํ•˜์—ฌ 1์ดˆ๋™์•ˆ ์ฒ˜๋ฆฌ๋œ ๋กœ๊ทธ์ˆ˜์˜ ์ตœ๋Œ€๊ฐ’์„ ์ฐพ์•„์•ผํ•˜๋Š”๋ฐ ์ดˆ๊ธฐ ์™„์ „ํƒ์ƒ‰์„ ์ด์šฉํ•ด ๊ตฌํ˜„ํ–ˆ์œผ๋‚˜ ์‹œ๊ฐ„์ดˆ๊ณผ๊ฐ€ ๋‚˜์™”๋‹ค.

3. ์ด๋กœ์ธํ•ด ๋กœ์ง์— ๋ณ€ํ™”๋ฅผ ์ฃผ์–ด์•ผ ํ–ˆ๊ณ , ์ข…๋ฃŒ์‹œ๊ฐ„์„ ๊ธฐ์ค€์œผ๋กœ ์˜ค๋ฆ„์ฐจ์ˆœ๋œ ์ •๋ ฌ๋œ ๋ฐ์ดํ„ฐ(lines)์ž„์— ์ฐฉ์•ˆํ•˜์—ฌ ๊ฐ ๋กœ๊ทธ์˜ ์ข…๋ฃŒ์‹œ๊ฐ„์„ ์‹œ์ž‘์‹œ๊ฐ„์œผ๋กœ ํ•˜์—ฌ 1์ดˆ ๋‚ด์— ๋กœ๊ทธ์˜ ์ˆ˜๋ฅผ ํƒ์ƒ‰ํ•˜๋ฉด ๋œ๋‹ค๊ณ  ์ƒ๊ฐํ–ˆ๋‹ค.

4. ์ดํ›„ ๊ฐ๊ฐ์˜ ๊ตฌ๊ฐ„๋ณ„๋กœ ๋‹ค๋ฅธ ๋กœ๊ทธ๋“ค(ํ˜„์žฌ ์‹œ์ž‘๊ฐ’์ด ๋˜๋Š” ๋กœ๊ทธ์˜ ์ดํ›„ ์ฒ˜๋ฆฌ๋œ ๋กœ๊ทธ๋“ค)๊ณผ ๋น„๊ตํ•˜์—ฌ ๋งŒ์ผ ํ˜„์žฌ 1์ดˆ๊ตฌ๊ฐ„์˜ ๋งˆ์ง€๋ง‰์‹œ๊ฐ„(boundR)๋ณด๋‹ค ํ•ด๋‹น ๋กœ๊ทธ์˜ ์‹œ์ž‘์‹œ๊ฐ„(data[j][0])์ด ํฐ ๊ฒฝ์šฐ๊ฐ€ ์•„๋‹ˆ๋ผ๋ฉด count๋ฅผ ์˜ฌ๋ ค์ฃผ์—ˆ๋‹ค.

 

๋กœ๊ทธ ์˜ˆ์‹œ

- ์œ„์™€ ๊ฐ™์ด ๋กœ๊ทธ๊ฐ€ ์ข…๋ฃŒ์‹œ๊ฐ„์„ ๊ธฐ์ค€์œผ๋กœ ์˜ค๋ฆ„์ฐจ์ˆœ ์ •๋ ฌ๋˜์–ด ์žˆ๋‹ค๋ฉด, ๊ฐ ๋กœ๊ทธ์˜ ์ข…๋ฃŒ๊ฐ’ ๊ธฐ์ค€ 1์ดˆ๋‚ด ๋‹ค๋ฅธ ๋กœ๊ทธ๋“ค๊ณผ ๊ฒน์น˜๋Š” ํšŸ์ˆ˜๋ฅผ ์„ธ๋Š” ๊ฒƒ์ด ๊ฐ€์žฅ ํฐ count๊ฐ’์„ ์–ป์„ ์ˆ˜ ์žˆ๋Š” ๋ฐฉ๋ฒ•์ด๋‹ค.

 

โ–ถ ์‹คํŒจ ์ฝ”๋“œ => ๊ฒฝ์šฐ๊ฐ€ ๋‹ค๋ฅด๋‹ค.

์ด๊ฒฝ์šฐ๋Š” ๋กœ๊ทธ์‹œ๊ฐ„์ด ์ข…๋ฃŒ์‹œ๊ฐ„์„ ๊ธฐ์ค€์œผ๋กœ ์˜ค๋ฆ„์ฐจ์ˆœ์ด ์•„๋‹๋•Œ ์™„์ „ํƒ์ƒ‰์œผ๋กœ ๊ตฌํ˜„ํ•œ ๊ฒฝ์šฐ

let count = 0;
// ๋กœ๊ทธ ์ค‘ ์–ด๋–ค ๋กœ๊ทธ์‹œ๊ฐ„์˜ endtime์œผ๋กœ๋ถ€ํ„ฐ 1์ดˆ๋‚ด์— ํ•ด๋‹น ์‹œ๊ฐ„์ด ํฌํ•จ๋˜๋Š”์ง€๋ฅผ ํ™•์ธํ•˜๋ฉด ํƒ์ƒ‰ํšŸ์ˆ˜๋ฅผ ์ค„์ผ ์ˆ˜ ์žˆ๋‹ค.   
// ํ˜„์žฌ ๋ฐฉ์‹์€ ๋กœ๊ทธ์‹œ๊ฐ„์ด ์ข…๋ฃŒ์‹œ๊ฐ„์„ ๊ธฐ์ค€์œผ๋กœ ์˜ค๋ฆ„์ฐจ์ˆœ ์ •๋ ฌ์ด ์•„๋‹๋•Œ์˜ ๊ฒฝ์šฐ์ž„
   
for (let i = minTime; i <= maxTime; i++ )
{
    let boundL = i;
    let boundR = i + 999;
    let temp = 0;

    for (const times of data)
    {
        if (times[1] < boundL || times[0] > boundR){
            continue;
        }
        else
        {
            temp += 1;
        }
    }

    if (temp > count)
    {
        count = temp;
    }
}

 

'๐Ÿ’ฏ CodingTest > Programmers' ์นดํ…Œ๊ณ ๋ฆฌ์˜ ๋‹ค๋ฅธ ๊ธ€

[Programmers] (Javascript) ์ˆœ์œ„ ๊ฒ€์ƒ‰  (2) 2022.05.02
[Programmers] (Javascript) ๋ฉ”๋‰ด ๋ฆฌ๋‰ด์–ผ  (0) 2022.04.28
[Programmers] (Javascript) ํŠœํ”Œ  (0) 2022.04.25
[Programmers] (Javascript) ์ˆ˜์‹ ์ตœ๋Œ€ํ™”  (0) 2022.04.25
[Programmers] (Javascript) ๋‰ด์Šค ํด๋Ÿฌ์Šคํ„ฐ๋ง  (0) 2022.04.25
'๐Ÿ’ฏ CodingTest/Programmers' ์นดํ…Œ๊ณ ๋ฆฌ์˜ ๋‹ค๋ฅธ ๊ธ€
  • [Programmers] (Javascript) ์ˆœ์œ„ ๊ฒ€์ƒ‰
  • [Programmers] (Javascript) ๋ฉ”๋‰ด ๋ฆฌ๋‰ด์–ผ
  • [Programmers] (Javascript) ํŠœํ”Œ
  • [Programmers] (Javascript) ์ˆ˜์‹ ์ตœ๋Œ€ํ™”
S.Honey
S.Honey
  • S.Honey
    Algo ์“ฐ์ž
    S.Honey
  • ์ „์ฒด
    ์˜ค๋Š˜
    ์–ด์ œ
    • ๋ถ„๋ฅ˜ ์ „์ฒด๋ณด๊ธฐ (123)
      • ํšŒ๊ณ  (0)
        • ์ทจ์—… ํ›„ ํšŒ๊ณ  (0)
      • ๐Ÿƒ Frontend Road-Map (2)
        • ๐Ÿšฉ Summary (1)
        • ๐Ÿ“š Road-Map Contents (1)
        • ๐ŸŸง HTML (0)
        • ๐ŸŸฆ CSS (0)
        • ๐ŸŸจ Javascript (0)
        • โฌœ React (0)
        • ๐ŸŸช Redux (0)
      • Backend (0)
        • QueryDSL (0)
      • ๐Ÿ’ป Programming Language (54)
        • C# (51)
        • Flutter-Dart (3)
        • Java (0)
      • ๐Ÿ“š Computer Science (4)
        • Algorithms (4)
        • Database (0)
        • Network (0)
        • Operating System(OS) (0)
      • ๐Ÿ’ฏ CodingTest (60)
        • BaekJoon (22)
        • Programmers (34)
        • CodeTree (4)
      • โœ’๏ธ Design Pattern (1)
      • ๐Ÿฑ Etc (2)
        • Jenkins Plugin ์ œ์ž‘๊ธฐ (1)
  • ๋ธ”๋กœ๊ทธ ๋ฉ”๋‰ด

    • ๋งํฌ

    • ๊ณต์ง€์‚ฌํ•ญ

      • ๐Ÿ“– ๊ณต๋ถ€ ์ฐธ๊ณ  ๊ต์žฌ ๋ฐ ์ž๋ฃŒ
    • ์ธ๊ธฐ ๊ธ€

    • ํƒœ๊ทธ

      ์“ฐ์…จ์ž–์•„
      ์ฝ”๋“œํŠธ๋ฆฌ
      ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค
      ์•Œ๊ณ ๋ฆฌ์ฆ˜
      sort
      c#
      DART
      ๋ฐฑ์ค€
      ๋ฌธ์ž์—ด ํŒŒ์‹ฑ
      ํŒŒ์ด์ฌ
      ๊ทธ๋ž˜ํ”„ ํƒ์ƒ‰
      ์นด์นด์˜ค
      DP
      Java
      programmers
      ๊ตฌํ˜„
      BFS
      ์ž๋ฃŒ๊ตฌ์กฐ
      ์ž๋ฐ”์Šคํฌ๋ฆฝํŠธ
      Algorithm
      ์ด์ง„ํƒ์ƒ‰
      JavaScript
      ๋™์  ํ”„๋กœ๊ทธ๋ž˜๋ฐ
      Flutter
      ์Šคํ„ฐ๋””
      BAEKJOON
      ์ฝ”๋”ฉํ…Œ์ŠคํŠธ
      ์‹œ๋ฎฌ๋ ˆ์ด์…˜
      JS
      ์‚ผ์„ฑsw์—ญํ…Œ
    • ์ตœ๊ทผ ๋Œ“๊ธ€

    • ์ตœ๊ทผ ๊ธ€

    • hELLOยท Designed By์ •์ƒ์šฐ.v4.10.1
    S.Honey
    [Programmers] (Javascript) ์ถ”์„ ํŠธ๋ž˜ํ”ฝ
    ์ƒ๋‹จ์œผ๋กœ

    ํ‹ฐ์Šคํ† ๋ฆฌํˆด๋ฐ”