<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[gy的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/asliband</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; asliband]]></copyright><item><title><![CDATA[模拟用户登录]]></title><link>https://blog.youkuaiyun.com/asliband/article/details/82735424</link><guid>https://blog.youkuaiyun.com/asliband/article/details/82735424</guid><author>asliband</author><pubDate>Mon, 17 Sep 2018 13:04:16 +0800</pubDate><description><![CDATA[一、测试用例



二、简单代码实现

模拟用户登录情景，并且只能登录三次。

（只允许输入三次密码，如果密码正确则提示登录成，如果三次均输入错误，则退出程序。


#include&amp;lt;stdio.h&amp;gt;
#include&amp;lt;stdlib.h&amp;gt;
#include&amp;lt;string.h&amp;gt;
int main()
{
	int i = 0;
	char name[10] = {...]]></description><category></category></item><item><title><![CDATA[爬取书虫]]></title><link>https://blog.youkuaiyun.com/asliband/article/details/82717014</link><guid>https://blog.youkuaiyun.com/asliband/article/details/82717014</guid><author>asliband</author><pubDate>Sat, 15 Sep 2018 19:57:36 +0800</pubDate><description><![CDATA[一、机制：例如在浏览器中输入www.baidu.com回车，实际是由浏览器找到这个网址所对应的IP地址，向IP地址的服务器发送一个请求，服务器会给一个响应，通过HTTP协议进行通讯。

二、HTTP协议是Hyper Text Transfer Protocol（超文本传输协议）的缩写,是从WWW 服务器传输超文本到本地浏览器的传送协议 

      HTTP最初的目的是为了提供一种发布和接收HT...]]></description><category></category></item><item><title><![CDATA[C语言总结]]></title><link>https://blog.youkuaiyun.com/asliband/article/details/82560952</link><guid>https://blog.youkuaiyun.com/asliband/article/details/82560952</guid><author>asliband</author><pubDate>Sun, 09 Sep 2018 18:35:09 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[二叉搜索树]]></title><link>https://blog.youkuaiyun.com/asliband/article/details/80399066</link><guid>https://blog.youkuaiyun.com/asliband/article/details/80399066</guid><author>asliband</author><pubDate>Mon, 21 May 2018 22:29:10 +0800</pubDate><description><![CDATA[//BSTreeNode.h


​
#pragma once
#include&amp;lt;stdio.h&amp;gt;
#include&amp;lt;stdlib.h&amp;gt;
#include&amp;lt;assert.h&amp;gt;
#include&amp;lt;malloc.h&amp;gt;

typedef int DataType;
typedef struct BSTreeNode
{
	struct BSTreeNode...]]></description><category></category></item><item><title><![CDATA[二叉树的基本操作]]></title><link>https://blog.youkuaiyun.com/asliband/article/details/80316760</link><guid>https://blog.youkuaiyun.com/asliband/article/details/80316760</guid><author>asliband</author><pubDate>Mon, 14 May 2018 23:06:09 +0800</pubDate><description><![CDATA[
BinTree.h


​
#pragma once//防止头文件被重复引用

#include&amp;lt;stdio.h&amp;gt;
#include&amp;lt;stdlib.h&amp;gt;
#include&amp;lt;assert.h&amp;gt;
#include&amp;lt;malloc.h&amp;gt;
#include &quot;BinTree.h&quot;
#include&quot;stack.h&quot;
#include&quot;Queue.h&quo]]></description><category></category></item><item><title><![CDATA[链式队列的基本操作]]></title><link>https://blog.youkuaiyun.com/asliband/article/details/80057849</link><guid>https://blog.youkuaiyun.com/asliband/article/details/80057849</guid><author>asliband</author><pubDate>Mon, 23 Apr 2018 22:37:55 +0800</pubDate><description><![CDATA[1.队列的概念------只允许在一端进行插入数据操作，在另一端进行删除数据操作的特殊线性表；

                            进行插入操作的一端称为队尾（入队列）

                            进行删除操作的一端称为队头（出队列）

                            队列具有先进先出（FIFO）的特性

2.队列的性质-...]]></description><category></category></item><item><title><![CDATA[栈操作]]></title><link>https://blog.youkuaiyun.com/asliband/article/details/79900415</link><guid>https://blog.youkuaiyun.com/asliband/article/details/79900415</guid><author>asliband</author><pubDate>Wed, 11 Apr 2018 17:48:45 +0800</pubDate><description><![CDATA[ 

 //.h


#pragma once

