<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[LINKAIS的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/LINKAIS</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; LINKAIS]]></copyright><item><title><![CDATA[[codewars] Last digit of a large number by CPP]]></title><link>https://blog.youkuaiyun.com/LINKAIS/article/details/128447926</link><guid>https://blog.youkuaiyun.com/LINKAIS/article/details/128447926</guid><author>LINKAIS</author><pubDate>Mon, 26 Dec 2022 19:23:38 +0800</pubDate><description><![CDATA[[codewars]: Last digit of a large number by CPP]]></description><category></category></item><item><title><![CDATA[2022华数杯B题第一问Lingo代码]]></title><link>https://blog.youkuaiyun.com/LINKAIS/article/details/126586787</link><guid>https://blog.youkuaiyun.com/LINKAIS/article/details/126586787</guid><author>LINKAIS</author><pubDate>Mon, 29 Aug 2022 16:05:00 +0800</pubDate><description><![CDATA[2022华数杯B题第一问Lingo代码]]></description><category></category></item><item><title><![CDATA[中国大学MOOC-陈越、何钦铭-数据结构-2022夏：02-线性结构3 Reversing Linked List]]></title><link>https://blog.youkuaiyun.com/LINKAIS/article/details/125681164</link><guid>https://blog.youkuaiyun.com/LINKAIS/article/details/125681164</guid><author>LINKAIS</author><pubDate>Fri, 08 Jul 2022 16:34:08 +0800</pubDate><description><![CDATA[中国大学MOOC-陈越、何钦铭-数据结构-2022夏：02-线性结构3 Reversing Linked List]]></description><category></category></item><item><title><![CDATA[中国大学MOOC-陈越、何钦铭-数据结构-2022夏: 02-线性结构1 两个有序链表序列的合并]]></title><link>https://blog.youkuaiyun.com/LINKAIS/article/details/125678681</link><guid>https://blog.youkuaiyun.com/LINKAIS/article/details/125678681</guid><author>LINKAIS</author><pubDate>Fri, 08 Jul 2022 15:03:22 +0800</pubDate><description><![CDATA[中国大学MOOC-陈越、何钦铭-数据结构-2022夏: 02-线性结构1 两个有序链表序列的合并]]></description><category></category></item><item><title><![CDATA[Base64 C++实现]]></title><link>https://blog.youkuaiyun.com/LINKAIS/article/details/125418037</link><guid>https://blog.youkuaiyun.com/LINKAIS/article/details/125418037</guid><author>LINKAIS</author><pubDate>Wed, 22 Jun 2022 22:48:01 +0800</pubDate><description><![CDATA[Base64]]></description><category></category></item><item><title><![CDATA[AVLTree(二叉平衡树)C++实现]]></title><link>https://blog.youkuaiyun.com/LINKAIS/article/details/125399871</link><guid>https://blog.youkuaiyun.com/LINKAIS/article/details/125399871</guid><author>LINKAIS</author><pubDate>Tue, 21 Jun 2022 22:14:08 +0800</pubDate><description><![CDATA[二叉平衡树C++实现]]></description><category></category></item><item><title><![CDATA[8皇后问题]]></title><link>https://blog.youkuaiyun.com/LINKAIS/article/details/125245675</link><guid>https://blog.youkuaiyun.com/LINKAIS/article/details/125245675</guid><author>LINKAIS</author><pubDate>Sun, 12 Jun 2022 15:11:41 +0800</pubDate><description><![CDATA[8皇后问题]]></description><category></category></item><item><title><![CDATA[关于执行 node xxx.js 命令只是一闪而过没有响应]]></title><link>https://blog.youkuaiyun.com/LINKAIS/article/details/121641337</link><guid>https://blog.youkuaiyun.com/LINKAIS/article/details/121641337</guid><author>LINKAIS</author><pubDate>Tue, 30 Nov 2021 20:03:10 +0800</pubDate><description><![CDATA[原因:运行的xxx.js文件所在的文件夹名为大小写形式的nodejs

]]></description><category></category></item><item><title><![CDATA[单例模式详解]]></title><link>https://blog.youkuaiyun.com/LINKAIS/article/details/120763539</link><guid>https://blog.youkuaiyun.com/LINKAIS/article/details/120763539</guid><author>LINKAIS</author><pubDate>Thu, 14 Oct 2021 15:24:32 +0800</pubDate><description><![CDATA[单例模式
含义：在整个运行时域内 一个类只有一个实例对象
用处：有的类的实例对象创建和销毁对资源来说消耗不大，但是有的类比较庞大与复杂，频繁的创建和销毁对象，并且这些对象是完全可以复用的，如创建数据库链接对象，这样会造成一些不必要的资源浪费
实现单例模式的三点要求：

保证线程安全
实现懒加载
懒加载：滞后创建，实例对象是在第一次调用时才真正创建，而不是程序一启动它就构造好了等你调用
不能用反射破坏

例一：懒汉式单例
public class SingleDemoOne {
    private Sin]]></description><category></category></item><item><title><![CDATA[初学单链条]]></title><link>https://blog.youkuaiyun.com/LINKAIS/article/details/114374248</link><guid>https://blog.youkuaiyun.com/LINKAIS/article/details/114374248</guid><author>LINKAIS</author><pubDate>Thu, 04 Mar 2021 17:51:18 +0800</pubDate><description><![CDATA[学完单链条头发又掉了几根
用单链条做一个图书管理系统
#include &lt;stdio.h&gt;
#include &lt;string.h&gt;
#include &lt;stdlib.h&gt;
struct Book 
{
		char title[128];
		char author[40];
		struct Book *next;
};
void getInput(struct Book *);
void addBook(struct Book **);
void printLibra]]></description><category></category></item><item><title><![CDATA[C语言:报数问题]]></title><link>https://blog.youkuaiyun.com/LINKAIS/article/details/114308206</link><guid>https://blog.youkuaiyun.com/LINKAIS/article/details/114308206</guid><author>LINKAIS</author><pubDate>Wed, 03 Mar 2021 12:54:58 +0800</pubDate><description><![CDATA[题目：有N个人，从1到N编号，按照编号顺序围成一圈。从第一个人开始报数(从1报到3)，凡报到3的人退出圈子。
问：最后留下的人的编号是几号。
#include &lt;stdio.h&gt;
#include &lt;stdlib.h&gt;
int main()
{
		int num;
		int *array = NULL;
		printf("请输入围成圈的人数:");
		scanf("%d",&amp;num);
		array = (int *)calloc(num,sizeof(int));]]></description><category></category></item></channel></rss>