deo2kim
๋งž์™œํ‹€
deo2kim
์ „์ฒด ๋ฐฉ๋ฌธ์ž
์˜ค๋Š˜
์–ด์ œ
  • ๋ถ„๋ฅ˜ ์ „์ฒด๋ณด๊ธฐ
    • CS
      • Algorithm
      • Data Structure
      • Network
      • DB
      • OS
    • Algorithm Problem
      • Python
      • JavaScript
    • Programming language
      • Python
      • JavaScript
    • Tool
      • Jquery
      • React
    • ๊ฐœ๋ฐœ
    • Infra

๋ธ”๋กœ๊ทธ ๋ฉ”๋‰ด

  • ํ™ˆ
  • ํƒœ๊ทธ
  • ๋ฐฉ๋ช…๋ก

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

์ธ๊ธฐ ๊ธ€

์ตœ๊ทผ ๋Œ“๊ธ€

์ตœ๊ทผ ๊ธ€

ํ‹ฐ์Šคํ† ๋ฆฌ

๋ฐ˜์‘ํ˜•
hELLO ยท Designed By ์ •์ƒ์šฐ.
deo2kim

๋งž์™œํ‹€

[python] ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค - ๋ธ”๋ก ์ด๋™ํ•˜๊ธฐ(2020 KAKAO BLIND RECRUITMENT)
Algorithm Problem/Python

[python] ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค - ๋ธ”๋ก ์ด๋™ํ•˜๊ธฐ(2020 KAKAO BLIND RECRUITMENT)

2020. 9. 1. 08:46
๋ฐ˜์‘ํ˜•

๐Ÿค”๋ฌธ์ œ ํ•ด๊ฒฐ

1. Lv3 | BFS ์‹ฌํ™”

2. BFS๋ฅผ ๋Œ๋ฆด q์™€ ๋ฐฉ๋ฌธ์ฒดํฌํ•  visited๋ฆฌ์ŠคํŠธ๋ฅผ ์ค€๋น„ํ•œ๋‹ค.

 (1) q๋Š” deque๋ฅผ ์ด์šฉ. ๋กœ๋ด‡์˜ ์ขŒํ‘œ 4๊ฐ€์ง€ (x1,y1,x2,y2)์™€ ํ˜„์žฌ์˜ ๊ฑฐ๋ฆฌ d ๋ฅผ ๋„ฃ๋Š”๋‹ค.

 (2) visited์—๋Š” ๋กœ๋ด‡์˜ ์ขŒํ‘œ๋งŒ ๋„ฃ๋Š”๋‹ค.

3. BFS๋ฅผ ๋Œ๋ฆฐ๋‹ค.

 (1) ๋จผ์ € ๋์ ์— ๋„๋‹ฌํ–ˆ๋‹ค๋ฉด ๋ฐ”๋กœ ๋ฉˆ์ถฐ์ฃผ๊ณ  ๊ฑฐ๋ฆฌ๋ฅผ ์ถœ๋ ฅํ•œ๋‹ค.

 (2) ๊ทธ๋ ‡์ง€ ์•Š๋‹ค๋ฉด ๋กœ๋ด‡์ด ์„ธ๋กœ์ธ๊ฒฝ์šฐ์™€ ๊ฐ€๋กœ์ธ๊ฒฝ์šฐ๋ฅผ ๋‚˜๋ˆ„๊ณ , ์ƒํ•˜์ขŒ์šฐ ์›€์ง์ผ ์ˆ˜ ์žˆ๋Š” ์ง€ ์ฒดํฌํ•œ๋‹ค.

 (3) ๋กœ๋ด‡์ด ์„ธ๋กœ์ธ ๊ฒฝ์šฐ ์˜ค๋ฅธ์ชฝ ์ด๋™์ด ๊ฐ€๋Šฅํ•˜๋ฉด ์˜ค๋ฅธ์ชฝ ํšŒ์ „๋„ ๊ฐ€๋Šฅํ•˜๋‹ค. ๋งˆ์ฐฌ๊ฐ€์ง€๋กœ ์™ผ์ชฝ์ด๋™์ด ๊ฐ€๋Šฅํ•˜๋ฉด ์™ผ์ชฝ์œผ๋กœ ํšŒ์ „๋„ ๊ฐ€๋Šฅํ•˜๋‹ค.

 (4) ๊ฐ€๋กœ๋„ ๋งˆ์ฐฌ๊ฐ€์ง€

 (5) ์ด๋™์ด๋‚˜ ํšŒ์ „์ด ๊ฐ€๋Šฅํ•˜๋ฉด visited๋ฆฌ์ŠคํŠธ๋ฅผ ํ™•์ธํ•ด ๋ฐฉ๋ฌธํ•œ์ ์ด ์—†์œผ๋ฉด q์™€ visited์— ๋„ฃ์–ด์ค€๋‹ค.

 (6) (1)๋ฒˆ์„ ๋งŒ๋‚˜๋ฉด ๋

 

