Deployed 2634b20 with MkDocs version: 0.17.4

Author: PegasusWang

.DS_Store

@@ -29,7 +29,7 @@ def tailnode(self):
         return self.root.prev
 
     def append(self, value):    # O(1), 你发现一般不用 for 循环的就是 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=value)
         tailnode = self.tailnode() or self.root
@@ -41,7 +41,7 @@ def append(self, value):    # O(1), 你发现一般不用 for 循环的就是 O(
         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')
         node = Node(value=value)
         if self.root.next is self.root:   # empty