Baekjoon 1259번 팰린드롬수

문제

https://www.acmicpc.net/problem/1259

걸린 시간

00 : 19 : 01

풀이

Python3

if __name__ == "__main__":
    result = []
    while True:
        num = input()
        if num == '0':
            break

        lnum = []
        rnum = []
        left = 0
        right = len(num)-1
        mid = (left + right) // 2

        if len(num) % 2 == 0:
            for i in range(0, mid+1):
                lnum.append(num[i])    

            for i in range(mid+1, right+1):
                rnum.append(num[i])    
        else:
            for i in range(0, mid):
                lnum.append(num[i])    

            for i in range(mid+1, right+1):
                rnum.append(num[i])

        rnum.reverse()

        flag = True # True : 펠린드롬수 
        for i in range(0, len(lnum)):
            if lnum[i] != rnum[i]:
                flag = False

        if flag == True:
            result.append("yes")
        else:
            result.append("no")

    for i in result:
        print(i)