๐Ÿ’จ BFS ์‹ฌํ™” ๊ณผ์ •์ธ๋“ฏ ํ•˜๋‹ค.... ๋‘์นธ์„ ์ฐจ์ง€ํ•˜๋Š” ๊ฐœ๋…๊ณผ ํšŒ์ „ ๊ฐœ๋…์ด ์ถ”๊ฐ€๋ผ์„œ ๋ณต์žกํ–ˆ๋‹ค. 

๋กœ๋ด‡์˜ ์œ„์น˜๋Š” ์•ž๋’ค๋ฅผ ๊ตฌ๋ถ„ํ•ด์ค˜์•ผ ํ•œ๋‹ค. ์ขŒํ‘œ๊ฐ€ ์ž‘์€์ชฝ์ด x1,x2๊ฐ€ ๋˜์–ด์•ผ ํ•œ๋‹ค. ์•ˆ๊ทธ๋Ÿฌ๋ฉด ๋„ˆ๋ฌด ๊ฒฝ์šฐ์˜ ์ˆ˜๊ฐ€ ๋งŽ์•„์ง

๋ญ”๊ฐ€ ๋กœ๋ด‡์˜ ์ด๋™๊ทœ์น™์ด ์žˆ์„ ๊ฑฐ ๊ฐ™์ง€๋งŒ ์ด๋ ‡๊ฒŒ ๋ณต์žกํ•  ๋•Œ๋Š” ๊ทธ๋ƒฅ ํ•œ๊ฐ€์ง€ ํ•œ๊ฐ€์ง€ ๊ฐ€๋Šฅํ•œ ๊ฒฝ์šฐ๋ฅผ ๋‹ค ๋‚˜์—ดํ•˜๋Š”๊ฒŒ ์ข‹๋‹ค.

 

๐Ÿ’ป์†Œ์Šค ์ฝ”๋“œ

from collections import deque


