数据结构小练习
数据结构方面的小练习
Marpylili
这个作者很懒,什么都没留下…
展开
-
python-优先序列的部分功能的实现(链式)
class PriorityNode: def __init__(self, data=None, priority=None, next=None): self.data = data self.priority = priority self.next = next class PriorityQueue: def __init__(self): self.front = None self.rear =原创 2021-03-28 16:26:45 · 85 阅读 · 0 评论 -
Python-顺序队列的部分功能的实现
class SqQueue(): def __init__(self, maxSize): self.maxSize = maxSize self.queueSlem = [None] * self.maxSize self.front = 0 self.rear = 0 def isEmpty(self): return self.rear == self.front def offer(self,原创 2021-03-26 11:43:51 · 96 阅读 · 0 评论 -
Python-顺序栈部分功能的实现和一个小练习
class SqStack: def __init__(self, maxSize): self.maxSize = maxSize self.stackElem = [None] * self.maxSize self.top = 0 def isEmpty(self): return self.top == 0 def push(self, x): if self.top == self.maxS原创 2021-03-25 21:16:08 · 98 阅读 · 0 评论 -
python反转单向链表——迭代法
class Node: def __init__(self, x): self.val = x self.next = None def reverseList(head): prev = None while head: curr = head head = head.next curr.next = prev prev = curr return prev if __n原创 2021-03-24 13:08:13 · 97 阅读 · 0 评论 -
双指针法的小练习
题目内容: 输入一组数,如 1,2,3,4,5 输出一个数组,前部分全是偶数,后部分全是奇数。如 2,4,1,3 ,5 4,2,3,1 ,5 等等满足条件的均可。 a = [int(x) for x in input().split()] i = 0 j = len(a) - 1 while i < j: while (i < j and a[i] % 2 == 0): i = i + 1 while (i < j and a[j] % 2 == 1):原创 2021-03-23 22:02:37 · 60 阅读 · 0 评论