<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[richrdbird的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/richrdbird</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; richrdbird]]></copyright><item><title><![CDATA[循环有序数组/旋转数组的二分查找]]></title><link>https://blog.youkuaiyun.com/richrdbird/article/details/52853140</link><guid>https://blog.youkuaiyun.com/richrdbird/article/details/52853140</guid><author>richrdbird</author><pubDate>Tue, 18 Oct 2016 21:44:42 +0800</pubDate><description><![CDATA[转载于 http://blog.sina.com.cn/s/blog_a2498b5b01014bsg.html
类似问题：循环有序数组/旋转数组的最小值 《剑指offer》P66


#include 
using namespace std;

int binarySearch(int a[],int low,int high,int value)  //二分查找
{
  if(low]]></description><category></category></item><item><title><![CDATA[背包问题]]></title><link>https://blog.youkuaiyun.com/richrdbird/article/details/52796029</link><guid>https://blog.youkuaiyun.com/richrdbird/article/details/52796029</guid><author>richrdbird</author><pubDate>Wed, 12 Oct 2016 12:38:30 +0800</pubDate><description><![CDATA[#include 
using namespace std;

// 参考 http://baike.baidu.com/link?url=kOn5J1ionfV40_l4SagPK3aO6vu6TAB4r9iPociRXEm6R0Er8JEb4wpE2_53GJe8vPQ-KLb8-Au6r3N4K8h6PDpxqMhyEkxWxZoFWcqlqfZhZJCjuFTVixTVbZx1Fzu7]]></description><category></category></item><item><title><![CDATA[打印1到最大的n位数]]></title><link>https://blog.youkuaiyun.com/richrdbird/article/details/52788013</link><guid>https://blog.youkuaiyun.com/richrdbird/article/details/52788013</guid><author>richrdbird</author><pubDate>Tue, 11 Oct 2016 14:44:39 +0800</pubDate><description><![CDATA[#include 
#include 
using namespace std;

// 参考《剑指offer》P94

bool increment_number(char *number){
  int take_over = 0;
  int len = strlen(number);
  for (int i = len - 1; i >= 0; --i){
    int sum = n]]></description><category></category></item><item><title><![CDATA[最近共同祖先]]></title><link>https://blog.youkuaiyun.com/richrdbird/article/details/52778128</link><guid>https://blog.youkuaiyun.com/richrdbird/article/details/52778128</guid><author>richrdbird</author><pubDate>Mon, 10 Oct 2016 15:24:09 +0800</pubDate><description><![CDATA[#include 
#include 
using namespace std;

// 参考 http://blog.youkuaiyun.com/cxllyg/article/details/7635992
// 参考 《剑指offer》P256

struct node{
  int data;
  node *left;
  node *right;

  node(const int &x, nod]]></description><category></category></item><item><title><![CDATA[sql查询关键词的书写顺序与执行顺序]]></title><link>https://blog.youkuaiyun.com/richrdbird/article/details/52530204</link><guid>https://blog.youkuaiyun.com/richrdbird/article/details/52530204</guid><author>richrdbird</author><pubDate>Tue, 13 Sep 2016 22:20:23 +0800</pubDate><description><![CDATA[参考 http://www.cnblogs.com/Jessy/p/3527091.html




查询中用到的关键词主要包含六个，并且他们的书写顺序为
select--from--where--group by--having--order by


其中select和from是必须的，其他关键词是可选的，这六个关键词的执行顺序与书写顺序并不是一样的，执行顺序为
from-]]></description><category></category></item><item><title><![CDATA[整数转字符串]]></title><link>https://blog.youkuaiyun.com/richrdbird/article/details/52490516</link><guid>https://blog.youkuaiyun.com/richrdbird/article/details/52490516</guid><author>richrdbird</author><pubDate>Fri, 09 Sep 2016 21:03:24 +0800</pubDate><description><![CDATA[#include 
#include 

using namespace std;

int main(){
  int i = 12345;

  int max_length = 80;
  char *chars = new char[max_length];
  sprintf(chars, "%i", i);

  string str = string(chars);

  int t]]></description><category></category></item><item><title><![CDATA[字符串转整数]]></title><link>https://blog.youkuaiyun.com/richrdbird/article/details/52490472</link><guid>https://blog.youkuaiyun.com/richrdbird/article/details/52490472</guid><author>richrdbird</author><pubDate>Fri, 09 Sep 2016 20:54:42 +0800</pubDate><description><![CDATA[#include 
#include 

using namespace std;

