ํƒ์š•๋ฒ• 2

[ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค/Python] Lv 2. ํฐ ์ˆ˜ ๋งŒ๋“ค๊ธฐ

โญ ๋ฌธ์ œ ๋งํฌ https://school.programmers.co.kr/learn/courses/30/lessons/42883 ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค ์ฝ”๋“œ ์ค‘์‹ฌ์˜ ๊ฐœ๋ฐœ์ž ์ฑ„์šฉ. ์Šคํƒ ๊ธฐ๋ฐ˜์˜ ํฌ์ง€์…˜ ๋งค์นญ. ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค์˜ ๊ฐœ๋ฐœ์ž ๋งž์ถคํ˜• ํ”„๋กœํ•„์„ ๋“ฑ๋กํ•˜๊ณ , ๋‚˜์™€ ๊ธฐ์ˆ  ๊ถํ•ฉ์ด ์ž˜ ๋งž๋Š” ๊ธฐ์—…๋“ค์„ ๋งค์นญ ๋ฐ›์œผ์„ธ์š”. programmers.co.kr โญ ํ’€์ด ์ฝ”๋“œ # ํƒ์š•๋ฒ• def solution(number, k): answer = '' stack = [] for n in number: while stack and (stack[-1] 0): stack.pop() k -= 1 stack.append(n) # [4] - [4,1] - [4] - [] - [7] - [7,7] - [7,7,2] # - [7,..

Python/Programmers 2023.04.23

[ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค/Python] Lv 1. ์ฒด์œก๋ณต

โญ ๋ฌธ์ œ ๋งํฌ https://school.programmers.co.kr/learn/courses/30/lessons/42862 ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค ์ฝ”๋“œ ์ค‘์‹ฌ์˜ ๊ฐœ๋ฐœ์ž ์ฑ„์šฉ. ์Šคํƒ ๊ธฐ๋ฐ˜์˜ ํฌ์ง€์…˜ ๋งค์นญ. ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค์˜ ๊ฐœ๋ฐœ์ž ๋งž์ถคํ˜• ํ”„๋กœํ•„์„ ๋“ฑ๋กํ•˜๊ณ , ๋‚˜์™€ ๊ธฐ์ˆ  ๊ถํ•ฉ์ด ์ž˜ ๋งž๋Š” ๊ธฐ์—…๋“ค์„ ๋งค์นญ ๋ฐ›์œผ์„ธ์š”. programmers.co.kr โญ ํ’€์ด ์ฝ”๋“œ def solution(n, lost, reserve): answer = 0 # ์—ฌ๋ฒŒ์˜ท ์—†๋Š” lost real_lost = set(lost) - set(reserve) # ๋„๋‚œ๋‹นํ•˜์ง€ ์•Š์€ reserve real_reserve = set(reserve) - set(lost) for r in real_reserve: if r-1 in real_lost: # ์•ž real_l..

Python/Programmers 2023.04.17