五条龙的博客

#include "iostream"#include #include "stack"using namespace std;struct BinaryTreeNode{ int data; BinaryTreeNode *left; BinaryTreeNode *right;};BinaryTreeNode* construct(int *preorder,int *ino

#include "iostream"#include "iomanip"#include "stack"#include "queue"using namespace std;struct BinaryTreeNode{ int data; BinaryTreeNode *left; BinaryTreeNode *right;};void printFromTopToBot

#include "iostream"#include "iomanip"#include "stack"#include "queue"using namespace std;struct BinaryTreeNode{ int data; BinaryTreeNode *left; BinaryTreeNode *right;};bool verifySquenceOfBS

#include "iostream"#include "iomanip"#include "stack"#include "queue"#include "vector"using namespace std;struct BinaryTreeNode{ int data; BinaryTreeNode *left; BinaryTreeNode *right;};void

#include "iostream"using namespace std;unsigned int FindFirstBitIs1(int num){ int indexBit = 0; while (((num & 1) == 0) && (indexBit < 8 * sizeof(int))) { num = num >> 1; ++indexBit; } ret

#include "iostream"using namespace std;int g_maxValue = 6;void PrintProbability(int number){ if (number < 1) return; int *pProbabilities[2]; pProbabilities[0] = new int[g_maxValue*number + 1]

#include "iostream"#include using namespace std;bool find(int *matrix,int rows,int columns,int number ){ bool find = false; if (matrix != NULL&&rows > 0 && columns > 0) { int row = 0; int co

#include "iostream"#include using namespace std;%length为字符数组p的总容量void replaceBlank(char *p,int length){ if (p == NULL || length <= 0) return; int blankNum = 0; int originalLength = 0; int i

#include "iostream"#include using namespace std;struct ListNode{ int data; ListNode *next;};void addToTail(ListNode **pHead,int value){ ListNode *pNew = new ListNode(); pNew->data = value; p

#include "iostream"#include using namespace std;struct ListNode{ int data; ListNode *next;};void removeNode(ListNode **pHead,int value){ if (*pHead == NULL) return; ListNode *tobedelete=NU

#include "iostream"#include #include "stack"using namespace std;struct ListNode{ int data; ListNode *next;};void printdigui(ListNode *pHead){ if (pHead!=NULL) if (pHead->next != NULL) pri

#include "iostream"using namespace std;struct BinaryTreeNode{ int data; BinaryTreeNode *left; BinaryTreeNode *right;};BinaryTreeNode *Convert(BinaryTreeNode *pRoot){ BinaryTreeNode *pLastNode

#include "iostream"using namespace std;struct BinaryTreeNode{ int data; BinaryTreeNode *left; BinaryTreeNode *right;};void Permutation(char * pStr, char *pBegin){ if (*pBegin == '\0') cout

#include "iostream"using namespace std;struct BinaryTreeNode{ int data; BinaryTreeNode *left; BinaryTreeNode *right;};int TreeDeep(BinaryTreeNode *pRoot){ if (pRoot == NULL) return 0; int

#include "iostream"using namespace std;int GetFirstK(int *data, int length,int k, int start,int end){ if (start > end) return -1; int middleIndex = (start + end) / 2; int middleData = data[mid

#include "iostream"using namespace std;struct BinaryTreeNode{ int data; BinaryTreeNode *left; BinaryTreeNode *right;};bool doesTree1HasTree2(BinaryTreeNode *pRoot1, BinaryTreeNode *pRoot2){ i

#include "iostream"#include #include "stack"using namespace std;template class cQueue{public: void appendTail(const T ¬es); T deleteHead();private: stack stack1; stack stack2;};template

#include "iostream"using namespace std;int randomInRange(int start,int end){return (rand() % (end-start+1) + start);}int partition(int data[],int length,int start,int end){if (data ==

#include "iostream"#include #include "stack"using namespace std;int minInOrder(int* number, int index1, int index2);int min(int *number,int length){ if (number == NULL || length <= 0) throw ne

#include "iostream"using namespace std;bool Increment(char *number){ int length = strlen(number); int index = length-1; bool isOverFlow = false; for (int i = index; i >= 0;i--) { if (isOverF

#include "iostream"using namespace std;void printNumber(char *number){ int length = strlen(number); bool isBegin0 = true; for (int i = 0; i < length;i++) { if (isBegin0&&number[i] != '0')

#include "iostream"using namespace std;void reOrder(int *data,int length){ if (data == NULL || length <= 0) return; int* start = data; int *end = data + length - 1; while (start<end) { whi

#include "iostream"using namespace std;const int gMaxLength=10;char* gCombine1 = new char[gMaxLength * 2 + 1];char* gCombine2 = new char[gMaxLength * 2 + 1];int compare(const void* strNum1, const

#include "iostream"using namespace std;int Min(int num1,int num2,int num3){ int min = num1 < num2 ? num1 : num2; min = min < num3 ? min : num3; return min;}int GetUglyNumber(int index){ if (

#include "iostream"using namespace std;int InversePairsCore(int* data,int* copy,int start,int end){ if (start==end) { copy[start] = data[start]; return 0; } int length = (end - start) / 2;

#include "iostream"using namespace std;struct ListNode{ int data; ListNode *pnext;};ListNode* merge(ListNode *pHead1,ListNode *pHead2){ if (pHead1 == NULL) return pHead2; else if (pHead2 ==

#include "iostream"#include "iomanip"using namespace std;struct BinaryTreeNode{ int data; BinaryTreeNode *left; BinaryTreeNode *right;};void printMatrix(int number[][4],int rows,int columns){

#include "iostream"using namespace std;struct BinaryTreeNode{ int data; BinaryTreeNode *left; BinaryTreeNode *right;};void mirrorRecursively(BinaryTreeNode *pNode){ if ((pNode == NULL) || (pN

题目描述给定一个字符串，问是否能通过添加一个字母将其变为回文串。输入描述:一行一个由小写字母构成的字符串，字符串长度小于等于10。 输出描述:输出答案(YES\NO). 输入例子:coco 输出例子:YES#include#include#include#include #include using