int myAtoi(string str) {
    string s = str;
    int index = 0;

    bool flag = true;
    if (str.size() == 0){
        return 0;
    }
    while (s[index]]]></description><category></category></item><item><title><![CDATA[死锁]]></title><link>https://blog.youkuaiyun.com/richrdbird/article/details/52475587</link><guid>https://blog.youkuaiyun.com/richrdbird/article/details/52475587</guid><author>richrdbird</author><pubDate>Thu, 08 Sep 2016 22:01:02 +0800</pubDate><description><![CDATA[死锁条件
互斥条件（Mutual exclusion）：资源不能被共享，只能由一个进程使用。
请求与保持条件（Hold and wait）：已经得到资源的进程可以再次申请新的资源。
非剥夺条件（No pre-emption）：已经分配的资源不能从相应的进程中被强制地剥夺。
循环等待条件（Circular wait）：系统中若干进程组成环路，该环路中每个进程都在等待相邻进程正占用的资源。]]></description><category></category></item><item><title><![CDATA[简析TCP的三次握手与四次分手]]></title><link>https://blog.youkuaiyun.com/richrdbird/article/details/52471815</link><guid>https://blog.youkuaiyun.com/richrdbird/article/details/52471815</guid><author>richrdbird</author><pubDate>Thu, 08 Sep 2016 15:19:53 +0800</pubDate><description><![CDATA[转载于 http://www.jellythink.com/archives/705









三次握手

第一次握手：建立连接。客户端发送连接请求报文段，将SYN位置为1，Sequence
 Number为x；然后，客户端进入SYN_SEND状态，等待服务器的确认；第二次握手：服务器收到SYN报文段。服务器收到客户端的SYN报文段，需要对这个SYN报文段进行确认]]></description><category></category></item><item><title><![CDATA[python yield和generator]]></title><link>https://blog.youkuaiyun.com/richrdbird/article/details/51569186</link><guid>https://blog.youkuaiyun.com/richrdbird/article/details/51569186</guid><author>richrdbird</author><pubDate>Thu, 02 Jun 2016 18:16:44 +0800</pubDate><description><![CDATA[def fab(max):
	n, a, b = 0, 0, 1
	while n < max:
		yield b
		# print b
		a, b = b, a + b
		n = n + 1

# for n in fab(5):
# 	print n

f = fab(5)
print f.next()
print f.next()
print f.next()
print f.nex]]></description><category></category></item><item><title><![CDATA[HTTP状态码]]></title><link>https://blog.youkuaiyun.com/richrdbird/article/details/51464470</link><guid>https://blog.youkuaiyun.com/richrdbird/article/details/51464470</guid><author>richrdbird</author><pubDate>Fri, 20 May 2016 21:00:51 +0800</pubDate><description><![CDATA[http://www.w3school.com.cn/tags/html_ref_httpmessages.asp




1xx: 信息





消息:

描述:



100 Continue

服务器仅接收到部分请求，但是一旦服务器并没有拒绝该请求，客户端应该继续发送其余的请求。



101 Switching Protocols

服务]]></description><category></category></item><item><title><![CDATA[读入一行以空格隔开的参数]]></title><link>https://blog.youkuaiyun.com/richrdbird/article/details/51453053</link><guid>https://blog.youkuaiyun.com/richrdbird/article/details/51453053</guid><author>richrdbird</author><pubDate>Thu, 19 May 2016 13:18:12 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
using namespace std;

//读入一行以空格隔开的参数
//1. 用getline从控制台读入一行
//2. 利用istringstream对象绑定一行字符串
//这种方式可以免去手动切割字符串的复杂操作，解决了while (cin >> s)无法终止循环的问题
int main()
{
  stri]]></description><category></category></item><item><title><![CDATA[输入输出运算符重载]]></title><link>https://blog.youkuaiyun.com/richrdbird/article/details/51452962</link><guid>https://blog.youkuaiyun.com/richrdbird/article/details/51452962</guid><author>richrdbird</author><pubDate>Thu, 19 May 2016 12:52:52 +0800</pubDate><description><![CDATA[#include 
#include 
using namespace std;

//输入输出流运算符重载有两点需要注意
//1. 函数参数要用引用，primer上是这样解释的：不用引用的话就是按值传递，而iostream规定是不允许拷贝其副本的，所以必须要用引用
//2. 函数返回值应当是函数参数中输入输出流的引用，这是为了适用于连续输入输出的情形，具体见下面的例子
//参考 http://b]]></description><category></category></item><item><title><![CDATA[函数模板隐式调用时的优先级]]></title><link>https://blog.youkuaiyun.com/richrdbird/article/details/51452322</link><guid>https://blog.youkuaiyun.com/richrdbird/article/details/51452322</guid><author>richrdbird</author><pubDate>Thu, 19 May 2016 11:19:17 +0800</pubDate><description><![CDATA[#include 
#include 
using namespace std;