#include&amp;lt;stdio.h&amp;gt;
#include&amp;lt;assert.h&amp;gt;
#include&amp;lt;malloc.h&amp;gt;
#include&amp;lt;stdlib.h&amp;gt;
#include&amp;lt;string.h&amp;gt;
//typedef int DataType;//栈：后进先出
typedef char DataTy...]]></description><category></category></item><item><title><![CDATA[单链表及面试题]]></title><link>https://blog.youkuaiyun.com/asliband/article/details/79886300</link><guid>https://blog.youkuaiyun.com/asliband/article/details/79886300</guid><author>asliband</author><pubDate>Tue, 10 Apr 2018 19:32:36 +0800</pubDate><description><![CDATA[//.h


#pragma once
typedef int DataType;
typedef struct Node
{
 struct Node* _pNext;
 DataType _data;
}Node,*pNode;
typedef struct CListNode
{
 struct CListNode* _pNext;
 struct CListNode* _pRandom;
...]]></description><category></category></item><item><title><![CDATA[不带头结点的单链表]]></title><link>https://blog.youkuaiyun.com/asliband/article/details/79764616</link><guid>https://blog.youkuaiyun.com/asliband/article/details/79764616</guid><author>asliband</author><pubDate>Fri, 30 Mar 2018 23:23:57 +0800</pubDate><description><![CDATA[//.h


#pragma once
typedef int DataType;
typedef struct Node
{
 struct Node* _pNext;
 DataType _data;
}Node,*pNode;
void SListInit(pNode* pHead);// 链表初始化
pNode BuySListNode(DataType data); //创建新结点
vo...]]></description><category></category></item><item><title><![CDATA[实现动态顺序表]]></title><link>https://blog.youkuaiyun.com/asliband/article/details/79681763</link><guid>https://blog.youkuaiyun.com/asliband/article/details/79681763</guid><author>asliband</author><pubDate>Sat, 24 Mar 2018 21:24:04 +0800</pubDate><description><![CDATA[//.h


#ifndef __SEQLISTD_H_
#define __SEQLISTD_H_
#include&amp;lt;stdio.h&amp;gt;
#include&amp;lt;stdlib.h&amp;gt;
#include&amp;lt;assert.h&amp;gt;
#include&amp;lt;string.h&amp;gt;
#include&amp;lt;malloc.h&amp;gt;
#include&amp;lt;windows.h&amp;gt;...]]></description><category></category></item><item><title><![CDATA[实现静态顺序表]]></title><link>https://blog.youkuaiyun.com/asliband/article/details/79673817</link><guid>https://blog.youkuaiyun.com/asliband/article/details/79673817</guid><author>asliband</author><pubDate>Fri, 23 Mar 2018 23:17:09 +0800</pubDate><description><![CDATA[//seqlist.h


#pragma once
#include&amp;lt;stdio.h&amp;gt;
#include&amp;lt;stdlib.h&amp;gt;
#include&amp;lt;string.h&amp;gt;
#include&amp;lt;assert.h&amp;gt;

#define MAX_SIZE 10 //数组元素的个数
typedef unsigned int size_t;
typedef int Da...]]></description><category></category></item><item><title><![CDATA[实现strcpy,strcat ,strstr,strchr ,strcmp ,memcpy,memmove]]></title><link>https://blog.youkuaiyun.com/asliband/article/details/79288307</link><guid>https://blog.youkuaiyun.com/asliband/article/details/79288307</guid><author>asliband</author><pubDate>Thu, 08 Feb 2018 12:34:04 +0800</pubDate><description><![CDATA[1.实现strcpy 


#define _CRT_SECURE_NO_WARNINGS 1
#include &amp;lt;stdio.h&amp;gt;
#include&amp;lt;stdlib.h&amp;gt;
#include &amp;lt;assert.h&amp;gt;
char *my_strcpy( char *dest, const char *str) 
{ 
    assert(dest != NULL); ...]]></description><category></category></item><item><title><![CDATA[整数计算器与冒泡排序]]></title><link>https://blog.youkuaiyun.com/asliband/article/details/79139436</link><guid>https://blog.youkuaiyun.com/asliband/article/details/79139436</guid><author>asliband</author><pubDate>Tue, 23 Jan 2018 14:34:50 +0800</pubDate><description><![CDATA[1.使用main函数的参数，实现一个整数计算器，程序可以接受三个参数，第一个参数“-a”选项执行加法，“-s”选项执行减法，“-m”选项执行乘法，“-d”选项执行除法，后面两个参数为操作数。 


#define _CRT_SECURE_NO_WARNINGS 1
#include&amp;lt;stdio.h&amp;gt;
#include&amp;lt;stdlib.h&amp;gt;
int my_calculator(...]]></description><category></category></item><item><title><![CDATA[利用数组找数字汽水]]></title><link>https://blog.youkuaiyun.com/asliband/article/details/79139350</link><guid>https://blog.youkuaiyun.com/asliband/article/details/79139350</guid><author>asliband</author><pubDate>Tue, 23 Jan 2018 14:29:29 +0800</pubDate><description><![CDATA[1.一个数组中只有两个数字是出现一次，其他所有数字都出现了两次。 
找出这两个数字，编程实现。


