<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[知秋的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/qq_37471920</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; qq_37471920]]></copyright><item><title><![CDATA[【Python】三数之和]]></title><link>https://blog.youkuaiyun.com/qq_37471920/article/details/127564271</link><guid>https://blog.youkuaiyun.com/qq_37471920/article/details/127564271</guid><author>qq_37471920</author><pubDate>Fri, 28 Oct 2022 04:17:45 +0800</pubDate><description><![CDATA[给你一个整数数组 nums ，判断是否存在三元组 [nums[i], nums[j], nums[k]] 满足 i!= j、i!= k 且 j!= k ，同时还满足 nums[i] + nums[j] + nums[k] == 0。请你返回所有和为 0 且不重复的三元组。注意：答案中不可以包含重复的三元组。题目地址： https://leetcode.cn/problems/3sum/]]></description><category></category></item><item><title><![CDATA[[C++] 冒泡排序]]></title><link>https://blog.youkuaiyun.com/qq_37471920/article/details/127563192</link><guid>https://blog.youkuaiyun.com/qq_37471920/article/details/127563192</guid><author>qq_37471920</author><pubDate>Thu, 27 Oct 2022 23:45:04 +0800</pubDate><description><![CDATA[冒泡排序]]></description><category></category></item><item><title><![CDATA[[C++] 快速排序 (递归)]]></title><link>https://blog.youkuaiyun.com/qq_37471920/article/details/127562973</link><guid>https://blog.youkuaiyun.com/qq_37471920/article/details/127562973</guid><author>qq_37471920</author><pubDate>Thu, 27 Oct 2022 23:31:50 +0800</pubDate><description><![CDATA[C++ 实现快速排序算法]]></description><category></category></item><item><title><![CDATA[【paddlepaddle】鸢尾花分类]]></title><link>https://blog.youkuaiyun.com/qq_37471920/article/details/126258202</link><guid>https://blog.youkuaiyun.com/qq_37471920/article/details/126258202</guid><author>qq_37471920</author><pubDate>Wed, 10 Aug 2022 00:23:42 +0800</pubDate><description><![CDATA[利用 paddlepaddle 对鸢尾花数据集进行分类]]></description><category></category></item><item><title><![CDATA[[Matlab] 二进制蝙蝠算法用于解决背包问题]]></title><link>https://blog.youkuaiyun.com/qq_37471920/article/details/115678433</link><guid>https://blog.youkuaiyun.com/qq_37471920/article/details/115678433</guid><author>qq_37471920</author><pubDate>Tue, 13 Apr 2021 20:53:57 +0800</pubDate><description><![CDATA[二进制蝙蝠算法用于解决背包问题算法流程背包问题Matlab 代码目标函数仿真结果参考文献
算法流程

背包问题

参考[Matlab] 离散二进制粒子群算法（BPSO ）解决背包问题

Matlab 代码
%% 二进制蝙蝠算法

%初始化种群
r = 0.7;
narvs = 10; %问题的维度
n = 100;
dim = narvs;
maxgen = 100;
populationSize = 100;

Qmin=0;         % Frequency minimum 频率最小值
Qmax=]]></description><category></category></item><item><title><![CDATA[利用 一种二进制编码的量子粒子群优化算法（BQPSO）解决背包问题 [Matlab]]]></title><link>https://blog.youkuaiyun.com/qq_37471920/article/details/112691197</link><guid>https://blog.youkuaiyun.com/qq_37471920/article/details/112691197</guid><author>qq_37471920</author><pubDate>Sat, 16 Jan 2021 02:10:49 +0800</pubDate><description><![CDATA[文章目录思路即适应度函数的设计Matlab 代码图像
思路即适应度函数的设计
参考：[Matlab] 离散二进制粒子群算法（BPSO ）解决背包问题
Matlab 代码
%% BQPSO 解决背包问题 
%% 想法：解决十进制问题时需要将十进制的参数转化为二进制，二进制则可理解为粒子群中的粒子仅有一维
clc
clear
%% 创建初始种群
l = 40; % 粒子的个数
d = 10; % 维数
initPop = randsrc(l,d,[1 0;0.5 0.5]);
x = initPop;
beta]]></description><category></category></item><item><title><![CDATA[[Matlab] 离散二进制粒子群算法（BPSO ）解决背包问题]]></title><link>https://blog.youkuaiyun.com/qq_37471920/article/details/112361365</link><guid>https://blog.youkuaiyun.com/qq_37471920/article/details/112361365</guid><author>qq_37471920</author><pubDate>Fri, 08 Jan 2021 15:06:28 +0800</pubDate><description><![CDATA[[Matlab]离散二进制粒子群算法（BPSO ）解决背包问题什么是离散二进制粒子群算法（BPSO ）描述离散二进制粒子群算法（BPSO ）步骤背包问题描述解决思路函数设计targetPackage.mpsoForBackpack.m图像
什么是离散二进制粒子群算法（BPSO ）
文章参考： 【PSO】离散粒子群算法（DPSO）和离散二进制粒子群算法（BPSO ）
描述

