<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[weixin_44567289的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/weixin_44567289</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; weixin_44567289]]></copyright><item><title><![CDATA[QT_仿王者荣耀抽奖]]></title><link>https://blog.youkuaiyun.com/weixin_44567289/article/details/105799971</link><guid>https://blog.youkuaiyun.com/weixin_44567289/article/details/105799971</guid><author>weixin_44567289</author><pubDate>Mon, 27 Apr 2020 21:24:30 +0800</pubDate><description><![CDATA[QT_仿王者荣耀抽奖
关键代码：
void Widget::funtion_1()
{
    //单抽模式
    int after_pos = 0;
    QLabel* label;
    QLabel*after;
        if(pos &gt; 13)
        {
            pos = 0;
        }
        if(0 == pos)...]]></description><category></category></item><item><title><![CDATA[QT_登录验证码]]></title><link>https://blog.youkuaiyun.com/weixin_44567289/article/details/105799943</link><guid>https://blog.youkuaiyun.com/weixin_44567289/article/details/105799943</guid><author>weixin_44567289</author><pubDate>Mon, 27 Apr 2020 21:21:04 +0800</pubDate><description><![CDATA[QT_登录验证码
关键代码：
void newcode::paintEvent(QPaintEvent *event)
{
    code.clear();
    QPainter painter(this);
    QPen pen;

    //画点
    for(int i = 0;i &lt; 100;++i)
    {
        pen = QPen(QColor(qr...]]></description><category></category></item><item><title><![CDATA[C++_函数模板+希尔排序]]></title><link>https://blog.youkuaiyun.com/weixin_44567289/article/details/99697315</link><guid>https://blog.youkuaiyun.com/weixin_44567289/article/details/99697315</guid><author>weixin_44567289</author><pubDate>Sat, 17 Aug 2019 20:09:34 +0800</pubDate><description><![CDATA[C++_函数模板+希尔排序
#include &lt;iostream&gt;
#include &lt;time.h&gt;
using namespace std;
template&lt;class T&gt;
void PrintArray(T*arr,int length) {
	for (int i = 0; i &lt; length; i++)
	{
		cout &lt;&lt;...]]></description><category></category></item><item><title><![CDATA[c_win32窗体的创建]]></title><link>https://blog.youkuaiyun.com/weixin_44567289/article/details/99697303</link><guid>https://blog.youkuaiyun.com/weixin_44567289/article/details/99697303</guid><author>weixin_44567289</author><pubDate>Sat, 17 Aug 2019 20:08:08 +0800</pubDate><description><![CDATA[c_win32窗体的创建
#include &lt;Windows.h&gt;
//6、处理消息（窗口过程）回调函数
//CALLBACK 代表__stdcall 参数传递顺序 从左到右 依次进栈 在函数返回前 清空栈
LRESULT CALLBACK WindowProc(
	  HWND hwnd,//消息所属的窗口句柄 
	  UINT uMsg,//具体消息名称 WM_XXX消息名
	  ...]]></description><category></category></item><item><title><![CDATA[C_文件块读写]]></title><link>https://blog.youkuaiyun.com/weixin_44567289/article/details/98783336</link><guid>https://blog.youkuaiyun.com/weixin_44567289/article/details/98783336</guid><author>weixin_44567289</author><pubDate>Wed, 07 Aug 2019 20:39:06 +0800</pubDate><description><![CDATA[C_文件块读写
#define _CRT_SECURE_NO_WARNINGS
#include &lt;stdio.h&gt;
#include &lt;string.h&gt;
#include &lt;stdlib.h&gt;

typedef struct Student {
	char name[21];
	int age;
	int score;
	char site[51];
}st...]]></description><category></category></item><item><title><![CDATA[c_贪吃蛇]]></title><link>https://blog.youkuaiyun.com/weixin_44567289/article/details/98783223</link><guid>https://blog.youkuaiyun.com/weixin_44567289/article/details/98783223</guid><author>weixin_44567289</author><pubDate>Wed, 07 Aug 2019 20:37:50 +0800</pubDate><description><![CDATA[c_贪吃蛇
#define _CRT_SECURE_NO_WARNINGS
#include &lt;stdio.h&gt;
#include &lt;string.h&gt;
#include &lt;stdlib.h&gt;
#include &lt;Windows.h&gt;
#include &lt;time.h&gt;
#include &lt;conio.h&gt;

