本文共 3126 字，大约阅读时间需要 10 分钟。
????????????????????????????????????????????????????????????????
??????????????????????????????Python???????????????????????Python???????????????????????????????????????????
?????????????????????????????????????????????????????????????????????????????
?Python?????????????????????????????????
a = 10b = 20
?????????a?b??????????????????Python?????????????????????????????????????????????????
a, b = b, a
???????????
a, b = 20, 10
????????????????????????????????????????
??????????????????????????????????????????????
class Node(object): """???""" def __init__(self, elem): self.elem = elem self.next = None
???????????
is_empty()??????????length()????????travel()??????add(item)?????????append(item)?????????insert(pos, item)???????????remove(item)????????search(item)?????????????????????
class SingleLinkList(object): """????""" def __init__(self, node=None): self.__head = node # ???? def is_empty(self): """????????""" return self.__head is None def length(self): """??????""" count = 0 cur = self.__head while cur is not None: count += 1 cur = cur.next return count def travel(self): """???????????""" cur = self.__head while cur is not None: print(cur.elem, end=" ") cur = cur.next print() def add(self, item): """??????????""" node = Node(item) node.next = self.__head self.__head = node def append(self, item): """??????????""" node = Node(item) if self.is_empty(): self.__head = node else: cur = self.__head while cur.next is not None: cur = cur.next cur.next = node def insert(self, pos, item): """??????????""" if pos <= 0: self.add(item) elif pos >= self.length(): self.append(item) else: pre = self.__head count = 0 while count < pos - 1: pre = pre.next count += 1 node = Node(item) node.next = pre.next pre.next = node def remove(self, item): """??????""" cur = self.__head pre = None while cur is not None: if cur.elem == item: if pre is None: self.__head = cur.next else: pre.next = cur.next break pre = cur cur = cur.next def search(self, item): """????????""" cur = self.__head while cur is not None: if cur.elem == item: return True cur = cur.next return False
????????????????
??????????????????????????
?????????????????
?????????????????????????????????????
转载地址：http://pkto.baihongyu.com/