<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[qq_43449554的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/qq_43449554</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; qq_43449554]]></copyright><item><title><![CDATA[文件操作]]></title><link>https://blog.youkuaiyun.com/qq_43449554/article/details/96996364</link><guid>https://blog.youkuaiyun.com/qq_43449554/article/details/96996364</guid><author>qq_43449554</author><pubDate>Tue, 23 Jul 2019 15:15:54 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[fork() && fork() || fork()]]></title><link>https://blog.youkuaiyun.com/qq_43449554/article/details/96993679</link><guid>https://blog.youkuaiyun.com/qq_43449554/article/details/96993679</guid><author>qq_43449554</author><pubDate>Tue, 23 Jul 2019 14:27:23 +0800</pubDate><description><![CDATA[fork() &amp;&amp; fork() || fork()
http://blog.youkuaiyun.com/hs794502825/article/details/10242091
#include &lt;unistd.h&gt;
#include &lt;stdio.h&gt;
int main()
{
fork();//
fork() &amp;&amp; fork() || fork(...]]></description><category></category></item><item><title><![CDATA[sqlite3操作语句]]></title><link>https://blog.youkuaiyun.com/qq_43449554/article/details/96300464</link><guid>https://blog.youkuaiyun.com/qq_43449554/article/details/96300464</guid><author>qq_43449554</author><pubDate>Wed, 17 Jul 2019 13:50:16 +0800</pubDate><description><![CDATA[sqlite3 关系型数据库，体积小。
特性：轻量级数据库，体积小，占用资源少，无需安装和管理配置。
缺点：不会进行严格的类型检查
sqlite3基本命令：
创建数据库：sqlite3  student.db

1-  系统命令
     以 ‘ . ’开头的命令
     .help   帮助
     .quit    退出
     .exit    退出
     .schema    查...]]></description><category></category></item><item><title><![CDATA[C++向上转型]]></title><link>https://blog.youkuaiyun.com/qq_43449554/article/details/96179031</link><guid>https://blog.youkuaiyun.com/qq_43449554/article/details/96179031</guid><author>qq_43449554</author><pubDate>Tue, 16 Jul 2019 20:21:16 +0800</pubDate><description><![CDATA[将派生类对象的成员数据赋值给基类对象（仅限成员数据）
#include &lt;iostream&gt;
using namespace std;

class Base
{
protected:
    int a;

public:
    Base(int a)
    {
        this-&gt;a = a;
    }
    ~Base()
    {
    }

    ...]]></description><category></category></item><item><title><![CDATA[C++运算符重载]]></title><link>https://blog.youkuaiyun.com/qq_43449554/article/details/96169396</link><guid>https://blog.youkuaiyun.com/qq_43449554/article/details/96169396</guid><author>qq_43449554</author><pubDate>Tue, 16 Jul 2019 19:51:46 +0800</pubDate><description><![CDATA[单目运算符重载：
包括  前置++，前置–；后置++， 后置–
原型：
成员函数写法：className operator++( int )
友元函数写法：friend className operator++(className&amp; obj ,int )
其中，有无 int 参数是区分前置还是后置的标志，有 int 参数的为后置
成员函数写法少写一个参数是因为成员函数中自带一个指向当前对象...]]></description><category></category></item><item><title><![CDATA[main函数参数]]></title><link>https://blog.youkuaiyun.com/qq_43449554/article/details/96003779</link><guid>https://blog.youkuaiyun.com/qq_43449554/article/details/96003779</guid><author>qq_43449554</author><pubDate>Mon, 15 Jul 2019 19:01:12 +0800</pubDate><description><![CDATA[argc是命令行总的参数个数
argv[]是argc个参数，其中第0个参数是程序的全名，以后的参数命令行后面跟的用户输入的参数，比如：
   int  main(int argc,  char* argv[])   
   {   
       int   i;   
       for (i = 0; i&lt;argc; i++)   
            cout&lt;&lt;ar...]]></description><category></category></item><item><title><![CDATA[习题]]></title><link>https://blog.youkuaiyun.com/qq_43449554/article/details/95646079</link><guid>https://blog.youkuaiyun.com/qq_43449554/article/details/95646079</guid><author>qq_43449554</author><pubDate>Fri, 12 Jul 2019 18:47:37 +0800</pubDate><description><![CDATA[##练习
**1、原型：void *memcpy(void dest, const void src, size_t n);
功能：从源src所指的内存地址的起始位置开始拷贝n个字节到目标dest所指的内存地址的起始位置中；
memcpy没有考虑重叠的情况
void* mymemcpy(void* dest, void* source, size_t count)
{
	char *ret = (...]]></description><category></category></item><item><title><![CDATA[单向链表排序]]></title><link>https://blog.youkuaiyun.com/qq_43449554/article/details/87373035</link><guid>https://blog.youkuaiyun.com/qq_43449554/article/details/87373035</guid><author>qq_43449554</author><pubDate>Fri, 15 Feb 2019 17:19:42 +0800</pubDate><description><![CDATA[一、冒泡排序简述