离散二进制粒子群算法（Discrete Binary Particle Swarm Optimization Algorithm， BP]]></description><category></category></item><item><title><![CDATA[树莓派 开机启动 获取IP地址 发送至指定邮箱]]></title><link>https://blog.youkuaiyun.com/qq_37471920/article/details/104930533</link><guid>https://blog.youkuaiyun.com/qq_37471920/article/details/104930533</guid><author>qq_37471920</author><pubDate>Tue, 17 Mar 2020 20:42:36 +0800</pubDate><description><![CDATA[树莓派 开机启动 获取IP地址 发送至指定邮箱
1、先编写 获取IP地址并发送邮件的 python 程序
mail.py
import os
import smtplib
from email.mime.text import MIMEText
from email.mime.multipart import MIMEMultipart
from email.header import Heade...]]></description><category></category></item><item><title><![CDATA[【PyQt】点击一个窗口的按钮来打开另一个窗口]]></title><link>https://blog.youkuaiyun.com/qq_37471920/article/details/104103179</link><guid>https://blog.youkuaiyun.com/qq_37471920/article/details/104103179</guid><author>qq_37471920</author><pubDate>Tue, 28 Jan 2020 22:56:12 +0800</pubDate><description><![CDATA[先在qt designer 中设计好两个窗口（main和second）如图
在vscode 中将 相应的ui 文件 编译成python文件

修改 UI_main.py 为main窗口中的按钮添加点击事件
UI_main.py
from PyQt5 import QtCore, QtGui, QtWidgets
from Ui_second import Ui_Form


class Ui_Ma...]]></description><category></category></item><item><title><![CDATA[AVL树的构造过程]]></title><link>https://blog.youkuaiyun.com/qq_37471920/article/details/103583447</link><guid>https://blog.youkuaiyun.com/qq_37471920/article/details/103583447</guid><author>qq_37471920</author><pubDate>Tue, 17 Dec 2019 16:53:47 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[$$ 计算 \iint_{D}e^{-x^2-y^2}dxdy ,其中D是由圆心在原点，半径为a的圆周所围成的闭区域 $$]]></title><link>https://blog.youkuaiyun.com/qq_37471920/article/details/101113831</link><guid>https://blog.youkuaiyun.com/qq_37471920/article/details/101113831</guid><author>qq_37471920</author><pubDate>Sat, 21 Sep 2019 19:18:54 +0800</pubDate><description><![CDATA[安心撒

]]></description><category></category></item><item><title><![CDATA[优快云 代码不能语法高亮]]></title><link>https://blog.youkuaiyun.com/qq_37471920/article/details/100556058</link><guid>https://blog.youkuaiyun.com/qq_37471920/article/details/100556058</guid><author>qq_37471920</author><pubDate>Thu, 05 Sep 2019 13:16:17 +0800</pubDate><description><![CDATA[标题名称大写时语法不高亮

标题名称小写时语法高亮

]]></description><category></category></item><item><title><![CDATA[顺序栈--括号匹配的检验]]></title><link>https://blog.youkuaiyun.com/qq_37471920/article/details/83013452</link><guid>https://blog.youkuaiyun.com/qq_37471920/article/details/83013452</guid><author>qq_37471920</author><pubDate>Thu, 11 Oct 2018 15:40:31 +0800</pubDate><description><![CDATA[#include &amp;lt;stdio.h&amp;gt;
#include &amp;lt;stdlib.h&amp;gt;

#define MAXSIZE 100

typedef struct
{
    char * top;
    char * base;
}SqStack;

//栈的初始化
void  InitStack(SqStack &amp;amp;s)
{
    s.base=(char*)malloc...]]></description><category></category></item><item><title><![CDATA[顺序栈实现十进制转八进制]]></title><link>https://blog.youkuaiyun.com/qq_37471920/article/details/82995330</link><guid>https://blog.youkuaiyun.com/qq_37471920/article/details/82995330</guid><author>qq_37471920</author><pubDate>Wed, 10 Oct 2018 12:45:43 +0800</pubDate><description><![CDATA[#include&amp;lt;stdio.h&amp;gt;
#include&amp;lt;stdlib.h&amp;gt;

#define MAXSIZE 100

typedef struct
{
    int* base; //栈底指针
    int* top;  //栈顶指针
    int maxsize; //栈的最大容量
}SqStack;

//栈的初始化
void InitStack(SqStack ...]]></description><category></category></item><item><title><![CDATA[链队—队列的链式表示和实现]]></title><link>https://blog.youkuaiyun.com/qq_37471920/article/details/82987692</link><guid>https://blog.youkuaiyun.com/qq_37471920/article/details/82987692</guid><author>qq_37471920</author><pubDate>Tue, 09 Oct 2018 19:54:07 +0800</pubDate><description><![CDATA[#include&amp;lt;stdio.h&amp;gt;
#include&amp;lt;stdlib.h&amp;gt;
#include&amp;lt;stdbool.h&amp;gt;

typedef struct QNode
{
    int data;
    struct QNode * next;
}QNode, *QueuePtr;

typedef struct
{
    QueuePtr front;      ...]]></description><category></category></item></channel></rss>