复修 链表判断是否达到最大 size 的问题

#10

Author: PegasusWang

docs/03_链表/linked_list.py

@@ -31,7 +31,7 @@ def __len__(self):
         return self.length
 
     def append(self, value):    # O(1)
-        if self.maxsize is not None and len(self) > self.maxsize:
+        if self.maxsize is not None and len(self) >= self.maxsize:
             raise Exception('LinkedList is Full')
         node = Node(value)    # 构造节点
         tailnode = self.tailnode
@@ -43,7 +43,7 @@ def append(self, value):    # O(1)
         self.length += 1
 
     def appendleft(self, value):
-        if self.maxsize is not None and len(self) > self.maxsize:
+        if self.maxsize is not None and len(self) >= self.maxsize:
             raise Exception('LinkedList is Full')
         headnode = self.root.next
         node = Node(value)