<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[m0_62167310的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/m0_62167310</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; m0_62167310]]></copyright><item><title><![CDATA[KMP算法代码详解]]></title><link>https://blog.youkuaiyun.com/m0_62167310/article/details/125247143</link><guid>https://blog.youkuaiyun.com/m0_62167310/article/details/125247143</guid><author>m0_62167310</author><pubDate>Sun, 12 Jun 2022 17:07:35 +0800</pubDate><description><![CDATA[kmp算法代码详解]]></description><category></category></item><item><title><![CDATA[假设 顺序表 L中的元素按从小到大的次序排列，设计算法以删除表中重复的元素, 并要求时间尽可能少。（最多三个重复数）]]></title><link>https://blog.youkuaiyun.com/m0_62167310/article/details/124057900</link><guid>https://blog.youkuaiyun.com/m0_62167310/article/details/124057900</guid><author>m0_62167310</author><pubDate>Sat, 09 Apr 2022 11:25:15 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
#include &lt;cmath&gt;
#include&lt;iomanip&gt;
using namespace std;
//用线性表合并两个有序表
enum myerrorcode { rangeerror, success, overflow, underflow };
template&lt;class T&gt;
class list
{
public:
	T data[1000];
	int count;
	list()
	{
	.]]></description><category></category></item><item><title><![CDATA[设计算法将递增有序线性表A/B的元素值合并为另一个递增有序的表C]]></title><link>https://blog.youkuaiyun.com/m0_62167310/article/details/123952462</link><guid>https://blog.youkuaiyun.com/m0_62167310/article/details/123952462</guid><author>m0_62167310</author><pubDate>Mon, 04 Apr 2022 13:26:58 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
#include &lt;cmath&gt;
#include&lt;iomanip&gt;
using namespace std;
//用线性表合并两个有序表
enum myerrorcode{ rangeerror,success,overflow,underflow};
template&lt;class T&gt;
struct node
{
	T data;
	node* next;
};
template&lt;class T&gt;
cl.]]></description><category></category></item><item><title><![CDATA[假设链表A、B分别表示两个集合，设计算法以求解C= A∪B， C= A∩B， A=A－B]]></title><link>https://blog.youkuaiyun.com/m0_62167310/article/details/123939926</link><guid>https://blog.youkuaiyun.com/m0_62167310/article/details/123939926</guid><author>m0_62167310</author><pubDate>Sun, 03 Apr 2022 16:41:20 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
using namespace std;

enum myerror_code { success, extent_error };
template&lt;class T&gt;
struct node
{
	T data;
	node* last, * next;
};
template&lt;class T&gt;
class list
{
public:
	list()
	{
		head = new node&lt;T&gt;;
		head-.]]></description><category></category></item><item><title><![CDATA[线性表中元素地址逆置]]></title><link>https://blog.youkuaiyun.com/m0_62167310/article/details/123802078</link><guid>https://blog.youkuaiyun.com/m0_62167310/article/details/123802078</guid><author>m0_62167310</author><pubDate>Mon, 28 Mar 2022 18:11:42 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
#include &lt;cmath&gt;
#include&lt;iomanip&gt;
using namespace std;
enum  error_code1 { success, arrangeerror };
template&lt;class T&gt;
struct node
{
	T data;
	node* next;
	node* prior;

};
template&lt;class T&gt;
class list
{
p.]]></description><category></category></item><item><title><![CDATA[用顺序队列、链队列实现杨辉三角的输出]]></title><link>https://blog.youkuaiyun.com/m0_62167310/article/details/123757580</link><guid>https://blog.youkuaiyun.com/m0_62167310/article/details/123757580</guid><author>m0_62167310</author><pubDate>Sat, 26 Mar 2022 15:58:09 +0800</pubDate><description><![CDATA[顺序队列：


#include&lt;iostream&gt;
#include&lt;cstdlib&gt;
#include&lt;ctime&gt;
#include&lt;string&gt;
using namespace std;
enum  myerror_code { success, underflow, overflow };
//进5-2+3-1
//+5-2+3-7
template&lt;class T&gt;
struct node
{
	T data;
	node* next]]></description><category></category></item><item><title><![CDATA[c++练习题——杨辉三角]]></title><link>https://blog.youkuaiyun.com/m0_62167310/article/details/122152491</link><guid>https://blog.youkuaiyun.com/m0_62167310/article/details/122152491</guid><author>m0_62167310</author><pubDate>Sun, 26 Dec 2021 10:39:06 +0800</pubDate><description><![CDATA[设计函数计算n(1&lt;=n&lt;=25)行的杨辉三角，存放在二维数组中，再输出。


#include&lt;iostream&gt;
#include&lt;iomanip&gt;
using namespace std;
int main()
{
    int n;
    cin &gt;&gt; n;
    n = n;
    int m = 2 * n - 1;

    int** arr = new int * [m];
    for (int i = 0; i &lt; m; ]]></description><category></category></item><item><title><![CDATA[c++练习题——是素数吗]]></title><link>https://blog.youkuaiyun.com/m0_62167310/article/details/122152349</link><guid>https://blog.youkuaiyun.com/m0_62167310/article/details/122152349</guid><author>m0_62167310</author><pubDate>Sun, 26 Dec 2021 10:26:31 +0800</pubDate><description><![CDATA[向程序输入一个正整数，请你判断该正整数是否是素数


