python計(jì)算最小優(yōu)先級(jí)隊(duì)列代碼分享
# -*- coding: utf-8 -*-
class Heap(object):
@classmethod
def parent(cls, i):
"""父結(jié)點(diǎn)下標(biāo)"""
return int((i - 1) >> 1);
@classmethod
def left(cls, i):
"""左兒子下標(biāo)"""
return (i << 1) + 1;
@classmethod
def right(cls, i):
"""右兒子下標(biāo)"""
return (i << 1) + 2;
class MinPriorityQueue(list, Heap):
@classmethod
def min_heapify(cls, A, i, heap_size):
"""最小堆化A[i]為根的子樹(shù)"""
l, r = cls.left(i), cls.right(i)
if l < heap_size and A[l] < A[i]:
least = l
else:
least = i
if r < heap_size and A[r] < A[least]:
least = r
if least != i:
A[i], A[least] = A[least], A[i]
cls.min_heapify(A, least, heap_size)
def minimum(self):
"""返回最小元素,偽碼如下:
HEAP-MINIMUM(A)
1 return A[1]
T(n) = O(1)
"""
return self[0]
def extract_min(self):
"""去除并返回最小元素,偽碼如下:
HEAP-EXTRACT-MIN(A)
1 if heap-size[A] < 1
2 then error "heap underflow"
3 min ← A[1]
4 A[1] ← A[heap-size[A]] // 尾元素放到第一位
5 heap-size[A] ← heap-size[A] - 1 // 減小heap-size[A]
6 MIN-HEAPIFY(A, 1) // 保持最小堆性質(zhì)
7 return min
T(n) = θ(lgn)
"""
heap_size = len(self)
assert heap_size > 0, "heap underflow"
val = self[0]
tail = heap_size - 1
self[0] = self[tail]
self.min_heapify(self, 0, tail)
self.pop(tail)
return val
def decrease_key(self, i, key):
"""將i處的值減少到key,偽碼如下:
HEAP-DECREASE-KEY(A, i, key)
1 if key > A[i]
2 then error "new key is larger than current key"
3 A[i] ← key
4 while i > 1 and A[PARENT(i)] > A[i] // 不是根結(jié)點(diǎn)且父結(jié)點(diǎn)更大時(shí)
5 do exchange A[i] ↔ A[PARENT(i)] // 交換兩元素
6 i ← PARENT(i) // 指向父結(jié)點(diǎn)位置
T(n) = θ(lgn)
"""
val = self[i]
assert key <= val, "new key is larger than current key"
self[i] = key
parent = self.parent
while i > 0 and self[parent(i)] > self[i]:
self[i], self[parent(i)] = self[parent(i)], self[i]
i = parent(i)
def insert(self, key):
"""將key插入A,偽碼如下:
MIN-HEAP-INSERT(A, key)
1 heap-size[A] ← heap-size[A] + 1 // 對(duì)元素個(gè)數(shù)增加
2 A[heap-size[A]] ← +∞ // 初始新增加元素為+∞
3 HEAP-DECREASE-KEY(A, heap-size[A], key) // 將新增元素減少到key
T(n) = θ(lgn)
"""
self.append(float('inf'))
self.decrease_key(len(self) - 1, key)
if __name__ == '__main__':
import random
keys = range(10)
random.shuffle(keys)
print(keys)
queue = MinPriorityQueue() # 插入方式建最小堆
for i in keys:
queue.insert(i)
print(queue)
print('*' * 30)
for i in range(len(queue)):
val = i % 3
if val == 0:
val = queue.extract_min() # 去除并返回最小元素
elif val == 1:
val = queue.minimum() # 返回最小元素
else:
val = queue[1] - 10
queue.decrease_key(1, val) # queue[1]減少10
print(queue, val)
print([queue.extract_min() for i in range(len(queue))])
- Python中棧、隊(duì)列與優(yōu)先級(jí)隊(duì)列的實(shí)現(xiàn)方法
- Python利用heapq實(shí)現(xiàn)一個(gè)優(yōu)先級(jí)隊(duì)列的方法
- Python cookbook(數(shù)據(jù)結(jié)構(gòu)與算法)實(shí)現(xiàn)優(yōu)先級(jí)隊(duì)列的方法示例
- Python實(shí)現(xiàn)優(yōu)先級(jí)隊(duì)列結(jié)構(gòu)的方法詳解
- python計(jì)算最大優(yōu)先級(jí)隊(duì)列實(shí)例
- Python實(shí)現(xiàn)一個(gè)優(yōu)先級(jí)隊(duì)列的方法
相關(guān)文章
python實(shí)現(xiàn)多進(jìn)程代碼示例
Python中大部分情況下都需要使用多進(jìn)程,Python中提供了multiprocessing這個(gè)包實(shí)現(xiàn)多進(jìn)程。multiprocessing支持子進(jìn)程、進(jìn)程間的同步與通信,本文就詳細(xì)的介紹一下2018-10-10徹底弄懂Python中的回調(diào)函數(shù)(callback)
回調(diào)函數(shù)就是一個(gè)通過(guò)函數(shù)指針調(diào)用的函數(shù),下面這篇文章主要給大家介紹了關(guān)于Python中回調(diào)函數(shù)(callback)的相關(guān)資料,文中通過(guò)實(shí)例代碼介紹的非常詳細(xì),需要的朋友可以參考下2022-06-06Python作用域(局部?全局)及global關(guān)鍵字使用詳解
這篇文章主要為大家介紹了Python作用域(局部?全局)及global關(guān)鍵字使用詳解,有需要的朋友可以借鑒參考下,希望能夠有所幫助,祝大家多多進(jìn)步,早日升職加薪2023-10-10Python OpenCV機(jī)器學(xué)習(xí)之圖像識(shí)別詳解
OpenCV中也提供了一些機(jī)器學(xué)習(xí)的方法,例如DNN等。本文將為大家詳細(xì)介紹一下OpenCV中利用機(jī)器學(xué)習(xí)實(shí)現(xiàn)的一些圖片識(shí)別功能:人臉識(shí)別、車牌識(shí)別等,感興趣的可以了解一下2022-01-01如何通過(guò)Python實(shí)現(xiàn)RabbitMQ延遲隊(duì)列
這篇文章主要介紹了如何通過(guò)Python實(shí)現(xiàn)RabbitMQ延遲隊(duì)列,文中通過(guò)示例代碼介紹的非常詳細(xì),對(duì)大家的學(xué)習(xí)或者工作具有一定的參考學(xué)習(xí)價(jià)值,需要的朋友可以參考下2020-11-11