1、概念
冒泡排序（Bubble Sort），是一种计算机科学领域的较简单的排序算法。
　　它重复地走访过要排序的数列，一次比较两个元素，如果他们的顺序错误就把他们交换过来。走访数列的工作是重复地进行直到没有再需要交换，也就是说该数列已经排序完成。这个算法的名字由来是因为越大的元素会经由交换慢慢“浮”到数列的顶端。
2、实例分析
以数组为例进行说明：
　　数组a[4] = {4,...]]></description><category></category></item><item><title><![CDATA[链表建立、插入及删除]]></title><link>https://blog.youkuaiyun.com/qq_43449554/article/details/87189751</link><guid>https://blog.youkuaiyun.com/qq_43449554/article/details/87189751</guid><author>qq_43449554</author><pubDate>Wed, 13 Feb 2019 16:41:42 +0800</pubDate><description><![CDATA[#include &amp;lt;stdio.h&amp;gt;
#include &amp;lt;stdlib.h&amp;gt;

struct node 
{
    int num;
    struct node * next;
};

/*----------将新节点插入链表头-----------------------*/
void insert_head(struct node ** head, struct...]]></description><category></category></item><item><title><![CDATA[函数以数组为返回值]]></title><link>https://blog.youkuaiyun.com/qq_43449554/article/details/86681494</link><guid>https://blog.youkuaiyun.com/qq_43449554/article/details/86681494</guid><author>qq_43449554</author><pubDate>Mon, 28 Jan 2019 18:58:58 +0800</pubDate><description><![CDATA[#include &amp;lt;stdio.h&amp;gt;

char *func()
{
    static char a[] = &quot;hello world&quot;;
    return a;
}

int main()
{
    printf(&quot;%s\n&quot;, func());
	return 0;	
}

由下图可知，当字符串数组a定义成静态的时候，它的生命周期与程序的生命周期一样。
若不定义成 sta...]]></description><category></category></item><item><title><![CDATA[指向二维数组的数组指针]]></title><link>https://blog.youkuaiyun.com/qq_43449554/article/details/86654598</link><guid>https://blog.youkuaiyun.com/qq_43449554/article/details/86654598</guid><author>qq_43449554</author><pubDate>Sat, 26 Jan 2019 17:08:10 +0800</pubDate><description><![CDATA[

]]></description><category></category></item><item><title><![CDATA[n个人围成一圈，报到3退出]]></title><link>https://blog.youkuaiyun.com/qq_43449554/article/details/86634405</link><guid>https://blog.youkuaiyun.com/qq_43449554/article/details/86634405</guid><author>qq_43449554</author><pubDate>Thu, 24 Jan 2019 22:32:58 +0800</pubDate><description><![CDATA[题目：有n个人围成一圈,顺序排号,从第一个开始报数(从1到3报数),凡报到3的人退出圈子,问最后最后留下的是原来第几号的那位？
#include &amp;lt;stdio.h&amp;gt;

int M = 3;

int main()
{
    int n, s = 0;
    int i;

    printf(&quot;input number:&quot;);
    scanf( &quot;%d&quot;, &amp;amp;n);
...]]></description><category></category></item><item><title><![CDATA[1000以内的“完数”]]></title><link>https://blog.youkuaiyun.com/qq_43449554/article/details/86634309</link><guid>https://blog.youkuaiyun.com/qq_43449554/article/details/86634309</guid><author>qq_43449554</author><pubDate>Thu, 24 Jan 2019 22:26:03 +0800</pubDate><description><![CDATA[题目：一个数如果恰好等于它的因子之和,这个数被成为”完数”,例如:6=1+2+3.请编程找出1000以内的完数
首先根据题目，要求1000以内的完数，则需要定义一个变量 num 来表示1~1000
然后定义一个变量 i 用来表示因子，定义一个变量 sum 来表示因子相加的和；
原本代码如下：
#include &amp;lt;stdio.h&amp;gt;

int main()   //错误代码
{
    i...]]></description><category></category></item><item><title><![CDATA[mfc单文档滚动字幕]]></title><link>https://blog.youkuaiyun.com/qq_43449554/article/details/83961023</link><guid>https://blog.youkuaiyun.com/qq_43449554/article/details/83961023</guid><author>qq_43449554</author><pubDate>Sun, 11 Nov 2018 18:57:53 +0800</pubDate><description><![CDATA[mfc单文档实现滚动字幕

在CView.h里添加一个 int 型、public 属性的成员变量 x ，并在构造函数里并初始化
在OnDraw（CDC *pDC）中打开类向导（ctrl+w）添加时间响应函数WM_TIMER并添加代码

void C滚动字幕View::OnTimer(UINT_PTR nIDEvent)
{
   // TODO: 在此添加消息处理程序代码和/或调用默认值
   	...]]></description><category></category></item><item><title><![CDATA[用mfc画动态直线--“橡皮线"]]></title><link>https://blog.youkuaiyun.com/qq_43449554/article/details/83960840</link><guid>https://blog.youkuaiyun.com/qq_43449554/article/details/83960840</guid><author>qq_43449554</author><pubDate>Sun, 11 Nov 2018 18:32:08 +0800</pubDate><description><![CDATA[用mfc画动态直线--“橡皮线”
笔记：代码在CView.cpp里实现
//CView

CPoint m_ptSpoint;  //起始点
CPoint m_ptEpoint;  //最终点
bool m_click;

//上面三个变量也可定义在Cview.h里

void CDrawLineView::OnLButtonDown(UINT nFlags, CPoint point)
{
	/...]]></description><category></category></item></channel></rss>