n = 1
s = 'AB'
if i is ' '
add i to answer
for i in AB
1) if 65<=number(A) >=65:
if number(A) > 65: (= >=Z)
back to number(A)
elif:
number(A) + n
def solution(s,n):
answer = ''
for i in s:
cha = ord(i) + n
if 65 <= ord(i) <= 90:
if cha > 90:
answer += chr(cha-26)
else:
answer += chr(cha)
elif 97 <= ord(i) <= 122:
if cha > 122:
answer += chr(cha-26)
else:
answer += chr(cha)
if i == ' ':
answer += ' '
return answer
📌
def caesar(s, n):
s = list(s)
for i in range(len(s)):
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'))
return "".join(s)
📌