1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
|
#!/bin/python3
import math
import os
import random
import re
import sys
class SinglyLinkedListNode:
def __init__(self, node_data):
self.data = node_data
self.next = None
class SinglyLinkedList:
def __init__(self):
self.head = None
self.tail = None
def insert_node(self, node_data):
node = SinglyLinkedListNode(node_data)
if not self.head:
self.head = node
else:
self.tail.next = node
self.tail = node
# Complete the printLinkedList function below.
#
# For your reference:
#
# SinglyLinkedListNode:
# int data
# SinglyLinkedListNode next
#
#
def printLinkedList(head):
temp= head
while temp.next!=None:
print(temp.data)
temp=temp.next
print(temp.data)
if __name__ == '__main__':
llist_count = int(input())
llist = SinglyLinkedList()
for _ in range(llist_count):
llist_item = int(input())
llist.insert_node(llist_item)
printLinkedList(llist.head)
|
cs |
반응형
'python-algorithm' 카테고리의 다른 글
2167 2차원 배열의 합 (0) | 2021.11.12 |
---|---|
백준 2738 행렬 덧셈 (0) | 2021.11.12 |
백준 2745 진법 변환 (0) | 2021.11.02 |
백준 2495 연속구간 (0) | 2021.11.02 |
백준 1371 가장 많은 글자 (0) | 2021.11.02 |
댓글