<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[千年古物的技术宅]]></title><description><![CDATA[ONE BYR@BUPT]]></description><link>https://blog.youkuaiyun.com/drf1234</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; drf1234]]></copyright><item><title><![CDATA[github使用方法]]></title><link>https://blog.youkuaiyun.com/drf1234/article/details/7083370</link><guid>https://blog.youkuaiyun.com/drf1234/article/details/7083370</guid><author>drf1234</author><pubDate>Mon, 19 Dec 2011 12:55:41 +0800</pubDate><description><![CDATA[初始化:

git config --global user.name "Your Name" 
git config --global user.email XXXX@mail.com

上传与管理
git init
git add -u                                                 work tree->index tree
g]]></description><category></category></item><item><title><![CDATA[楼梯台阶问题解法]]></title><link>https://blog.youkuaiyun.com/drf1234/article/details/6972036</link><guid>https://blog.youkuaiyun.com/drf1234/article/details/6972036</guid><author>drf1234</author><pubDate>Tue, 15 Nov 2011 10:35:31 +0800</pubDate><description><![CDATA[非常简单的递归，居然连我都能做出来
10个阶梯，你一次可以上一阶或两阶，走上去，共有多少种走法？

设n个阶梯共有f(n)种走法
f(n)=f(n-1)+f(n-2)
证明：第一步走1步，则剩下n-1个台阶，共f(n-1)种走法
      第一步走2步，则剩下n-2个台阶，共f(n-2)种走法


推广问题：n个阶梯，可以走1步，2步，3步...m步，共有多少种走法？
#de]]></description><category></category></item><item><title><![CDATA[语言基础——IO]]></title><link>https://blog.youkuaiyun.com/drf1234/article/details/6963567</link><guid>https://blog.youkuaiyun.com/drf1234/article/details/6963567</guid><author>drf1234</author><pubDate>Sun, 13 Nov 2011 00:13:11 +0800</pubDate><description><![CDATA[C：#include  




输出
输入


printf
scanf


int fputc(int c,FILE *p)
int fgetc(FILE *p)


int fputs(char *s,FILE *p)
char *fgets(char *s,int n,FILE *p)


int putc(int c,FILE *p)
int]]></description><category></category></item><item><title><![CDATA[系统——进程线程，同步与通信]]></title><link>https://blog.youkuaiyun.com/drf1234/article/details/6951934</link><guid>https://blog.youkuaiyun.com/drf1234/article/details/6951934</guid><author>drf1234</author><pubDate>Wed, 09 Nov 2011 13:20:30 +0800</pubDate><description><![CDATA[一个标准的线程由线程ID，当前指令指针(PC)，寄存器集合和堆栈组成。一个进程内线程独有栈,其他的堆、静态区、代码区为所有线程共享。



windows_线程_同步(侯捷Win32多线程程序设计）临界区（仅限进程内的各个线程使用）、互斥量（可以跨越多个不同进程的线程）、信号量/信号灯（Semaphore）、事件（Event）
windows_进程_同步  互斥量(限制单个线程访问)，信]]></description><category></category></item><item><title><![CDATA[系统——网络编程]]></title><link>https://blog.youkuaiyun.com/drf1234/article/details/6951450</link><guid>https://blog.youkuaiyun.com/drf1234/article/details/6951450</guid><author>drf1234</author><pubDate>Wed, 09 Nov 2011 11:41:57 +0800</pubDate><description><![CDATA[服务器 


struct sockaddr_in sockaddr;

sockaddr.sin_family = AF_INET;
sockaddr.sin_addr.s_addr =htonl(innaddr_any)
 //inet_addr("192.168.1.5") ;
sockaddr.sin_port = htons(80);
socklen_t len=siz]]></description><category></category></item><item><title><![CDATA[笔试面试]]></title><link>https://blog.youkuaiyun.com/drf1234/article/details/6950432</link><guid>https://blog.youkuaiyun.com/drf1234/article/details/6950432</guid><author>drf1234</author><pubDate>Tue, 08 Nov 2011 23:46:54 +0800</pubDate><description><![CDATA[搜狗 因烽火放弃
360         因不在北京放弃
新浪微博 因烽火放弃

网易有道
新浪         因烽火放弃
搜狐        miss
淘宝        miss
阿里云    miss
支付宝   没消息




淘宝实习笔试


N个鸡蛋放到M个篮子中，篮子不能为空，要满足：对任意不大于N的数量，能用若干个篮子中鸡蛋的和表示。