#define ...]]></description><category></category></item><item><title><![CDATA[C++二叉树]]></title><link>https://blog.youkuaiyun.com/weixin_44567289/article/details/97513573</link><guid>https://blog.youkuaiyun.com/weixin_44567289/article/details/97513573</guid><author>weixin_44567289</author><pubDate>Sat, 27 Jul 2019 14:33:21 +0800</pubDate><description><![CDATA[C++二叉树
#include &lt;iostream&gt;
using namespace std;
class TreeNode {
public:
	char str;
	TreeNode* LeftNode;
	TreeNode* RightNode;
	
};
//遍历输出数节点
void PrintTreeNode(TreeNode*node) {
	if (node==NULL)...]]></description><category></category></item><item><title><![CDATA[C++堆排序]]></title><link>https://blog.youkuaiyun.com/weixin_44567289/article/details/97513380</link><guid>https://blog.youkuaiyun.com/weixin_44567289/article/details/97513380</guid><author>weixin_44567289</author><pubDate>Sat, 27 Jul 2019 14:31:24 +0800</pubDate><description><![CDATA[C++堆排序
#include &lt;iostream&gt;
#include &lt;time.h&gt;
#include &lt;sys/timeb.h&gt;
using namespace std;
#define MAX 10000
void SwopArray(int arr[],int x,int y) {
	int temp = arr[x];
	arr[x] = arr[y...]]></description><category></category></item><item><title><![CDATA[C++归并排序]]></title><link>https://blog.youkuaiyun.com/weixin_44567289/article/details/96369985</link><guid>https://blog.youkuaiyun.com/weixin_44567289/article/details/96369985</guid><author>weixin_44567289</author><pubDate>Wed, 17 Jul 2019 21:49:24 +0800</pubDate><description><![CDATA[C++归并排序
#include &lt;iostream&gt;
#include &lt;time.h&gt;
#include &lt;sys\timeb.h&gt;

using namespace std;

#define MAX 10000

void MergeArray(int arr[], int stack, int end,int mid, int temp[]) {

	...]]></description><category></category></item><item><title><![CDATA[C++快速排序]]></title><link>https://blog.youkuaiyun.com/weixin_44567289/article/details/96369826</link><guid>https://blog.youkuaiyun.com/weixin_44567289/article/details/96369826</guid><author>weixin_44567289</author><pubDate>Wed, 17 Jul 2019 21:47:48 +0800</pubDate><description><![CDATA[C++快速排序
#include &lt;iostream&gt;
#include &lt;time.h&gt;
#include &lt;sys\timeb.h&gt;
using namespace std;
#define MAX 10000
void SortArrar(int arr[],int stack,int end) {
	int i = stack;
	int j = end...]]></description><category></category></item><item><title><![CDATA[C++希尔排序]]></title><link>https://blog.youkuaiyun.com/weixin_44567289/article/details/94960260</link><guid>https://blog.youkuaiyun.com/weixin_44567289/article/details/94960260</guid><author>weixin_44567289</author><pubDate>Sun, 07 Jul 2019 08:55:41 +0800</pubDate><description><![CDATA[C++希尔排序
#include &lt;iostream&gt;
#include &lt;time.h&gt;
#include &lt;sys/timeb.h&gt;

using namespace std;

#define MAX 10000

void SortArr(int arr[],int length) {
	int i = 0, j = 0, k = 0;
	int int...]]></description><category></category></item><item><title><![CDATA[C++插入排序]]></title><link>https://blog.youkuaiyun.com/weixin_44567289/article/details/94960163</link><guid>https://blog.youkuaiyun.com/weixin_44567289/article/details/94960163</guid><author>weixin_44567289</author><pubDate>Sun, 07 Jul 2019 08:54:10 +0800</pubDate><description><![CDATA[C++插入排序
#include &lt;iostream&gt;

#include &lt;sys\timeb.h&gt;
#include &lt;time.h&gt;

using namespace std;

#define MAX 10000


//插入排序：1、先把数组第一个元素当成有序序列
//          2、从第二个元素开始，元素和当前元素的上一个元素进行比较，符合条...]]></description><category></category></item><item><title><![CDATA[C++栈的应用_就近匹配]]></title><link>https://blog.youkuaiyun.com/weixin_44567289/article/details/93910097</link><guid>https://blog.youkuaiyun.com/weixin_44567289/article/details/93910097</guid><author>weixin_44567289</author><pubDate>Thu, 27 Jun 2019 20:44:10 +0800</pubDate><description><![CDATA[C++栈的应用_就近匹配
#include &lt;iostream&gt;
using namespace std;
#define MAX_SIZE 1024
class Stack
{
public:
	Stack();
	~Stack();
	void push_back(void*);
	void* Front();
	void pop_front();
	int  GetSize();...]]></description><category></category></item><item><title><![CDATA[C++‘企业’链表]]></title><link>https://blog.youkuaiyun.com/weixin_44567289/article/details/93909798</link><guid>https://blog.youkuaiyun.com/weixin_44567289/article/details/93909798</guid><author>weixin_44567289</author><pubDate>Thu, 27 Jun 2019 20:42:43 +0800</pubDate><description><![CDATA[C++‘企业’链表
