<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[iicooder的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/iicooder</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; iicooder]]></copyright><item><title><![CDATA[ZOJ2136解题报告]]></title><link>https://blog.youkuaiyun.com/iicooder/article/details/7754532</link><guid>https://blog.youkuaiyun.com/iicooder/article/details/7754532</guid><author>iicooder</author><pubDate>Tue, 17 Jul 2012 11:10:58 +0800</pubDate><description><![CDATA[算法分析：这是个动态规划的问题，先求其子集，保存子集的结果，然后在子集的基础上再进行计算。此题要求最大升序子序列的长度，可以逆向考虑，先计算以第i个数为终点的最大升序子序列的长度，然后计算i后面的类似子序列。遍历的时候从首部开始，依次计算，最后求出最大的升序子序列。
数据结构：使用数组，vector.
代码实现：
#include 
#include 
#include 
using nam]]></description><category></category></item><item><title><![CDATA[boj64解题报告]]></title><link>https://blog.youkuaiyun.com/iicooder/article/details/7753021</link><guid>https://blog.youkuaiyun.com/iicooder/article/details/7753021</guid><author>iicooder</author><pubDate>Mon, 16 Jul 2012 20:55:37 +0800</pubDate><description><![CDATA[算法分析：问题是所有小朋友都能拿到喜欢的糖果的概率。这是个“且”的关系。根据每个小朋友喜欢的糖果颜色，计算在此次能拿到匹配的糖果的概率，然后加入a颗不同颜色的糖果，等待下次抽取。以此，计算满足所有小朋友爱好的概率。
数据结构：使用vector存储小朋友的爱好，以及原始糖果数量。
代码实现：
#include 
#include 
#include 
#include 
#include 
u]]></description><category></category></item><item><title><![CDATA[计算n的阶乘]]></title><link>https://blog.youkuaiyun.com/iicooder/article/details/7423797</link><guid>https://blog.youkuaiyun.com/iicooder/article/details/7423797</guid><author>iicooder</author><pubDate>Tue, 03 Apr 2012 16:35:27 +0800</pubDate><description><![CDATA[#include 
int f(int n)
{
    int k;
    if(n > 1) k = n*f(n-1);
    else return 1;
    return k;    
} 

int main(int argc,char *argv[])
{
    int k = 4;
    printf("%d",f(k));
    getchar();
    retu]]></description><category></category></item><item><title><![CDATA[函数调用计算面积]]></title><link>https://blog.youkuaiyun.com/iicooder/article/details/7312981</link><guid>https://blog.youkuaiyun.com/iicooder/article/details/7312981</guid><author>iicooder</author><pubDate>Fri, 02 Mar 2012 16:48:22 +0800</pubDate><description><![CDATA[#include 
#include 
#define PI 3.1415926

float area(float r);
float perimeter(float r);

int main(int argc,char* argv[])
{
    float r;
    float s,l;
    printf("input radius:\n");
    scanf("%f",&r]]></description><category></category></item><item><title><![CDATA[scanf函数]]></title><link>https://blog.youkuaiyun.com/iicooder/article/details/7309240</link><guid>https://blog.youkuaiyun.com/iicooder/article/details/7309240</guid><author>iicooder</author><pubDate>Thu, 01 Mar 2012 11:41:49 +0800</pubDate><description><![CDATA[//#include "stdafx.h"
#include 
#include 