写出]]></description><category></category></item><item><title><![CDATA[基础问题]]></title><link>https://blog.youkuaiyun.com/drf1234/article/details/6950575</link><guid>https://blog.youkuaiyun.com/drf1234/article/details/6950575</guid><author>drf1234</author><pubDate>Tue, 08 Nov 2011 23:46:51 +0800</pubDate><description><![CDATA[const:原则：const在*左侧，则对象不能动
const int *a;//指向const对象
int const *a //与上者等同。

int *const a=&b;//a不能改动
const *int a=&b;//编译错误
const int* const a=&b;//a,b不能改动。
const和引用


             c]]></description><category></category></item><item><title><![CDATA[二叉树的相关问题]]></title><link>https://blog.youkuaiyun.com/drf1234/article/details/6948435</link><guid>https://blog.youkuaiyun.com/drf1234/article/details/6948435</guid><author>drf1234</author><pubDate>Tue, 08 Nov 2011 18:05:28 +0800</pubDate><description><![CDATA[1.遍历
如二叉树：a+b*(c-d)-e/f
                      -
           +                   /
     a         *          e        f
            b     -
                 c  d
先序：-+a*b-cd/ef
中序：a+b*c-d-e/f
后]]></description><category></category></item><item><title><![CDATA[字符串函数]]></title><link>https://blog.youkuaiyun.com/drf1234/article/details/6943177</link><guid>https://blog.youkuaiyun.com/drf1234/article/details/6943177</guid><author>drf1234</author><pubDate>Mon, 07 Nov 2011 14:16:55 +0800</pubDate><description><![CDATA[参考K&R
s,t 为char*，ct,cs为const char* ,c为int
char *strcpy (s,ct)       
ct复制到s，含\0                       char *strncpy(s,ct,n)
char *strcat   (s,ct)        ct接入到s尾部 char *strncat (s,ct,n)  
size_t]]></description><category></category></item><item><title><![CDATA[排序问题]]></title><link>https://blog.youkuaiyun.com/drf1234/article/details/6942978</link><guid>https://blog.youkuaiyun.com/drf1234/article/details/6942978</guid><author>drf1234</author><pubDate>Mon, 07 Nov 2011 12:30:54 +0800</pubDate><description><![CDATA[1.简单排序::冒泡,直接插入,选择
插入排序:

	a[MAXLEN]
	int i=1,j=0;
	int tmp=0;

	for(i=1;i<MAXLEN;i++)
	{
		tmp=a[i];
		for(j=i;j>0&&a[j-1]>tmp;j--)
			a[j]=a[j-1];
		a[j]=tmp;
	}
冒泡排序:


	int i=0,j=0;
	int tm]]></description><category></category></item><item><title><![CDATA[字符串相关问题]]></title><link>https://blog.youkuaiyun.com/drf1234/article/details/6692390</link><guid>https://blog.youkuaiyun.com/drf1234/article/details/6692390</guid><author>drf1234</author><pubDate>Tue, 16 Aug 2011 17:22:53 +0800</pubDate><description><![CDATA[snprintf/_snprintf函数的定义如下：