#include &lt;iostream&gt;
using namespace std;
class Linked
{
public:
	Linked* next;
};
typedef void(*Print)(Linked*);//打印方法函数类型
class LinkeStruct {
public:
	LinkeStruct();
	~LinkeStruct();
...]]></description><category></category></item><item><title><![CDATA[C++装饰器模式]]></title><link>https://blog.youkuaiyun.com/weixin_44567289/article/details/92760360</link><guid>https://blog.youkuaiyun.com/weixin_44567289/article/details/92760360</guid><author>weixin_44567289</author><pubDate>Tue, 18 Jun 2019 08:30:51 +0800</pubDate><description><![CDATA[C++装饰器模式
#include &lt;iostream&gt;
using namespace std;
//装饰模式又叫包装模式，通过一种对客户端透明的方式来拓展对象功能，是继承关系的一种替代。
//装饰模式就是要把附加的功能分别放在独立的类中，并让这个类包含要装饰的对象
class Hero //英雄类
{
public:
	virtual void ShowProperty() = 0...]]></description><category></category></item><item><title><![CDATA[C++外观模式]]></title><link>https://blog.youkuaiyun.com/weixin_44567289/article/details/92760342</link><guid>https://blog.youkuaiyun.com/weixin_44567289/article/details/92760342</guid><author>weixin_44567289</author><pubDate>Tue, 18 Jun 2019 08:28:57 +0800</pubDate><description><![CDATA[C++外观模式
#include &lt;iostream&gt;
using namespace std;
//外观模式就是将复杂的子类系统抽象到同一个接口进行管理，
//外界只需要通过此接口与子类系统进行交互，
//而不必要和复杂的子类系统进行交互
class Television //电视机类
{
public:
	void On(){
		cout &lt;&lt; "电视机打开" &lt...]]></description><category></category></item><item><title><![CDATA[C++依赖倒转原则]]></title><link>https://blog.youkuaiyun.com/weixin_44567289/article/details/91354498</link><guid>https://blog.youkuaiyun.com/weixin_44567289/article/details/91354498</guid><author>weixin_44567289</author><pubDate>Sun, 09 Jun 2019 16:50:01 +0800</pubDate><description><![CDATA[C++依赖倒转原则
#include &lt;iostream&gt;

using namespace std;

class Business 
{
public:
	virtual void GeneralService() = 0;
};

class TransferAccounts :public Business//办理转账业务
{
public :
	void GeneralSer...]]></description><category></category></item><item><title><![CDATA[C++工厂方法模式]]></title><link>https://blog.youkuaiyun.com/weixin_44567289/article/details/91354455</link><guid>https://blog.youkuaiyun.com/weixin_44567289/article/details/91354455</guid><author>weixin_44567289</author><pubDate>Sun, 09 Jun 2019 16:47:02 +0800</pubDate><description><![CDATA[C++工厂方法模式
#include &lt;iostream&gt;
#include &lt;fstream&gt;
#include &lt;string&gt;
using namespace std;
void main() {
	ifstream ifs;
	ifs.open("main.cpp", ios::in);
	if (!ifs)
	{
		cout &lt;&lt; "文件...]]></description><category></category></item><item><title><![CDATA[C++代理模式实现验证登录]]></title><link>https://blog.youkuaiyun.com/weixin_44567289/article/details/91354425</link><guid>https://blog.youkuaiyun.com/weixin_44567289/article/details/91354425</guid><author>weixin_44567289</author><pubDate>Sun, 09 Jun 2019 16:44:42 +0800</pubDate><description><![CDATA[C++代理模式实现验证登录 
#include &lt;iostream&gt;
#include &lt;fstream&gt;
#include &lt;string&gt;
using namespace std;
void main() {
	ifstream ifs;
	ifs.open("main.cpp", ios::in);
	if (!ifs)
	{
		cout &lt;&lt...]]></description><category></category></item><item><title><![CDATA[C++文件流]]></title><link>https://blog.youkuaiyun.com/weixin_44567289/article/details/90631721</link><guid>https://blog.youkuaiyun.com/weixin_44567289/article/details/90631721</guid><author>weixin_44567289</author><pubDate>Tue, 28 May 2019 07:31:11 +0800</pubDate><description><![CDATA[C++文件流
#include &lt;iostream&gt;
#include &lt;fstream&gt;
#include &lt;string&gt;
using namespace std;
void main() {
	ifstream ifs;
	ifs.open("main.cpp", ios::in);
	if (!ifs)
	{
		cout &lt;&lt; "文件打开失...]]></description><category></category></item></channel></rss>