int main( )
{
    char string[50];
    
    scanf("%[^\n]",string);// %[] 扫描字符集合，直到回车换行符号为结束。

    printf("%s\n",string);
    
    
    
   /* char str[80];]]></description><category></category></item><item><title><![CDATA[关于multimap]]></title><link>https://blog.youkuaiyun.com/iicooder/article/details/7307647</link><guid>https://blog.youkuaiyun.com/iicooder/article/details/7307647</guid><author>iicooder</author><pubDate>Wed, 29 Feb 2012 21:08:30 +0800</pubDate><description><![CDATA[multimap与map基本相同，唯独不同的是multimap允许插入重复键值的元素，而map不允许插入重复键值。
#pragma warning(disable:4786)
#include
#include
#include

using namespace std;

int main(int argc,char* argv[])
{
    multimap m;]]></description><category></category></item><item><title><![CDATA[一道算法题。]]></title><link>https://blog.youkuaiyun.com/iicooder/article/details/7244839</link><guid>https://blog.youkuaiyun.com/iicooder/article/details/7244839</guid><author>iicooder</author><pubDate>Thu, 09 Feb 2012 11:26:32 +0800</pubDate><description><![CDATA[题目是这样的：N team competitions, numbered 0,1,2 respectively. . . . N-1, known comparison of strength of relationship, stored in a two-dimensional array w[n][n ], w[i][j ] represents the value of a number]]></description><category></category></item><item><title><![CDATA[一道算法题的解析]]></title><link>https://blog.youkuaiyun.com/iicooder/article/details/7242055</link><guid>https://blog.youkuaiyun.com/iicooder/article/details/7242055</guid><author>iicooder</author><pubDate>Wed, 08 Feb 2012 12:31:13 +0800</pubDate><description><![CDATA[看到过这么一个算法题，据说是一个面试题。一个整数数组，包含有正数和负数，重新排列使负数排在正数前面，并且要求不改变原来的正负数之间相对顺序 比如： input: 1,7,-5,9,-12,15 ans: -5,-12,1,7,9,15 要求时间复杂度O(N),空间O(1)
    先看个时间复杂度O（n^2）的：
for(i=n-1; i>=0; i--)
{
    int j=i;]]></description><category></category></item><item><title><![CDATA[set集合容器]]></title><link>https://blog.youkuaiyun.com/iicooder/article/details/7230638</link><guid>https://blog.youkuaiyun.com/iicooder/article/details/7230638</guid><author>iicooder</author><pubDate>Fri, 03 Feb 2012 10:57:46 +0800</pubDate><description><![CDATA[#include
#include

using namespace std;

int main(int argc,char* argv[])
{
    set s;
	s.insert(8);
	s.insert(1);
	s.insert(12);
	s.insert(6);
	s.insert(8);//重复，无法插入

	set::iterator it;]]></description><category></category></item><item><title><![CDATA[sstream]]></title><link>https://blog.youkuaiyun.com/iicooder/article/details/7230070</link><guid>https://blog.youkuaiyun.com/iicooder/article/details/7230070</guid><author>iicooder</author><pubDate>Fri, 03 Feb 2012 08:29:41 +0800</pubDate><description><![CDATA[#include
#include
#include

using namespace std;
//C++方法，将数值转化为string。
string converttostring(double x)
{
    ostringstream o;
	if(o<<x)
		return o.str();
	return "error";
}
//C++方法，将stri]]></description><category></category></item><item><title><![CDATA[sscanf函数]]></title><link>https://blog.youkuaiyun.com/iicooder/article/details/7229508</link><guid>https://blog.youkuaiyun.com/iicooder/article/details/7229508</guid><author>iicooder</author><pubDate>Thu, 02 Feb 2012 20:15:39 +0800</pubDate><description><![CDATA[#include
#include

using namespace std;

int main(int argc,char* argv[])
{
    string s1,s2,s3;
	char sa[100],sb[100],sc[100];
//把一个字符串分离成字串，分隔符为空格。
	sscanf("abc 123 pc","%s %s %s",sa,sb,sc)]]></description><category></category></item><item><title><![CDATA[string对象与字符数组互操作]]></title><link>https://blog.youkuaiyun.com/iicooder/article/details/7228496</link><guid>https://blog.youkuaiyun.com/iicooder/article/details/7228496</guid><author>iicooder</author><pubDate>Thu, 02 Feb 2012 15:04:34 +0800</pubDate><description><![CDATA[#include
#include

using namespace std;

int main(int argc,char* argv[])
{
    string s;
	char ss[100];

	scanf("%s",&ss);//输入字符串到字符数组中

	s=ss;

	printf(s.c_str());//printf输出字符串对象，要采用c_s]]></description><category></category></item><item><title><![CDATA[string类型的数字化处理]]></title><link>https://blog.youkuaiyun.com/iicooder/article/details/7227962</link><guid>https://blog.youkuaiyun.com/iicooder/article/details/7227962</guid><author>iicooder</author><pubDate>Thu, 02 Feb 2012 11:59:36 +0800</pubDate><description><![CDATA[#include
#include
#include
#include

using namespace std;

int main(int argc,char* argv[])
{
    string s;
	s="1234059";

	int i;
	int sum=0;

	for(i=0;i<s.length ();i++)
	{
	    if(s]]></description><category></category></item><item><title><![CDATA[string对象的比较]]></title><link>https://blog.youkuaiyun.com/iicooder/article/details/7227846</link><guid>https://blog.youkuaiyun.com/iicooder/article/details/7227846</guid><author>iicooder</author><pubDate>Thu, 02 Feb 2012 11:42:26 +0800</pubDate><description><![CDATA[#include
#include

using namespace std;

int main(int argc,char* argv[])
{
    string s;
	s.append("cat dog cat");
//s比cat字串大，返回1
    cout<<s.compare ("cat")<<endl;
//s与cat dog cat字串相等，返回0]]></description><category></category></item><item><title><![CDATA[字符串的查找]]></title><link>https://blog.youkuaiyun.com/iicooder/article/details/7227494</link><guid>https://blog.youkuaiyun.com/iicooder/article/details/7227494</guid><author>iicooder</author><pubDate>Thu, 02 Feb 2012 10:21:21 +0800</pubDate><description><![CDATA[#include
#include

using namespace std;

int main(int argc,char* argv[])
{
    string s;
	s.append("cat dog cat");

    cout<<s.find ('c')<<endl;//查找第一个字符'c'，返回下标值

	cout<<s.find ("c")<<en]]></description><category></category></item><item><title><![CDATA[字符串的长度]]></title><link>https://blog.youkuaiyun.com/iicooder/article/details/7227399</link><guid>https://blog.youkuaiyun.com/iicooder/article/details/7227399</guid><author>iicooder</author><pubDate>Thu, 02 Feb 2012 09:59:44 +0800</pubDate><description><![CDATA[#include
#include

using namespace std;

int main(int argc,char* argv[])
{
    string s,t;
	/*s.append("123456");
	string::iterator it=s.begin ();
	s.erase(it+2);
    cout<<s<<endl;]]></description><category></category></item><item><title><![CDATA[算法应用]]></title><link>https://blog.youkuaiyun.com/iicooder/article/details/7226587</link><guid>https://blog.youkuaiyun.com/iicooder/article/details/7226587</guid><author>iicooder</author><pubDate>Wed, 01 Feb 2012 19:38:34 +0800</pubDate><description><![CDATA[分治法(二分检索,快速排序,归并排序),
    贪心算法(Huffman编码,Prim算法,Kruskal算法,Dijstra算法),
    动态规划(Prim算法,Dijstra算法,Floyd算法,最佳二叉搜索树),
    栈的引用(深度优先周游),
    队列的应用(广度优先周游]]></description><category></category></item><item><title><![CDATA[位操作运算]]></title><link>https://blog.youkuaiyun.com/iicooder/article/details/7224581</link><guid>https://blog.youkuaiyun.com/iicooder/article/details/7224581</guid><author>iicooder</author><pubDate>Wed, 01 Feb 2012 10:01:38 +0800</pubDate><description><![CDATA[前些天遇到一段关于c语言位运算的代码。
     英文原文如下：
    As an illustration of some of the bit operators, consider the function getbits(x,p,n) that returns the (right adjusted) n-bit
    field of x that begins at posi]]></description><category></category></item><item><title><![CDATA[搜索引擎原理及其组成部分和功能]]></title><link>https://blog.youkuaiyun.com/iicooder/article/details/7224420</link><guid>https://blog.youkuaiyun.com/iicooder/article/details/7224420</guid><author>iicooder</author><pubDate>Wed, 01 Feb 2012 08:54:08 +0800</pubDate><description><![CDATA[搜索引擎分为搜索器，索引器，检索器，人机接口四部分。建立索引是个复杂的过程，索引数据库是搜索引擎前端和后端的联系桥梁，可以说起到了管理器的作用。
     下面对整个过程做个简要介绍：

     (1)搜索器（俗称的网络蜘蛛Robot）从互联网上抓取网页，把网页送入网页数据库，从网页中“提取URL”，把URL送入URL数据库，网络蜘蛛根据得到网页的URL，继续抓取其它网页，反复循环直到把所]]></description><category></category></item><item><title><![CDATA[大小端模式]]></title><link>https://blog.youkuaiyun.com/iicooder/article/details/7222903</link><guid>https://blog.youkuaiyun.com/iicooder/article/details/7222903</guid><author>iicooder</author><pubDate>Tue, 31 Jan 2012 19:15:15 +0800</pubDate><description><![CDATA[大端模式：数据的高字节存储在低地址中，而字数据的低字节则存放在高地址中。
小端模式：大端存储格式相反，在小端存储格式中，低地址中存放的是字数据的低字节，高地址存放的是字数据的高字节。]]></description><category></category></item></channel></rss>