python抢红包random实现,python 实现红包随机生成算法的简单实例

#! /usr/bin/python

# -*- coding: utf-8 -*-

import random

class CDispatch:

def __init__(self,sum,count):

self.sum = sum

self.count=count

#print 'init here sum =',sum,',count =',count

def __del__(self):

pass

#print 'run del the class'

def getListInfo(self):

listInfo=[] sumMoney = self.sum*100

for num in range(0,self.count):

if(num == self.count -1):

listInfo.append(float('%0.2f'%sumMoney)/100)

break

bigRand=sumMoney+1+num-self.count

#print 'sumMoney=',sumMoney,'num=',num,'self.count=',self.count,'big=',bigRand

try:

a = random.randint(1,int(bigRand))

except:

for i in range(0,num):

print 'listInfo[%d]'%i,'=',listInfo[i] if num >0:

print 'sumMoney=',sumMoney,'num=',num,'listInfo[num-1]=',listInfo[num-1],'self.count=',self.count,'big=',bigRand

#print 'a=',a

break

sumMoney -=a

listInfo.append(float(a)/100)

return listInfo

for i in range(0,100000):

dispatch = CDispatch(1.05,5)

listGet = dispatch.getListInfo()

print listGet

del dispatch

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
以下是一个简单的粒子群算法Python代码实现,用于求解函数最小值问题: ```python import random # 定义目标函数 def objective_function(x): return x**2 # 定义粒子类 class Particle: def __init__(self, dim): self.position = [random.uniform(-5.0, 5.0) for i in range(dim)] self.velocity = [random.uniform(-1.0, 1.0) for i in range(dim)] self.best_position = self.position.copy() self.best_fitness = objective_function(self.position) def update(self, global_best_position, omega, phi_p, phi_g): for i in range(len(self.position)): r_p = random.uniform(0.0, 1.0) r_g = random.uniform(0.0, 1.0) self.velocity[i] = omega * self.velocity[i] + phi_p * r_p * (self.best_position[i] - self.position[i]) + phi_g * r_g * (global_best_position[i] - self.position[i]) self.position[i] += self.velocity[i] fitness = objective_function(self.position) if fitness < self.best_fitness: self.best_position = self.position.copy() self.best_fitness = fitness # 定义粒子群类 class ParticleSwarm: def __init__(self, num_particles, dim, max_iter): self.num_particles = num_particles self.dim = dim self.max_iter = max_iter self.particles = [Particle(dim) for i in range(num_particles)] self.global_best_position = self.particles[0].position.copy() self.global_best_fitness = objective_function(self.global_best_position) def optimize(self, omega, phi_p, phi_g): for i in range(self.max_iter): for particle in self.particles: particle.update(self.global_best_position, omega, phi_p, phi_g) if particle.best_fitness < self.global_best_fitness: self.global_best_position = particle.best_position.copy() self.global_best_fitness = particle.best_fitness print("Iteration {}: Best Fitness = {}".format(i+1, self.global_best_fitness)) # 运行粒子群算法 swarm = ParticleSwarm(num_particles=20, dim=1, max_iter=50) swarm.optimize(omega=0.5, phi_p=0.5, phi_g=0.5) print("Global Best Position = {}, Global Best Fitness = {}".format(swarm.global_best_position, swarm.global_best_fitness)) ```

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值