weixin_40245436的博客

用两个栈实现队列，支持队列的基本操作。 最近想练练python import sys class Soul(object): def __init__(self): self.l1=[] self.l2=[] def add(self,x): self.l1.append((x)) def peek(self): ...

单调栈这个概念挺有意思 from collections import deque def tomaxare(rec): stack=[] res=0 for i,n in enumerate(rec): while stack and rec[i]<=rec[stack[-1]]: temp=rec[sta...

学会　deque from collections import deque def soul(nums,k): d=deque(maxlen=k) res=list() for i,n in enumerate(nums): if i<k-1: if i==0: ...

冒泡思想　还是比较简单的 def soul(nums): help=list() help.append(nums.pop()) while len(nums)!=0: cur=nums.pop() if cur<=help[-1]: help.append(cur) el...

动态规划　很简单 def soul(nums,a): if a<nums[0]: return -1 l=len(nums) rec=[-1]*(a+1) rec[0]=0 for i in range(1,a+1): temp1=-1 rec[i] = float("inf...

def merge(nums ,l ,r ,mids): if l== r: return 0 temp = [0] * (r - l + 1) l1 = l r1 = mids + 1 i = 0 res = 0 while l1 <= mids and r1 <= r: if nums[l1...

def go(dir_r,k,n): l=0 r=0 res=[] temp=0 test=1 while l<k or r<k: if (len(res))%n==0: test = 1 while l<k: if dir_r[l]=='P': ...

from collections import deque def go(nums,num): rec=[1]+[0]*num for n in nums: for i in range(n,num+1): rec[i]=rec[i]+rec[i-n] retur...

这个用数组检验很巧妙 def soul(k,nums): l=0 sums=0 rec=0 temp=0 dir_s={0:-1} for i in range(len(nums)): sums+=nums[i] if sums not in dir_s: dir_s[...

python 自定义优先队列 优先队列内部默认实现的是小根堆，具有的操作主要有： 向队列中添加元素 Queue.put(obj)，每添加一个元素优先队列内部就会进行调整成最小堆； 从队列中获取元素 Queue.get()，每取出一个元素队列内部就会进行调整； 队列判空 Queue.empty() 队列大小 Queue.qsize() 队列存储的元素是数字： >>&gt...

通过这个题可以清楚的理解递归！ import sys def dellast(nums): re=nums.pop() if not nums: return re else: i=dellast(nums) nums.append(re) return i def revers...

动态规划＋空间压缩 def go(n,m,p,k): rec=[0]*(n+1) rec[p]=1 for i in range(k): last = rec[1] for j in range(n): temp=rec[j] if j==1: ...