๋ชฉ๋ก์ตœ์†Œ๊ณต๋ฐฐ์ˆ˜ (1)

๐ŸŒฑ โ†’ ๐ŸŒณ

[ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค] N๊ฐœ์˜ ์ตœ์†Œ๊ณต๋ฐฐ์ˆ˜ - Python

https://school.programmers.co.kr/learn/courses/30/lessons/12953 ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค ์ฝ”๋“œ ์ค‘์‹ฌ์˜ ๊ฐœ๋ฐœ์ž ์ฑ„์šฉ. ์Šคํƒ ๊ธฐ๋ฐ˜์˜ ํฌ์ง€์…˜ ๋งค์นญ. ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค์˜ ๊ฐœ๋ฐœ์ž ๋งž์ถคํ˜• ํ”„๋กœํ•„์„ ๋“ฑ๋กํ•˜๊ณ , ๋‚˜์™€ ๊ธฐ์ˆ  ๊ถํ•ฉ์ด ์ž˜ ๋งž๋Š” ๊ธฐ์—…๋“ค์„ ๋งค์นญ ๋ฐ›์œผ์„ธ์š”. programmers.co.kr ์‚ฌ์ „ ์ง€์‹ python์—์„œ ์ตœ๋Œ€๊ณต์•ฝ์ˆ˜, ์ตœ์†Œ๊ณต๋ฐฐ์ˆ˜ ๊ตฌํ•˜๋Š” ๋ฐฉ๋ฒ• - a,b์˜ ์ตœ๋Œ€๊ณต์•ฝ์ˆ˜ : math.gcd(a,b) - a,b์˜ ์ตœ์†Œ๊ณต๋ฐฐ์ˆ˜ : a*b/math.gcd(a,b) ์ฝ”๋“œ ๋‚ด ์ฝ”๋“œ(์ •๋‹ต) from math import gcd def solution(arr): stack = [] for i in arr: if not stack: stack.append(i) else: a = stack.pop..
Algorithms 2023. 8. 13. 12:22
์ด์ „ Prev 1 Next ๋‹ค์Œ