def solution(board):
    def my_append(t, d):
        # ๋ฐฉ๋ฌธํ•œ์ ์ด ์—†์„ ๋•Œ ์ถ”๊ฐ€ํ•ด์คŒ
        if t not in visited:
            q.append((t, d))
            visited.add(t)

    n = len(board)

    q = deque()
    visited = set()  # set์œผ๋กœ ๋งŒ๋“ค์–ด์•ผ ์‹œ๊ฐ„๋ณต์žก๋„ ์ค„์ธ๋‹ค
    q.append(((0, 0, 0, 1), 0))
    visited.add((0, 0, 0, 1))
    while q:
        t, d = q.popleft()  # t: ํ•ด๋‹น ์ขŒํ‘œ, d: ๊ฑฐ๋ฆฌ
        x1, y1, x2, y2 = t

        # ๊ฐ€๋กœ ๋„์ฐฉ
        if x1 == n - 1 and x2 == n - 1 and y1 == n - 2 and y2 == n - 1:
            return d
        # ์„ธ๋กœ ๋„์ฐฉ
        if x1 == n - 2 and x2 == n - 1 and y1 == n - 1 and y2 == n - 1:
            return d

        d += 1  # ๋์— ๋„์ฐฉํ•˜์ง€ ์•Š์•˜์œผ๋ฏ€๋กœ ๊ฑฐ๋ฆฌ๋ฅผ 1 ๋Š˜๋ฆผ

        # ์›€์ง์ด๋Š” ๋ชจ๋“  ์กฐ๊ฑด
        # ๊ฐ€๋กœ ์ผ ๋•Œ
        if x1 == x2:
            # ์˜ค๋ฅธ์ชฝ ์ด๋™
            if y2 + 1 < n and board[x2][y2 + 1] == 0:
                t = (x1, y1 + 1, x2, y2 + 1)
                my_append(t, d)
            # ์™ผ์ชฝ ์ด๋™
            if y1 - 1 >= 0 and board[x1][y1 - 1] == 0:
                t = (x1, y1 - 1, x2, y2 - 1)
                my_append(t, d)

            # ์œ„๋กœ ์ด๋™ | ๊ฐ€๋Šฅํ•˜๋ฉด ์˜ค๋ฅธ์ชฝ ์œ„ ํšŒ์ „๋„ ๊ฐ€๋Šฅ, ํš์ชฝ ์œ„ ํšŒ์ „๋„ ๊ฐ€๋Šฅ
            if x1 - 1 >= 0 and board[x1 - 1][y1] == 0 and board[x2 - 1][y2] == 0:
                t = (x1 - 1, y1, x2 - 1, y2)
                my_append(t, d)
                # ์˜ค๋ฅธ์ชฝ ์œ„ ํšŒ์ „
                t = (x1 - 1, y1 + 1, x2, y2)
                my_append(t, d)
                # ์™ผ์ชฝ ์œ„ ํšŒ์ „
                t = (x2 - 1, y2 - 1, x1, y1)
                my_append(t, d)
            # ์•„๋ž˜๋กœ ์ด๋™ | ๊ฐ€๋Šฅํ•˜๋ฉด ์˜ค๋ฅธ์ชฝ ์•„๋ž˜ ํšŒ์ „๋„ ๊ฐ€๋Šฅ, ์™ผ์ชฝ ์•„๋ž˜ ํšŒ์ „๋„ ๊ฐ€๋Šฅ
            if x1 + 1 < n and board[x1 + 1][y1] == 0 and board[x2 + 1][y2] == 0:
                t = (x1 + 1, y1, x2 + 1, y2)
                my_append(t, d)
                # ์˜ค๋ฅธ์ชฝ ์•„๋ž˜ ํšŒ์ „
                t = (x2, y2, x1 + 1, y1 + 1)
                my_append(t, d)
                # ์™ผ์ชฝ ์•„๋ž˜ ํšŒ์ „
                t = (x1, y1, x2 + 1, y2 - 1)
                my_append(t, d)

        # ์„ธ๋กœ ์ผ ๋•Œ
        elif y1 == y2:
            # ์˜ค๋ฅธ์ชฝ ์ด๋™
            if y1 + 1 < n and board[x1][y1 + 1] == 0 and board[x2][y2 + 1] == 0:
                t = (x1, y1 + 1, x2, y2 + 1)
                my_append(t, d)
                # ์˜ค๋ฅธ์ชฝ ์•„๋ž˜ ํšŒ์ „
                t = (x2, y2, x1 + 1, y1 + 1)
                my_append(t, d)
                # ์˜ค๋ฅธ์ชฝ ์œ„ ํšŒ์ „
                t = (x1, y1, x2 - 1, y2 + 1)
                my_append(t, d)
            # ์™ผ์ชฝ ์ด๋™
            if y1 - 1 >= 0 and board[x1][y1 - 1] == 0 and board[x2][y2 - 1] == 0:
                t = (x1, y1 - 1, x2, y2 - 1)
                my_append(t, d)
                # ์™ผ์ชฝ ์•„๋ž˜ ํšŒ์ „
                t = (x1 + 1, y1 - 1, x2, y2)
                my_append(t, d)
                # ์™ผ์ชฝ ์œ„ ํšŒ์ „
                t = (x2 - 1, y2 - 1, x1, y1)
                my_append(t, d)
            # ์œ„๋กœ ์ด๋™
            if x1 - 1 >= 0 and board[x1 - 1][y1] == 0:
                t = (x1 - 1, y1, x2 - 1, y2)
                my_append(t, d)
            # ์•„๋ž˜๋กœ ์ด๋™
            if x2 + 1 < n and board[x2 + 1][y1] == 0:
                t = (x1 + 1, y1, x2 + 1, y2)
                my_append(t, d)