//当函数模板隐式调用时，若同时存在模板函数和非模板函数，优先匹配非模板函数
template
inline void foo(T a) {
  cout << "in template\t" << a << endl;
}

inline void foo(int a) {
  cout << "in speci]]></description><category></category></item><item><title><![CDATA[二叉树的非递归遍历]]></title><link>https://blog.youkuaiyun.com/richrdbird/article/details/51399607</link><guid>https://blog.youkuaiyun.com/richrdbird/article/details/51399607</guid><author>richrdbird</author><pubDate>Fri, 13 May 2016 23:30:05 +0800</pubDate><description><![CDATA[参考http://www.cnblogs.com/dolphin0520/archive/2011/08/25/2153720.html 的5楼回复


#include 
#include 
using namespace std;

struct Node {
  int data;
  Node *left;
  Node *right;

  Node(int d, Node *l ]]></description><category></category></item><item><title><![CDATA[虚函数的内存结构]]></title><link>https://blog.youkuaiyun.com/richrdbird/article/details/51399415</link><guid>https://blog.youkuaiyun.com/richrdbird/article/details/51399415</guid><author>richrdbird</author><pubDate>Fri, 13 May 2016 22:58:54 +0800</pubDate><description><![CDATA[//参考http://www.cnblogs.com/Ripper-Y/archive/2012/05/15/2501930.html
//参考http://blog.youkuaiyun.com/haoel/article/details/1948051/
#include 
using namespace std;

class base {
  virtual void f(){ cout<<"base]]></description><category></category></item><item><title><![CDATA[图的实现、无向图的最小生成树、有向图的最短路径]]></title><link>https://blog.youkuaiyun.com/richrdbird/article/details/51335357</link><guid>https://blog.youkuaiyun.com/richrdbird/article/details/51335357</guid><author>richrdbird</author><pubDate>Fri, 06 May 2016 23:08:59 +0800</pubDate><description><![CDATA[graph.h
#ifndef __GRAPH__
#define __GRAPH__

#include 
#include 
using namespace std;

class DisjointSet;

template 
class Graph {
public:
  virtual bool insert(int u, int v, TypeOfEdge weight) = 0;]]></description><category></category></item><item><title><![CDATA[函数模板与类模板]]></title><link>https://blog.youkuaiyun.com/richrdbird/article/details/51307111</link><guid>https://blog.youkuaiyun.com/richrdbird/article/details/51307111</guid><author>richrdbird</author><pubDate>Tue, 03 May 2016 19:33:14 +0800</pubDate><description><![CDATA[参考http://blog.youkuaiyun.com/csw_100/article/details/5844615


#include 
using namespace std;

template 
void func(T a){
  cout << a << endl;
}

template 
class A{
public:
  A(T a):data(a){}
  T data;]]></description><category></category></item><item><title><![CDATA[重载、覆盖、重写(隐藏)]]></title><link>https://blog.youkuaiyun.com/richrdbird/article/details/51287853</link><guid>https://blog.youkuaiyun.com/richrdbird/article/details/51287853</guid><author>richrdbird</author><pubDate>Sat, 30 Apr 2016 21:08:15 +0800</pubDate><description><![CDATA[#include 
#include 
using namespace std;


/*
参考http://www.cnblogs.com/itech/archive/2010/06/04/1751532.html

Overload(重载)：在C++程序中，可以将语义、功能相似的几个函数用同一个名字表示，但参数或返回值不同（包括类型、顺序不同），即函数重载。
（1）相同的范围（在同一个类中）；]]></description><category></category></item><item><title><![CDATA[大小端判断]]></title><link>https://blog.youkuaiyun.com/richrdbird/article/details/51286254</link><guid>https://blog.youkuaiyun.com/richrdbird/article/details/51286254</guid><author>richrdbird</author><pubDate>Sat, 30 Apr 2016 13:35:22 +0800</pubDate><description><![CDATA[#include 
#include 
using namespace std;


int main()
{
  //小端 数据高字节保存在内存高地址，地址由大向小增长
  //对以下两种方法，小端输出4 3 2 1

  //方法1
  union {
    int i;
    char c[sizeof(int)];
  }un;
  un.i = 0x01020304;
  cout ]]></description><category></category></item></channel></rss>