๋ณธ๋ฌธ ๋ฐ”๋กœ๊ฐ€๊ธฐ

Python

(2)
[Python] ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค - ๊ด„ํ˜ธ ํšŒ์ „ํ•˜๊ธฐ ๋ฌธ์ œ https://programmers.co.kr/learn/courses/30/lessons/76502 ์ฝ”๋”ฉํ…Œ์ŠคํŠธ ์—ฐ์Šต - ๊ด„ํ˜ธ ํšŒ์ „ํ•˜๊ธฐ programmers.co.kr ํ’€์ด from collections import deque def solution(s): cnt=0 for x in range(len(s)): s = deque(s) s.rotate(-1) ss = ''.join(s) while '[]' in ss or '{}' in ss or '()' in ss: ss = ss.replace('[]','').replace('{}','').replace('()','') if not ss : cnt+=1 return cnt replace๋ฅผ ์‚ฌ์šฉํ•ด์„œ ํ’€์—ˆ๋‹ค. ๊ด„ํ˜ธ ๋ฌธ์ œ์˜ ์ •์„์€ stack์ด์ง€๋งŒ.. ํ•œ๋ฒˆ ..
[Python] ๋ฐฑ์ค€ 14719 - ๋น—๋ฌผ https://www.acmicpc.net/problem/14719 14719๋ฒˆ: ๋น—๋ฌผ ์ฒซ ๋ฒˆ์งธ ์ค„์—๋Š” 2์ฐจ์› ์„ธ๊ณ„์˜ ์„ธ๋กœ ๊ธธ์ด H๊ณผ 2์ฐจ์› ์„ธ๊ณ„์˜ ๊ฐ€๋กœ ๊ธธ์ด W๊ฐ€ ์ฃผ์–ด์ง„๋‹ค. (1 ≤ H, W ≤ 500) ๋‘ ๋ฒˆ์งธ ์ค„์—๋Š” ๋ธ”๋ก์ด ์Œ“์ธ ๋†’์ด๋ฅผ ์˜๋ฏธํ•˜๋Š” 0์ด์ƒ H์ดํ•˜์˜ ์ •์ˆ˜๊ฐ€ 2์ฐจ์› ์„ธ๊ณ„์˜ ๋งจ ์™ผ์ชฝ ์œ„์น˜ www.acmicpc.net ๋‚ด ์ฝ”๋“œ h,w = input().split() h,w = int(h),int(w) x = input().split() x = [h - int(i) for i in x] arr = [[0 for i in range(w)]for j in range(h)] for i in range(h): for j in range(w): if x[j] =2: for j in range(arr[i]..