# print(solution([[0, 0, 0, 1, 1], [0, 0, 0, 1, 0], [0, 1, 0, 1, 1], [1, 1, 0, 0, 1], [0, 0, 0, 0, 0]]))
# print(solution([[0, 0, 0, 0, 0, 0, 1], [1, 1, 1, 1, 0, 0, 1], [0, 0, 0, 0, 0, 0, 0], [0, 0, 1, 1, 1, 1, 0], [0, 1, 1, 1, 1, 1, 0], [0, 0, 0, 0, 0, 1, 1], [0, 0, 1, 0, 0, 0, 0]]))
# print(solution([[0, 0, 0, 0, 0, 0, 1], [1, 1, 1, 1, 0, 0, 1], [0, 0, 0, 0, 0, 0, 0], [0, 0, 1, 1, 1, 0, 0], [0, 1, 1, 1, 1, 1, 0], [0, 0, 0, 0, 0, 1, 0], [0, 0, 1, 0, 0, 0, 0]]))
# print(solution( [[0, 0, 0, 0, 0, 0, 0, 0, 0], [1, 1, 1, 1, 1, 1, 1, 0, 0], [1, 1, 1, 1, 1, 1, 1, 1, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 1, 1, 1, 1, 1, 0, 0], [0, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 1, 1, 1, 1, 1, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0], [1, 1, 1, 1, 1, 1, 1, 1, 0]]))


# 7, 21, 11, 33

 

๐Ÿ“•๋ฌธ์ œ ํ™•์ธ

์ถœ์ฒ˜: ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค

๋งํฌ: https://programmers.co.kr/learn/courses/30/lessons/60063

 

์ฝ”๋”ฉํ…Œ์ŠคํŠธ ์—ฐ์Šต - ๋ธ”๋ก ์ด๋™ํ•˜๊ธฐ

[[0, 0, 0, 1, 1],[0, 0, 0, 1, 0],[0, 1, 0, 1, 1],[1, 1, 0, 0, 1],[0, 0, 0, 0, 0]] 7

programmers.co.kr




๋ฌธ์ œ ์„ค๋ช…

