<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[MAX__YF的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/MAX__YF</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; MAX__YF]]></copyright><item><title><![CDATA[Android 上层执行shell指令]]></title><link>https://blog.youkuaiyun.com/MAX__YF/article/details/127407275</link><guid>https://blog.youkuaiyun.com/MAX__YF/article/details/127407275</guid><author>MAX__YF</author><pubDate>Wed, 19 Oct 2022 14:32:34 +0800</pubDate><description><![CDATA[我是做上层app,但是要直接和底层硬件打交道,有的时候想要检测硬件功能,需求放会直接给一条shell指令,cpp中可以直接system()函数执行,那java中可以用怎样的方式来执行]]></description><category></category></item><item><title><![CDATA[ninja介绍及使用]]></title><link>https://blog.youkuaiyun.com/MAX__YF/article/details/125856258</link><guid>https://blog.youkuaiyun.com/MAX__YF/article/details/125856258</guid><author>MAX__YF</author><pubDate>Mon, 18 Jul 2022 17:43:59 +0800</pubDate><description><![CDATA[ninja介绍以及相关使用]]></description><category></category></item><item><title><![CDATA[ninja启动过程]]></title><link>https://blog.youkuaiyun.com/MAX__YF/article/details/125856537</link><guid>https://blog.youkuaiyun.com/MAX__YF/article/details/125856537</guid><author>MAX__YF</author><pubDate>Mon, 18 Jul 2022 17:42:32 +0800</pubDate><description><![CDATA[ninja启动的全过程]]></description><category></category></item><item><title><![CDATA[ninja文件语法学习]]></title><link>https://blog.youkuaiyun.com/MAX__YF/article/details/125856490</link><guid>https://blog.youkuaiyun.com/MAX__YF/article/details/125856490</guid><author>MAX__YF</author><pubDate>Mon, 18 Jul 2022 17:40:05 +0800</pubDate><description><![CDATA[ninja语法学习]]></description><category></category></item><item><title><![CDATA[使用makefile编译ninja]]></title><link>https://blog.youkuaiyun.com/MAX__YF/article/details/125856383</link><guid>https://blog.youkuaiyun.com/MAX__YF/article/details/125856383</guid><author>MAX__YF</author><pubDate>Mon, 18 Jul 2022 17:37:31 +0800</pubDate><description><![CDATA[使用makefile编译ninja,与ninja编译做对比]]></description><category></category></item><item><title><![CDATA[BST树]]></title><link>https://blog.youkuaiyun.com/MAX__YF/article/details/105393778</link><guid>https://blog.youkuaiyun.com/MAX__YF/article/details/105393778</guid><author>MAX__YF</author><pubDate>Wed, 08 Apr 2020 18:15:26 +0800</pubDate><description><![CDATA[二叉查找树（BST树）的构建、查找、插入、删除操作
BST（二叉搜索/排序树）类模板的实现
#include &lt;stdio.h&gt;
#include &lt;malloc.h&gt;
#include &lt;stdlib.h&gt;
#include &lt;string.h&gt;

typedef int Key;

typedef struct BstNode {
	BstNod...]]></description><category></category></item><item><title><![CDATA[二叉树]]></title><link>https://blog.youkuaiyun.com/MAX__YF/article/details/105361991</link><guid>https://blog.youkuaiyun.com/MAX__YF/article/details/105361991</guid><author>MAX__YF</author><pubDate>Tue, 07 Apr 2020 12:45:06 +0800</pubDate><description><![CDATA[#include &lt;stdio.h&gt;
#include &lt;string.h&gt;
#include &lt;malloc.h&gt;
#include &lt;stdlib.h&gt;
#include &lt;iostream&gt;
#include &lt;stack&gt;
#include &lt;queue&gt;

using namespace std;

#d...]]></description><category></category></item><item><title><![CDATA[KMP算法(代码)]]></title><link>https://blog.youkuaiyun.com/MAX__YF/article/details/105358768</link><guid>https://blog.youkuaiyun.com/MAX__YF/article/details/105358768</guid><author>MAX__YF</author><pubDate>Tue, 07 Apr 2020 10:35:23 +0800</pubDate><description><![CDATA[漫画理解KMP算法
next数组
typedef char String[MAXSIZE + 1];