#include&lt;iostream&gt;
using namespace std;
int zhishu(int a)
{
	int arr[100];
	arr[0] = a;
	arr[2] = 0;
	arr[1] = 1;
	int j = 2;
	for (int i = 2; i &lt;a ; i++)
	{
			if (a % i == 0&amp;&amp;a!=2)
			{
				arr[j] = i;
				j++;]]></description><category></category></item><item><title><![CDATA[c++练习题——求符合条件的数]]></title><link>https://blog.youkuaiyun.com/m0_62167310/article/details/122152226</link><guid>https://blog.youkuaiyun.com/m0_62167310/article/details/122152226</guid><author>m0_62167310</author><pubDate>Sun, 26 Dec 2021 10:14:18 +0800</pubDate><description><![CDATA[求满足下列条件的最小自然数 x：（1）个位数是 8；（2）将个位数移至最高位，所得的新数是原数的 4 倍。


#include&lt;iostream&gt;
#include&lt;cmath&gt;
using namespace std;
/*求满足下列条件的最小自然数 x：（1）个位数是 8；（2）将个位数移至最高位，所得的新数是原数的 4 倍。
*/
int panduan(int x)
{
	int count = 0;
	int a = x % 10;
	if (a == 8)
	{
		i]]></description><category></category></item><item><title><![CDATA[c++练习题——返回数值]]></title><link>https://blog.youkuaiyun.com/m0_62167310/article/details/122152128</link><guid>https://blog.youkuaiyun.com/m0_62167310/article/details/122152128</guid><author>m0_62167310</author><pubDate>Sun, 26 Dec 2021 10:05:17 +0800</pubDate><description><![CDATA[返回整数从右边起某一指定位的数值(如int digitR(12345,2),返回4)




#include&lt;iostream&gt;
#include&lt;cmath&gt;
using namespace std;
int shuzhi(int a,int b)
{
	// 返回整数从右边起某一指定位的数值(如int digitR(12345, 2), 返回4)
	int d = pow(10, b);
	int c = (a%d) / pow(10, b - 1);
	return c;
}]]></description><category></category></item><item><title><![CDATA[两种冒泡排序的不同写法]]></title><link>https://blog.youkuaiyun.com/m0_62167310/article/details/122024957</link><guid>https://blog.youkuaiyun.com/m0_62167310/article/details/122024957</guid><author>m0_62167310</author><pubDate>Sun, 19 Dec 2021 15:51:54 +0800</pubDate><description><![CDATA[冒泡排序的基本思想：相邻两数进行比较，大的向后移，经过第一轮两两比较和移动，最大的元素移动到了最后，第二轮次大的位于倒数第二个，依次进行。

两种冒泡排序的不同：从左往右比还是从右往左比

两种冒泡排序本质相同

第一种（从左往右）：


for(int loop=0;loop&lt;len-1;loop++){
		for(int i=0;i&lt;len-1-loop;i++)
			if(array[i]&gt; array[i+1]){
				int t  = array[i];
				 arr]]></description><category></category></item><item><title><![CDATA[统计输入数字的位数(int型)]]></title><link>https://blog.youkuaiyun.com/m0_62167310/article/details/121841431</link><guid>https://blog.youkuaiyun.com/m0_62167310/article/details/121841431</guid><author>m0_62167310</author><pubDate>Thu, 09 Dec 2021 19:25:39 +0800</pubDate><description><![CDATA[#include&lt;iostream&gt;
using namespace std;
int main(){ 
 int num;
 int cnt=1;
 cin&gt;&gt;num;
 while(num/10!=0)
  {
 num=num/10;
 cnt++;
  }
 cout&lt;&lt;cnt&lt;&lt;endl;
  }



]]></description><category></category></item><item><title><![CDATA[取double，float的小数点后几位]]></title><link>https://blog.youkuaiyun.com/m0_62167310/article/details/121840655</link><guid>https://blog.youkuaiyun.com/m0_62167310/article/details/121840655</guid><author>m0_62167310</author><pubDate>Thu, 09 Dec 2021 19:16:18 +0800</pubDate><description><![CDATA[使用setprecision函数取
#include &lt;stdio.h&gt;
#include &lt;iostream&gt;
#include &lt;iomanip&gt;//包涵set函数的头文件
using namespace std;
int main(){    
const double pi=3.14;   
 double a,b,c,d;  
   cin&gt;&gt;a;   
    cin&gt;&gt;b;
    cout&lt;&lt;setiosflags(io]]></description><category></category></item><item><title><![CDATA[归并排序代码详解（注释）]]></title><link>https://blog.youkuaiyun.com/m0_62167310/article/details/121631144</link><guid>https://blog.youkuaiyun.com/m0_62167310/article/details/121631144</guid><author>m0_62167310</author><pubDate>Tue, 30 Nov 2021 13:59:09 +0800</pubDate><description><![CDATA[注：源代码和图片来自 合肥工业大学 计算机学院 方帅老师的课件

侵权必删






#include&lt;iostream&gt;
using namespace std;
//按照标号看
void merg(int a[], int lmin, int rmin, int rmax)/*10、以最后四个数为例，lmin为数组首地址，记为左标记，rmin为右边第一个地址，即2的地址，记为右标记，rmax为数组末尾的地址。*/
{
	int temp;//11、定义一个可以临时变量储存值
	while.]]></description><category></category></item></channel></rss>