int snprintf(char *str, size_t count, const char *format, ...);
假设要复制的字符串format长度为len(不含\0)
在windows中,参见http:/]]></description><category></category></item><item><title><![CDATA[网络抓包]]></title><link>https://blog.youkuaiyun.com/drf1234/article/details/6600347</link><guid>https://blog.youkuaiyun.com/drf1234/article/details/6600347</guid><author>drf1234</author><pubDate>Tue, 12 Jul 2011 15:51:45 +0800</pubDate><description><![CDATA[很多抓包软件不支持环回端口抓包，那么....cmd下route add 本机ip mask 255.255.255.255 网关ip]]></description><category></category></item><item><title><![CDATA[GLIBC代码学习]]></title><link>https://blog.youkuaiyun.com/drf1234/article/details/6591396</link><guid>https://blog.youkuaiyun.com/drf1234/article/details/6591396</guid><author>drf1234</author><pubDate>Thu, 07 Jul 2011 22:53:21 +0800</pubDate><description><![CDATA[看K&R，在想这两个老家伙从哪里搞的UNIX标准库代码，搜了一下，就是glibc了。查看本机glibc版本号：把库文件当可执行文件执行一下。#/lib/libc.so.6GNU C Library (EGLIBC) stable release version 2.10.1, b]]></description><category></category></item><item><title><![CDATA[网络编程(linux)]]></title><link>https://blog.youkuaiyun.com/drf1234/article/details/6579952</link><guid>https://blog.youkuaiyun.com/drf1234/article/details/6579952</guid><author>drf1234</author><pubDate>Fri, 01 Jul 2011 17:12:00 +0800</pubDate><description><![CDATA[1.SOCKET基本用法(based on APUE UNP)#include int sock=socket(AF_INET,SOCK_STREAM,0);	            //默认协议是TCP socketint sock=socket(AF_INET,SOCK_DGRAM,0);		//默认协议是UDP socket in ret=shutdown(sock,SHUT_RD);			]]></description><category></category></item><item><title><![CDATA[VIM正则表达式的若干写法]]></title><link>https://blog.youkuaiyun.com/drf1234/article/details/6562809</link><guid>https://blog.youkuaiyun.com/drf1234/article/details/6562809</guid><author>drf1234</author><pubDate>Thu, 23 Jun 2011 10:39:00 +0800</pubDate><description><![CDATA[若干原创：1.某段落begin..(原文：其中没有begin和end)..end，需要在段首段尾添加head和tail。如head+begin....(原文).....end+tail%s/(begin\_.{-} end ) / head1tail/g(空格仅用于理解)%s/(begin\_.{-} end)/head1tail/g(去掉空格)其中\_]]></description><category></category></item><item><title><![CDATA[Mysql基本使用说明]]></title><link>https://blog.youkuaiyun.com/drf1234/article/details/6531765</link><guid>https://blog.youkuaiyun.com/drf1234/article/details/6531765</guid><author>drf1234</author><pubDate>Wed, 08 Jun 2011 14:50:00 +0800</pubDate><description><![CDATA[ 一.Mysql远程访问：http://www.cnblogs.com/zqonline/archive/2010/09/02/1816290.html1. 3306端口是不是没有打开？使用nestat命令查看3306端口状态：~# netstat -an | grep 3306tcp        0      0 127.0.0.1:3306          0.0.0.]]></description><category></category></item><item><title><![CDATA[FaWave恢复twitter的办法]]></title><link>https://blog.youkuaiyun.com/drf1234/article/details/6272198</link><guid>https://blog.youkuaiyun.com/drf1234/article/details/6272198</guid><author>drf1234</author><pubDate>Wed, 23 Mar 2011 20:07:00 +0800</pubDate><description><![CDATA[<br />低调宣传，差点因此去钻研chrome插件写法。<br />fawave=>选项，进入fawave设置<br />按住ctrl+shift+j启动chrome审查元素的界面，在下方空白输入下文后回车。twitter的配置界面就恢复了。<br /> <br />$("#account-blogType").append("<option value='twitter'>twitter</option>" ]]></description><category></category></item><item><title><![CDATA[Linux Device Drivers读书笔记01-03章]]></title><link>https://blog.youkuaiyun.com/drf1234/article/details/6265563</link><guid>https://blog.youkuaiyun.com/drf1234/article/details/6265563</guid><author>drf1234</author><pubDate>Mon, 21 Mar 2011 17:49:00 +0800</pubDate><description><![CDATA[英文第三版 http://books.google.com/books?id=M7RHMACEkg4C&printsec=frontcover#v=onepage&q&f=false01 An Introduction to Device Drivers 01章 An Introduction to Device Drivers驱动的角色policy:    how to usecapabilityGnomeftp httpmechanism: what to be providedX ServTCP/IP]]></description><category></category></item><item><title><![CDATA[嵌入式Linux下3G无线上网卡的驱动【DM365+EC189】]]></title><link>https://blog.youkuaiyun.com/drf1234/article/details/6259581</link><guid>https://blog.youkuaiyun.com/drf1234/article/details/6259581</guid><author>drf1234</author><pubDate>Fri, 18 Mar 2011 17:12:00 +0800</pubDate><description><![CDATA[环境：硬件：合众达DVS365开发板，芯片DaVinci DM365.电信华为EC189的3G无线上网卡。软件：TI定制的嵌入式arm-linux，内核版本2.6.18.简介：由于3G无线上网卡工作模式相同，故其移植也大多雷同，故本次开发同样适用于其他嵌入式开发板，如DM6446，ARM等等。同样，也适用于其他联通、移动或电信的3G上网卡，尤其是华为的上网卡，如最常用的华为E160, E160G, E169, E180, E230, E270(+), E280, E630, E870, E1550, E16]]></description><category></category></item><item><title><![CDATA[公网与私网隔离]]></title><link>https://blog.youkuaiyun.com/drf1234/article/details/6157192</link><guid>https://blog.youkuaiyun.com/drf1234/article/details/6157192</guid><author>drf1234</author><pubDate>Fri, 21 Jan 2011 15:42:00 +0800</pubDate><description><![CDATA[<br />接触了安防的一些东西，了解到公网与私网如何隔离了<br />小流量控制数据走串口线//这个如何防范<br />视频走视频线]]></description><category></category></item></channel></rss>