void get_next(String T, int *next)//通过计算返回子串T的next数组
{
	int i, j;
	i = 1;
	j = 0;
	next[1] = 0;
	while (i &lt; T[0])//T[0]表示串的长度
	{
		if (j == 0 || ...]]></description><category></category></item><item><title><![CDATA[串]]></title><link>https://blog.youkuaiyun.com/MAX__YF/article/details/105249413</link><guid>https://blog.youkuaiyun.com/MAX__YF/article/details/105249413</guid><author>MAX__YF</author><pubDate>Wed, 01 Apr 2020 16:40:14 +0800</pubDate><description><![CDATA[#include &lt;stdio.h&gt;
#include &lt;string.h&gt;
#include &lt;stdlib.h&gt;
#define MAXSIZE 40
typedef char String[MAXSIZE + 1];
bool StrAssign(String T, char* chars)//生成值为chars的串
{
if (strlen(chars)...]]></description><category></category></item><item><title><![CDATA[双端队列]]></title><link>https://blog.youkuaiyun.com/MAX__YF/article/details/105240607</link><guid>https://blog.youkuaiyun.com/MAX__YF/article/details/105240607</guid><author>MAX__YF</author><pubDate>Wed, 01 Apr 2020 10:58:48 +0800</pubDate><description><![CDATA[deque 即双端队列
（deque，全名double-ended queue）是一种具有队列和栈的性质的数据结构。双端队列中的元素可以从两端弹出，其限定插入和删除操作在表的两端进行。
结构体定义及初始化
typedef int T;
typedef struct DoubleQuene
{
	T data[MAXSIZE];
	int front;//头位置
	int rear;//尾位置
}*...]]></description><category></category></item><item><title><![CDATA[链队列]]></title><link>https://blog.youkuaiyun.com/MAX__YF/article/details/105222507</link><guid>https://blog.youkuaiyun.com/MAX__YF/article/details/105222507</guid><author>MAX__YF</author><pubDate>Tue, 31 Mar 2020 14:42:39 +0800</pubDate><description><![CDATA[#include &lt;stdio.h&gt;
#include &lt;malloc.h&gt;

typedef int T;

typedef struct QNode
{
	T data;//数据
	QNode* next;//指向下一结点
}*Node;

typedef struct 
{
	Node front, rear;//头、尾指针
	int count;//计数器
}*Li...]]></description><category></category></item><item><title><![CDATA[链栈]]></title><link>https://blog.youkuaiyun.com/MAX__YF/article/details/105222495</link><guid>https://blog.youkuaiyun.com/MAX__YF/article/details/105222495</guid><author>MAX__YF</author><pubDate>Tue, 31 Mar 2020 14:42:04 +0800</pubDate><description><![CDATA[#include &lt;stdio.h&gt;
#include &lt;malloc.h&gt;
#include &lt;stdlib.h&gt;

typedef int T;
typedef struct StackNode
{
	T data;//数据
	StackNode* next;//指向下一结点
}*LinkStackNode;

typedef struct
{
	LinkS...]]></description><category></category></item><item><title><![CDATA[两个栈共用空间]]></title><link>https://blog.youkuaiyun.com/MAX__YF/article/details/105222478</link><guid>https://blog.youkuaiyun.com/MAX__YF/article/details/105222478</guid><author>MAX__YF</author><pubDate>Tue, 31 Mar 2020 14:41:32 +0800</pubDate><description><![CDATA[#include &lt;stdio.h&gt;
#include &lt;malloc.h&gt;

#define MAXSIZE 20

typedef int T;
typedef struct DoubleStack
{
	T data[MAXSIZE];
	int top1;//头
	int top2;//尾
}*dostack;

bool InitStack(dostack s)/...]]></description><category></category></item><item><title><![CDATA[循环队列]]></title><link>https://blog.youkuaiyun.com/MAX__YF/article/details/105222458</link><guid>https://blog.youkuaiyun.com/MAX__YF/article/details/105222458</guid><author>MAX__YF</author><pubDate>Tue, 31 Mar 2020 14:40:49 +0800</pubDate><description><![CDATA[#include &lt;stdio.h&gt;
#include &lt;malloc.h&gt;

#define MAXSIZE 20

typedef int T;

typedef struct Quene
{
	T data[MAXSIZE];
	int front;//头位置
	int rear;//尾位置
}*quene;

bool InitQuene(quene q)//初始化...]]></description><category></category></item><item><title><![CDATA[静态链表]]></title><link>https://blog.youkuaiyun.com/MAX__YF/article/details/105208238</link><guid>https://blog.youkuaiyun.com/MAX__YF/article/details/105208238</guid><author>MAX__YF</author><pubDate>Mon, 30 Mar 2020 21:05:15 +0800</pubDate><description><![CDATA[#include &lt;stdio.h&gt;

