20 Sun

์‹œ์ € ์•”ํ˜ธ

'''
https://programmers.co.kr/learn/courses/30/lessons/12926
์‹œ์ € ์•”ํ˜ธ
[ํ’€์ด]
1. ์•ŒํŒŒ๋ฒณ ๋ฆฌ์ŠคํŠธ๋ฅผ ์‚ฌ์ „์— ๊ตฌ์„ฑ
'''
def solution(s, n):
    U = [chr(i) for i in range(65, 91)]
    L = [chr(i) for i in range(97, 123)]
    answer = ''
    for i in s:
        if i in U : answer += U[(U.index(i)+n)%26]
        elif i in L : answer += L[(L.index(i)+n)%26]
        else : answer += i
    return answer
'''
๋ฌธ์ž์—ด์—๋Š” isupper์™€ islower๊ฐ€ ์žˆ์Œ
if s[i].isupper():
    s[i]=chr((ord(s[i])-ord('A')+ n)%26+ord('A'))
elif s[i].islower():
    s[i]=chr((ord(s[i])-ord('a')+ n)%26+ord('a'))
'''

Last updated

Was this helpful?