자료구조 Linked_list

==Linked_list(node들이 link된 자료구조이다)==

- Node

class Node: def __init__(self, item): self.val = item self.next = None

- LinkedList = LinkedNode

- Add

def add(self, item): cur = self.head while cur.next is not None: cur = cur.next cur.next = Node(item)

- Print

def printlist(self): cur = self.head while cur is not None: print(cur.val) cur = cur.next

- Remove

def remove(self, item): if self.head.val == item: self.head = self.head.next else: cur = self.head while cur.next is not None: if cur.val == item: self.removeItem(item) return cur = cur.next print("item does not exist in linked list") def removeItem(self, item): cur = self.head while cur.next is not None: if cur.next.val == item: nextnode = cur.next.next cur.next = nextnode break

- 여기 remove 부분 마지막 노드와 중간 부분 node 지울 때 잘못됨..

- 다른 코드 및 해결책 github에 올림

- Reverse

def reverse(self): prev = None cur = self.head while cur is not None: next = cur.next cur.next = prev prev = cur cur = next self.head = prev

source-code : The-G

---

reference : http://interactivepython.org/courselib/static/pythonds/BasicDS/ImplementinganUnorderedListLinkedLists.html

reference : 상상개발자