๋กœ๋ด‡๊ฐœ๋ฐœ์ž ๋ฌด์ง€๋Š” ํ•œ ๋‹ฌ ์•ž์œผ๋กœ ๋‹ค๊ฐ€์˜จ ์นด์นด์˜ค๋ฐฐ ๋กœ๋ด‡๊ฒฝ์ง„๋Œ€ํšŒ์— ์ถœํ’ˆํ•  ๋กœ๋ด‡์„ ์ค€๋น„ํ•˜๊ณ  ์žˆ์Šต๋‹ˆ๋‹ค. ์ค€๋น„ ์ค‘์ธ ๋กœ๋ด‡์€ 2 x 1 ํฌ๊ธฐ์˜ ๋กœ๋ด‡์œผ๋กœ ๋ฌด์ง€๋Š” 0๊ณผ 1๋กœ ์ด๋ฃจ์–ด์ง„ N x N ํฌ๊ธฐ์˜ ์ง€๋„์—์„œ 2 x 1 ํฌ๊ธฐ์ธ ๋กœ๋ด‡์„ ์›€์ง์—ฌ (N, N) ์œ„์น˜๊นŒ์ง€ ์ด๋™ ํ•  ์ˆ˜ ์žˆ๋„๋ก ํ”„๋กœ๊ทธ๋ž˜๋ฐ์„ ํ•˜๋ ค๊ณ  ํ•ฉ๋‹ˆ๋‹ค. ๋กœ๋ด‡์ด ์ด๋™ํ•˜๋Š” ์ง€๋„๋Š” ๊ฐ€์žฅ ์™ผ์ชฝ, ์ƒ๋‹จ์˜ ์ขŒํ‘œ๋ฅผ (1, 1)๋กœ ํ•˜๋ฉฐ ์ง€๋„ ๋‚ด์— ํ‘œ์‹œ๋œ ์ˆซ์ž 0์€ ๋นˆ์นธ์„ 1์€ ๋ฒฝ์„ ๋‚˜ํƒ€๋ƒ…๋‹ˆ๋‹ค. ๋กœ๋ด‡์€ ๋ฒฝ์ด ์žˆ๋Š” ์นธ ๋˜๋Š” ์ง€๋„ ๋ฐ–์œผ๋กœ๋Š” ์ด๋™ํ•  ์ˆ˜ ์—†์Šต๋‹ˆ๋‹ค. ๋กœ๋ด‡์€ ์ฒ˜์Œ์— ์•„๋ž˜ ๊ทธ๋ฆผ๊ณผ ๊ฐ™์ด ์ขŒํ‘œ (1, 1) ์œ„์น˜์—์„œ ๊ฐ€๋กœ๋ฐฉํ–ฅ์œผ๋กœ ๋†“์—ฌ์žˆ๋Š” ์ƒํƒœ๋กœ ์‹œ์ž‘ํ•˜๋ฉฐ, ์•ž๋’ค ๊ตฌ๋ถ„์—†์ด ์›€์ง์ผ ์ˆ˜ ์žˆ์Šต๋‹ˆ๋‹ค.

๋กœ๋ด‡์ด ์›€์ง์ผ ๋•Œ๋Š” ํ˜„์žฌ ๋†“์—ฌ์žˆ๋Š” ์ƒํƒœ๋ฅผ ์œ ์ง€ํ•˜๋ฉด์„œ ์ด๋™ํ•ฉ๋‹ˆ๋‹ค. ์˜ˆ๋ฅผ ๋“ค์–ด, ์œ„ ๊ทธ๋ฆผ์—์„œ ์˜ค๋ฅธ์ชฝ์œผ๋กœ ํ•œ ์นธ ์ด๋™ํ•œ๋‹ค๋ฉด (1, 2), (1, 3) ๋‘ ์นธ์„ ์ฐจ์ง€ํ•˜๊ฒŒ ๋˜๋ฉฐ, ์•„๋ž˜๋กœ ์ด๋™ํ•œ๋‹ค๋ฉด (2, 1), (2, 2) ๋‘ ์นธ์„ ์ฐจ์ง€ํ•˜๊ฒŒ ๋ฉ๋‹ˆ๋‹ค. ๋กœ๋ด‡์ด ์ฐจ์ง€ํ•˜๋Š” ๋‘ ์นธ ์ค‘ ์–ด๋А ํ•œ ์นธ์ด๋ผ๋„ (N, N) ์œ„์น˜์— ๋„์ฐฉํ•˜๋ฉด ๋ฉ๋‹ˆ๋‹ค.

