"""
class deque:
def __init__(self, s):
self.items = []
def append(self, c):
self.items.append(c)
def appendleft(self, c):
self.items += self.items.append(c)
def pop(self):
try:
return self.items.pop()
except IndexError:
print("empty")
def popleft(self):
try:
return self.items.pop(0)
except IndexError:
print("empty")
def __len__(self):
return len(self.items)
def right(self):
return self.items[-1]
def left(self):
return self.items[0]
def check_palindrome(s):
dq = deque(s)
for i in range(len(s)):
dq.append(s[i])
palindrome = True
while len(dq)> 1:
if dq.popleft() != dq.pop():
palindrome = False
return print(palindrome)
a = input()
check_palindrome(a)
"""
class Node:
def __init__(self, key=None):
self.key = key
self.next = None
def __str__(self):
return str(self.key)
class SinglyLinkedList:
def __init__(self):
self.head = None
self.size = 0
def __len__(self):
return self.size
def printList(self): # 변경없이 사용할 것!
v = self.head
while (v):
print(v.key, "->", end=" ")
v = v.next
print("None")
def pushFront(self, key):
new_node = Node(key)
new_node.next = self.head
self.head = new_node
self.size += 1
def pushBack(self, key):
new_node = Node(key)
if self.size==0:
self.head = new_node
else:
tail = self.head
while tail.next != None:
tail = tail.next
tail.next = new_node
self.size += 1
def popFront(self):
# head 노드의 값 리턴. empty list이면 None 리턴
def popBack(self):
# tail 노드의 값 리턴. empty list이면 None 리턴
def search(self, key):
# key 값을 저장된 노드 리턴. 없으면 None 리턴
def remove(self, x):
# 노드 x를 제거한 후 True리턴. 제거 실패면 False 리턴
def size(self):
return self.size
top of page
실제 작동 상태를 확인하려면 라이브 사이트로 이동하세요.
220127
220127
댓글 0개
좋아요
댓글(0)
bottom of page