#define MAXSIZE 20

typedef int T;
typedef struct
{
	T data;
	int cur;
}StaticList[MAXSIZE];

int LengthList(StaticList L)//数据个数
{
	int i = 0;
	int j = L[MAXSIZE - 1].cur;
	w...]]></description><category></category></item><item><title><![CDATA[链表相关面试题]]></title><link>https://blog.youkuaiyun.com/MAX__YF/article/details/105206401</link><guid>https://blog.youkuaiyun.com/MAX__YF/article/details/105206401</guid><author>MAX__YF</author><pubDate>Mon, 30 Mar 2020 19:29:32 +0800</pubDate><description><![CDATA[结构体
typedef int T;

typedef struct Node {
	T data;
	Node* next;
}*node;
typedef struct Node *LinkList;

1.单链表的逆置
Node* Reverse(Node *Head)//单链表的逆置
{
	Node *p, *q, *r;
	p = Head;
	q = NULL;
	r = NULL;
...]]></description><category></category></item><item><title><![CDATA[单链表]]></title><link>https://blog.youkuaiyun.com/MAX__YF/article/details/105196205</link><guid>https://blog.youkuaiyun.com/MAX__YF/article/details/105196205</guid><author>MAX__YF</author><pubDate>Mon, 30 Mar 2020 12:08:39 +0800</pubDate><description><![CDATA[#include &lt;stdio.h&gt;
#include &lt;malloc.h&gt;

typedef int T;

typedef struct Node {
	T data;
	Node* next;
}*node;
typedef struct Node *LinkList;

LinkList InitList()//初始化链表
{
	LinkList List = (L...]]></description><category></category></item><item><title><![CDATA[分治与递归（练习题）]]></title><link>https://blog.youkuaiyun.com/MAX__YF/article/details/104780139</link><guid>https://blog.youkuaiyun.com/MAX__YF/article/details/104780139</guid><author>MAX__YF</author><pubDate>Mon, 16 Mar 2020 12:27:53 +0800</pubDate><description><![CDATA[问题1：使用递归倒叙输出数字
输入 ： 12345
输出 ： 54321
void ReversePrint(int a)
{
	if (a &lt;= 0)
	{
		printf("\n");
		return;
	}

	printf("%d", a % 10);
	ReversePrint(a / 10);
}

问题2：无序数组的查询（递归）
int Find_ar(int* ar, i...]]></description><category></category></item><item><title><![CDATA[算法初识  分治与递归 : 斐波那契数列]]></title><link>https://blog.youkuaiyun.com/MAX__YF/article/details/104779482</link><guid>https://blog.youkuaiyun.com/MAX__YF/article/details/104779482</guid><author>MAX__YF</author><pubDate>Tue, 10 Mar 2020 18:19:41 +0800</pubDate><description><![CDATA[分治策略是把大问题转化成规模小的问题，然后将答案合并，最终得出题解。
而如果一个函数直接或间接的调用自身，则这个函数就是对自身的递归调用(简单的说就是我用我自己)。
而递归的一个经典用法就是，斐波那契数列（Fibonacci）
就像这样的一串数，
1,1,2,3,5,8,13,21,34…
这样的数的规律就是: f(n)+f(n+1)=f(n+2)
代码如下：
int Fibonacci1(int...]]></description><category></category></item><item><title><![CDATA[虚函数]]></title><link>https://blog.youkuaiyun.com/MAX__YF/article/details/104172422</link><guid>https://blog.youkuaiyun.com/MAX__YF/article/details/104172422</guid><author>MAX__YF</author><pubDate>Tue, 04 Feb 2020 17:41:14 +0800</pubDate><description><![CDATA[虚函数是面向对象编程函数的一种特定形态，是C++用于实现多态的一种有效机制。
多态
C++的多态可以分为静态多态和动态多态。函数重载和运算符重载实现的多态属于静态多态，而通过虚函数可以实现动态多态。实现函数的动态联编其本质核心则是虚表指针与虚函数表。
虚函数
指向基类的指针在操作它的多态类对象时，会根据不同的类对象调用其相应的函数，这个函数就是虚函数，虚函数用virtual修饰函数名。虚函数的作用...]]></description><category></category></item></channel></rss>