๋กœ๋ด‡์€ ๋‹ค์Œ๊ณผ ๊ฐ™์ด ์กฐ๊ฑด์— ๋”ฐ๋ผ ํšŒ์ „์ด ๊ฐ€๋Šฅํ•ฉ๋‹ˆ๋‹ค.

์œ„ ๊ทธ๋ฆผ๊ณผ ๊ฐ™์ด ๋กœ๋ด‡์€ 90๋„์”ฉ ํšŒ์ „ํ•  ์ˆ˜ ์žˆ์Šต๋‹ˆ๋‹ค. ๋‹จ, ๋กœ๋ด‡์ด ์ฐจ์ง€ํ•˜๋Š” ๋‘ ์นธ ์ค‘, ์–ด๋А ์นธ์ด๋“  ์ถ•์ด ๋  ์ˆ˜ ์žˆ์ง€๋งŒ, ํšŒ์ „ํ•˜๋Š” ๋ฐฉํ–ฅ(์ถ•์ด ๋˜๋Š” ์นธ์œผ๋กœ๋ถ€ํ„ฐ ๋Œ€๊ฐ์„  ๋ฐฉํ–ฅ์— ์žˆ๋Š” ์นธ)์—๋Š” ๋ฒฝ์ด ์—†์–ด์•ผ ํ•ฉ๋‹ˆ๋‹ค. ๋กœ๋ด‡์ด ํ•œ ์นธ ์ด๋™ํ•˜๊ฑฐ๋‚˜ 90๋„ ํšŒ์ „ํ•˜๋Š” ๋ฐ๋Š” ๊ฑธ๋ฆฌ๋Š” ์‹œ๊ฐ„์€ ์ •ํ™•ํžˆ 1์ดˆ ์ž…๋‹ˆ๋‹ค.

0๊ณผ 1๋กœ ์ด๋ฃจ์–ด์ง„ ์ง€๋„์ธ board๊ฐ€ ์ฃผ์–ด์งˆ ๋•Œ, ๋กœ๋ด‡์ด (N, N) ์œ„์น˜๊นŒ์ง€ ์ด๋™ํ•˜๋Š”๋ฐ ํ•„์š”ํ•œ ์ตœ์†Œ ์‹œ๊ฐ„์„ return ํ•˜๋„๋ก solution ํ•จ์ˆ˜๋ฅผ ์™„์„ฑํ•ด์ฃผ์„ธ์š”.

์ œํ•œ์‚ฌํ•ญ

  • board์˜ ํ•œ ๋ณ€์˜ ๊ธธ์ด๋Š” 5 ์ด์ƒ 100 ์ดํ•˜์ž…๋‹ˆ๋‹ค.
  • board์˜ ์›์†Œ๋Š” 0 ๋˜๋Š” 1์ž…๋‹ˆ๋‹ค.
  • ๋กœ๋ด‡์ด ์ฒ˜์Œ์— ๋†“์—ฌ ์žˆ๋Š” ์นธ (1, 1), (1, 2)๋Š” ํ•ญ์ƒ 0์œผ๋กœ ์ฃผ์–ด์ง‘๋‹ˆ๋‹ค.
  • ๋กœ๋ด‡์ด ํ•ญ์ƒ ๋ชฉ์ ์ง€์— ๋„์ฐฉํ•  ์ˆ˜ ์žˆ๋Š” ๊ฒฝ์šฐ๋งŒ ์ž…๋ ฅ์œผ๋กœ ์ฃผ์–ด์ง‘๋‹ˆ๋‹ค.

์ž…์ถœ๋ ฅ ์˜ˆ

boardresult

[[0, 0, 0, 1, 1],[0, 0, 0, 1, 0],[0, 1, 0, 1, 1],[1, 1, 0, 0, 1],[0, 0, 0, 0, 0]] 7

์ž…์ถœ๋ ฅ ์˜ˆ์— ๋Œ€ํ•œ ์„ค๋ช…

