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

์ „์ฒด ๊ธ€

(407)
[ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค] ๋ฌธ์ž์—ด์„ ์ •์ˆ˜๋กœ ๋ฐ”๊พธ๊ธฐ def solution(s): return int(s) ์Œ//.. ๋„ˆ๋ฌด์‰ฝ๋‹ค
[ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค] ๋ฌธ์ž์—ด ๋‚ด p์™€ y์˜ ๊ฐœ์ˆ˜ ๋ฌธ์ž์—ด ์•ˆ์— ์žˆ๋Š” p์™€ y์˜ ๊ฐœ์ˆ˜๋ฅผ ๋น„๊ตํ•˜๋Š” ๋ฌธ์ œ์ด๋‹ค. def solution(s): from collections import Counter a = Counter(s) if a['y']+a['Y'] == a['p']+a['P']: return True else: return False counter์„ ์‚ฌ์šฉํ•˜์—ฌ ํ’€์—ˆ๋‹ค! ๊ณต๋ถ€ํ•œ๊ฑธ ์จ๋จน์ž ใ…Žใ…Ž!! ๋‹ค๋ฅธ์‚ฌ๋žŒ ์ฝ”๋“œ def numPY(s): # ํ•จ์ˆ˜๋ฅผ ์™„์„ฑํ•˜์„ธ์š” return s.lower().count('p') == s.lower().count('y') Counter๋กœ ํ‘ผ ์‚ฌ๋žŒ๋“ค๋„ ๋งŽ์•˜๋Š”๋ฐ ,, ์ด๋ถ„์€ count๋กœ ํ‘ธ์…จ๋‹ค. lower์€ ์žˆ์—ˆ๋˜๊ฑธ ์™„์ „ ๊นŒ๋จน๊ณ ์žˆ๋˜ ํ•จ์ˆ˜๋‹คใ… ใ…  ๊ธฐ์–ตํ•˜์ž!! 1. s.count() 2. s.lower()
[ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค] ์ž๋ฆฟ์ˆ˜ ๋”ํ•˜๊ธฐ ๋‚ด ์ฝ”๋“œ ๋ฌธ์ž์—ด๋กœ ๋ฐ”๊พผ๋’ค ๊ฐ ์ž๋ฆฌ์ˆ˜๋ฅผ int๋กœ ๋ฐ”๊พธ์–ด ๋”ํ•ด์คŒ def solution(n): answer = 0 for i in str(n): answer += int(i) return answer ๋‹ค๋ฅธ์‚ฌ๋žŒ ์ฝ”๋“œ def sum_digit(number): return sum([int(i) for i in str(number)]) ๋ฆฌ์ŠคํŠธ๋กœ ๋งŒ๋“ค์–ด sum์„ ์‚ฌ์šฉํ•˜์˜€๋‹ค.
[ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค] ์ฝœ๋ผ์ธ  ์ถ”์ธก ๋‚ด ์ฝ”๋“œ def solution(num): answer = 0 while num!=1: if answer == 500: return -1 num = num//2 if num%2==0 else num*3+1 answer+=1 return answer ๋‹ค๋ฅธ์‚ฌ๋žŒ ์ฝ”๋“œ๋„ ๋‹ค ๋น„์Šทํ•œ๊ฑฐ๊ฐ™๋‹ค~
[ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค] ํ‰๊ท  ๊ตฌํ•˜๊ธฐ ํ‰๊ท ๊ตฌํ•˜๊ธฐ! 1๋‹จ๊ณ„ ์‰ฌ์šด๊ฒƒ๋„ ๊ทธ๋ƒฅ ๋‹ค ํฌ์ŠคํŒ…ํ•˜๊ธฐ๋กœ ๋งˆ์Œ๋จน์–ด์„œ.. ํ•œ์ค„ ์ฝ”๋“œ์ง€๋งŒ.. ๊ทธ๋ƒฅ ์“ด๋‹ค ใ…Žใ…Ž def solution(arr): return sum(arr)/len(arr) ๋‹ค๋ฅธ ์‚ฌ๋žŒ ์ฝ”๋“œ๋„ ๋‚˜๋ž‘ ๊ฐ™๋‹ค. https://programmers.co.kr/learn/courses/30/lessons/12944 ์ฝ”๋”ฉํ…Œ์ŠคํŠธ ์—ฐ์Šต - ํ‰๊ท  ๊ตฌํ•˜๊ธฐ ์ •์ˆ˜๋ฅผ ๋‹ด๊ณ  ์žˆ๋Š” ๋ฐฐ์—ด arr์˜ ํ‰๊ท ๊ฐ’์„ returnํ•˜๋Š” ํ•จ์ˆ˜, solution์„ ์™„์„ฑํ•ด๋ณด์„ธ์š”. ์ œํ•œ์‚ฌํ•ญ arr์€ ๊ธธ์ด 1 ์ด์ƒ, 100 ์ดํ•˜์ธ ๋ฐฐ์—ด์ž…๋‹ˆ๋‹ค. arr์˜ ์›์†Œ๋Š” -10,000 ์ด์ƒ 10,000 ์ดํ•˜์ธ ์ •์ˆ˜์ž…๋‹ˆ๋‹ค. ์ž…์ถœ๋ ฅ ์˜ˆ arr programmers.co.kr
[ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค] ์ฃผ์‹๊ฐ€๊ฒฉ ํ, ์Šคํƒ์˜ ์ฃผ์‹๊ฐ€๊ฒฉ! ์–ด๋ ค์šด ๋ฌธ์ œ๋Š” ์•„๋‹Œ๋ฐ.. ๋ฌธ์ œ ์ดํ•ดํ•˜๋Š”๋ฐ ์‹œ๊ฐ„์ด ์ข€.. ๊ฑธ๋ ธ๋‹ค. ์•ž์—์„œ ํ’€์—ˆ๋˜ ๊ธฐ๋Šฅ๊ฐœ๋ฐœ์ด๋ž‘ ํ”„๋ฆฐํ„ฐ๋ณด๋‹ค ํ›จ ์‰ฌ์šด๊ฑฐ๊ฐ™๋‹ค!! ๊ทผ๋ฐ ํ ์Šคํƒ ๋ฌธ์  ๋ฐ.. ๋‚˜๋Š” ๊ทธ๋ƒฅ ์ด์ค‘ํฌ๋ฌธ์œผ๋กœ ํ’€์—ˆ๋‹ค. ํšจ์œจ์„ฑ ํ…Œ์ŠคํŠธ ํ†ต๊ณผํ•˜๋ฉด ๋œ๊ฑด๊ฐ€?..ใ…Žใ…Ž ๋‚ด ์ฝ”๋“œ def solution(prices): answer = [] for i in range(len(prices)-1): answer.append(0) for j in range(i+1,len(prices)): if prices[i]
[ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค] ํ•˜์ƒค๋“œ ์ˆ˜ ๋‚ด ํ’€์ด def solution(x): from collections import Counter answer = True a = Counter(str(x)) sol=0 for key in a: sol += int(key) * a[key] return True if x%sol==0 else False ์›๋ž˜ ์ •์„์€ while๋ฌธ ๋Œ๋ฆฌ๋Š” ๊ฑด๋ฐ.. Counter์„ ์˜ค๋Š˜ ๋ฐฐ์› ์œผ๋‹ˆ ์จ๋จน์–ด๋ดค๋‹ค!! ๋‹ค๋ฅธ์‚ฌ๋žŒ ํ’€์ด def Harshad(n): return n % sum([int(c) for c in str(n)]) == 0 ์™€.. ํ•œ์ค„๋งŒ์— ๊ฐ€๋Šฅํ•˜๋‹ค๋‹ˆ.... ์‹ ๊ธฐํ•˜๋‹ค... str๋กœ ๋ฐ”๊ฟ”์„œ ํ•˜๋‚˜ํ•˜๋‚˜ ๋ถ„๋ฆฌํ•˜๊ณ  list๋กœ ๋งŒ๋“ค์–ด์ค€๊ฑธ ํ•ฉ์„ ๊ตฌํ•œ๋‹ค!!
[ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค] ํ•ธ๋“œํฐ ๋ฒˆํ˜ธ ๊ฐ€๋ฆฌ๊ธฐ ๋‚ด ์ฝ”๋“œ def solution(phone_number): return "*"*(len(phone_number)-4) + phone_number[-4:] ์ฒ˜์Œ์œผ๋กœ ํ•œ์ค„๋กœ ํ‘ผ๋“ฏ?!? ์˜ค ๋‹ค๋ฅธ์‚ฌ๋žŒ ์ฝ”๋“œ๋„ ๋‚ด์ฝ”๋“œ๋ž‘ ๋˜‘๊ฐ™๋‹ค ใ…Žใ…Ž!!!