#define _CRT_SECURE_NO_WARNINGS 1
#include&amp;lt;stdio.h&amp;gt;
#include&amp;lt;stdlib.h&amp;gt;
Find_Num(int arr[], int sz, int * num1, int *num2)
{
 *num1 = 0;
 *...]]></description><category></category></item><item><title><![CDATA[递归和非递归]]></title><link>https://blog.youkuaiyun.com/asliband/article/details/79131063</link><guid>https://blog.youkuaiyun.com/asliband/article/details/79131063</guid><author>asliband</author><pubDate>Mon, 22 Jan 2018 17:07:19 +0800</pubDate><description><![CDATA[1.递归和非递归分别实现求第n个斐波那契数。


#define _CRT_SECURE_NO_WARNINGS 1
#include&amp;lt;stdio.h&amp;gt;
#include&amp;lt;Windows.h&amp;gt;
int fib_1(int n)
{
 //使用递归实现求第n个斐波那契数
 if (n &amp;lt;= 2)
  return 1;
 else
  return fib_1(n - ...]]></description><category></category></item><item><title><![CDATA[使用可变参数，实现函数，求函数参数的平均值]]></title><link>https://blog.youkuaiyun.com/asliband/article/details/79130939</link><guid>https://blog.youkuaiyun.com/asliband/article/details/79130939</guid><author>asliband</author><pubDate>Mon, 22 Jan 2018 16:58:55 +0800</pubDate><description><![CDATA[1.使用可变参数，实现函数，求函数参数的平均值。
#define _CRT_SECURE_NO_WARNINGS 1
#include    
#include    
#include      
int average(int num, ...)//第一个参数传的是参数的个数，后面三个点代表可变参数列表    
{  
   int sum = 0;  
    va_list]]></description><category></category></item><item><title><![CDATA[实现一个函数，可以左旋字符串中的k个字符]]></title><link>https://blog.youkuaiyun.com/asliband/article/details/79130325</link><guid>https://blog.youkuaiyun.com/asliband/article/details/79130325</guid><author>asliband</author><pubDate>Mon, 22 Jan 2018 16:23:48 +0800</pubDate><description><![CDATA[1.实现一个函数，可以左旋字符串中的k个字符。 
ABCD左旋一个字符得到BCDA 
ABCD左旋两个字符得到CDAB 


#include
#include
#include
void move_left(char*p, int num)
{
 int i = 0;
 for (i = 0; i
 {
  char temp = *p;
  int j = 0;]]></description><category></category></item><item><title><![CDATA[调整数组使奇数全部都位于偶数前面]]></title><link>https://blog.youkuaiyun.com/asliband/article/details/79130293</link><guid>https://blog.youkuaiyun.com/asliband/article/details/79130293</guid><author>asliband</author><pubDate>Mon, 22 Jan 2018 16:15:30 +0800</pubDate><description><![CDATA[1.调整数组使奇数全部都位于偶数前面。 

题目： 

输入一个整数数组，实现一个函数，来调整该数组中数字的顺序使得数组中所有的奇数位于数组的前半部分，所有偶数位于数组的后半部分。
#define _CRT_SECURE_NO_WARNINGS 1
#include 
#include
void sort_arr(int *arr, int len)
{
 int *start]]></description><category></category></item><item><title><![CDATA[.编写函数：unsigned int reverse_bit(unsigned int value); 这个函数的返回值value的二进制位模式从左到右翻转后的值]]></title><link>https://blog.youkuaiyun.com/asliband/article/details/79130088</link><guid>https://blog.youkuaiyun.com/asliband/article/details/79130088</guid><author>asliband</author><pubDate>Mon, 22 Jan 2018 16:05:27 +0800</pubDate><description><![CDATA[1.编写函数： 
unsigned int reverse_bit(unsigned int value); 
这个函数的返回 值value的二进制位模式从左到右翻转后的值。 

如： 
在32位机器上25这个值包含下列各位： 
00000000000000000000000000011001 
翻转后：（2550136832） 
1001100000000000000000000]]></description><category></category></item><item><title><![CDATA[三子棋游戏]]></title><link>https://blog.youkuaiyun.com/asliband/article/details/79094735</link><guid>https://blog.youkuaiyun.com/asliband/article/details/79094735</guid><author>asliband</author><pubDate>Thu, 18 Jan 2018 12:53:23 +0800</pubDate><description><![CDATA[C语言三子棋游戏
#define _CRT_SECURE_NO_WARNINGS 1
#include        
#include      
#include "game.h"
#include "game.h"
void print_chessboard(char coord[][3])    
{        
 int i = 0;
 int index_x =]]></description><category></category></item></channel></rss>