๋ฌธ์ œ์— ์ฃผ์–ด์ง„ ์˜ˆ์‹œ์™€ ๊ฐ™์Šต๋‹ˆ๋‹ค.
๋กœ๋ด‡์ด ์˜ค๋ฅธ์ชฝ์œผ๋กœ ํ•œ ์นธ ์ด๋™ ํ›„, (1, 3) ์นธ์„ ์ถ•์œผ๋กœ ๋ฐ˜์‹œ๊ณ„ ๋ฐฉํ–ฅ์œผ๋กœ 90๋„ ํšŒ์ „ํ•ฉ๋‹ˆ๋‹ค. ๋‹ค์‹œ, ์•„๋ž˜์ชฝ์œผ๋กœ 3์นธ ์ด๋™ํ•˜๋ฉด ๋กœ๋ด‡์€ (4, 3), (5, 3) ๋‘ ์นธ์„ ์ฐจ์ง€ํ•˜๊ฒŒ ๋ฉ๋‹ˆ๋‹ค. ์ด์ œ (5, 3)์„ ์ถ•์œผ๋กœ ์‹œ๊ณ„ ๋ฐฉํ–ฅ์œผ๋กœ 90๋„ ํšŒ์ „ ํ›„, ์˜ค๋ฅธ์ชฝ์œผ๋กœ ํ•œ ์นธ ์ด๋™ํ•˜๋ฉด (N, N)์— ๋„์ฐฉํ•ฉ๋‹ˆ๋‹ค. ๋”ฐ๋ผ์„œ ๋ชฉ์ ์ง€์— ๋„๋‹ฌํ•˜๊ธฐ๊นŒ์ง€ ์ตœ์†Œ 7์ดˆ๊ฐ€ ๊ฑธ๋ฆฝ๋‹ˆ๋‹ค.

๋ฐ˜์‘ํ˜•
์ €์ž‘์žํ‘œ์‹œ ๋น„์˜๋ฆฌ ๋ณ€๊ฒฝ๊ธˆ์ง€ (์ƒˆ์ฐฝ์—ด๋ฆผ)

'Algorithm Problem > Python' ์นดํ…Œ๊ณ ๋ฆฌ์˜ ๋‹ค๋ฅธ ๊ธ€

[python] ๋ฐฑ์ค€ - 2240. ์ž๋‘๋‚˜๋ฌด  (0) 2020.09.03
[python] ๋ฐฑ์ค€ - 9084. ๋™์ „  (0) 2020.09.02
[python] ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค - ๊ฐ€์‚ฌ ๊ฒ€์ƒ‰(2020 KAKAO BLIND RECRUITMENT)  (0) 2020.08.31
[python] ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค - ๊ฒฝ์ฃผ๋กœ ๊ฑด์„ค (2020 ์นด์นด์˜ค ์ธํ„ด์‹ญ)  (0) 2020.08.30
[python] ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค - ์ž๋ฌผ์‡ ์™€ ์—ด์‡ (2020 KAKAO BLIND RECRUITMENT)  (2) 2020.08.29
    'Algorithm Problem/Python' ์นดํ…Œ๊ณ ๋ฆฌ์˜ ๋‹ค๋ฅธ ๊ธ€
    • [python] ๋ฐฑ์ค€ - 2240. ์ž๋‘๋‚˜๋ฌด
    • [python] ๋ฐฑ์ค€ - 9084. ๋™์ „
    • [python] ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค - ๊ฐ€์‚ฌ ๊ฒ€์ƒ‰(2020 KAKAO BLIND RECRUITMENT)
    • [python] ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค - ๊ฒฝ์ฃผ๋กœ ๊ฑด์„ค (2020 ์นด์นด์˜ค ์ธํ„ด์‹ญ)
    deo2kim
    deo2kim
    ์ฝ”๋”ฉ ๊ธฐ๋กํ•˜๊ธฐ

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