fysy0000的专栏

/*Copyright personal all reversedAuthor   StevenDate   2011-06-28description:            input :          number array(positive and negative) in any sequence.   output          the sum of the longest

关于sizeof()的一些思考（转载）2007-10-21 20:35文章作者：lostinmymind原始连接：http://lostinmymind.blogchina.com/index.html关键字：sizeof，字节对齐，多继承，虚拟继承，成员函数指针前向声明：siz

/* Name: Copyright: Author: Date: 18/07/11 16:43 Description: 一颗完全2叉树深度设为D，root深度假设为1，树中每个节点是个开关，默认开关关闭，当小球到达节点时候，如果开关关闭则

#include #include #include using std::vector; using std::cin; using std::cout; using std::endl; int main() { int iHeight = 0;

#include using namespace std; /* 假设数组A[N]排序 == 数组 A[n-1]每一位于 A[N]最后一个元素A【N】交换的排序 */ void Swap(int& num1,int& num2) { int iT

#include #include using namespace std; int GetPos(int* piScr,int iStartIndex,int iEndIndex) { int iPos = iStartIndex; int iLef

#include using namespace std; #define NOT_IN 11111111 void SubAssemble(int* piScr,int iCurIndex,int iSize)//iCurIndex 可以等于 -1 因为 0的时候也有两种选择，

#include #include #include #include #include #include using namespace std; void ProduceRandString(char* pcScr,int size) {

// MathShortestPath.cpp : Defines the entry point for the console application. // #include "stdafx.h" #include #include bool IsPrim

#include using namespace std; // low to upper void CombinSort(int* aiScr ,int iStartIndex,int iEndIndex) { if(iEndIndex - iStartInd

/*  Name:   Copyright:   Author:   Date: 13/07/11 19:14  Description: */#include   #include   using namespace std;  void InitNext(

#include using namespace std; void GetNextArrary(string szPattern , int* aiNext) { aiNext[0] =-1; int iPatternLength = szPatt

//当然算法，还可以优化，就是求5因子的个数，因为2因子的个数明显多于5.void GetBytes(int num,int& byteNum2,int& byteNum5) { byteNum2 =0; byteNum5 =0; int iTem

#include  #include  #include  #includeusing namespace std;void Move(int arraya,int arrayb,char a,char b){   cout"}void Moved(int num,int a,i

超时

浅谈对STL  string的认识大体简单的可以理解为C++ string 为c字符操作数据的封装。private:       chr* m_pcdata; //存数据末尾是'\0'public:      Operation //各种字符串操作      ***默认strin

/*Name: Copyright: Author: Date: 10/07/11 21:33Description: define the carry symbol of each byte is iCarrydefine the sum  symbol of  each by

#include#includeusing namespace std;typedef enum eJudgedState{NOTHER,BOTH,PALIND,MIRRORED};struct stReversedWord{    char cOriginalWord;

#include using namespace std; int GetDiviedPosition(int* piScr,int iStartIndex,int iEndIndex) { int iTemp = 0; int iPos = iStar