博客
关于我
数据结构第三天
阅读量:281 次
发布时间:2019-03-01

本文共 3203 字,大约阅读时间需要 10 分钟。

???????????????

????????????????????????????????????????????????????????????????

1. ???????

??????????????????????????????Python???????????????????????Python???????????????????????????????????????????

?????????????????????????????????????????????????????????????????????????????

2. Python???????

?Python?????????????????????????????????

a = 10
b = 20

?????????a?b??????????????????Python?????????????????????????????????????????????????

a, b = b, a

???????????

a, b = 20, 10

????????????????????????????????????????

3. Python?????

??????????????????????????????????????????????

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

4. ??????

????????????????

  • ???????????????????????
  • ????????????????????????????
  • ????????????????????????????

??????????????????????????

5. ????????

?????????????????

  • ????????????????????????????????????????????????
  • ???????????????????????????????????????
  • ????????????????????????????????????
  • ?????????????????????????????????????

    转载地址:http://pkto.baihongyu.com/

    你可能感兴趣的文章
    NOIP模拟测试19
    查看>>
    NOIp模拟赛二十九
    查看>>
    Vue3+element plus+sortablejs实现table列表拖拽
    查看>>
    Nokia5233手机和我装的几个symbian V5手机软件
    查看>>
    non linear processor
    查看>>
    Non-final field ‘code‘ in enum StateEnum‘
    查看>>