菜鸟而已

#include #include #include using namespace std; typedef struct node { int data; struct node *next; }Node,*LinkList; LinkList Create_List_Tail(int length) {//建立链表 Node *L,*s,*r; //L指向头结点，r

#include bool Find(int *matrix, int rows, int columns, int number) { bool found = false; if(matrix != NULL && rows >

#include "stdio.h" /*length 为字符数组string的总容量*/ void ReplaceBlank(char string[], int length) { if(string == NULL && length <= 0) return; int original_Length = 0; //字符串string的实际长度

#include #include bool scanUnsignedInteger(const char** str) //判断是否是0-9之间的数字； { const char* before = *str; while(**str != '\0' && **str >= '0' && **str <= '9') ++(*str); // 当str

#include long long Fibonacci(unsigned n) {//简单的迭代方法，从下往上计算，首先根据f(0)和f(1)计算出f(2),再根据f(1)和f(2)计算出f(3)……以此类推。很容易理解，时间复杂度是O(n) int result[2]={0,1}; if(n<2) return result[n]; long long fx=0,fy=1,fn=

#include int NumberOf1_Solution1(int n) { int count = 0; unsigned int flag = 1; while (flag) { if (n & flag) count++; flag = flag << 1; } return

#include #include double PowerWithUnsignedExponent(double base, unsigned int exponent) { if (exponent == 0) return 1; if (exponent == 1) return base; double result = P

#include #include void PrintNumber(char* number); bool Increment(char* number); // ====================方法一==================== void Print1ToMaxN_1(int n) { if (n<= 0) return;

#include /* 在每轮匹配中，Patttern第二个字符是'*'时： 1、第一个字符不匹配（'.'与任意字符视作匹配），那么'*'只能代表匹配0次，比如'ba'与'a*ba'，字符串不变，模式向后移动两个字符，然后匹配剩余字符串和模式 2、第一个字符匹配，那么'*'可能代表匹配0次，1次，多次，比如'aaa'与'a*aaa'、'aba'与'a*ba'、'aaaba'与'a*ba'。匹配

#include #include using namespace std; //***************数据结构******************* template class CQueue{ public: CQueue(void); ~CQueue(void); void appendTail(const T& node); T deleteHead(); priv

#include bool duplicate_1(int numbers[],int length,int *duplication) {//思想：遍历数组，假设遇到数字j，则将j换到下标为j的位置上，若再遇到相同数字j，对应位置上的数字已经==j。返回。 if(numbers==NULL||length<=0) return false; for(int i=0;i<length;++

#include #include using namespace std; typedef struct Node { struct Node* left; struct Node* right; char data; }*BTree; BTree Construct_Tree(char* pre, char* in, int lengt

#include struct BinaryTreeNode {//数据结构 int m_nValue; //数值域 BinaryTreeNode* m_pLeft; //左孩子指针 BinaryTreeNode* m_pRight; //右孩子指针 BinaryTreeNode*

#include #define nullptr NULL struct BinaryTreeNode { double m_dbValue; BinaryTreeNode* m_pLeft; BinaryTreeNode* m_pRight; }; bool DoesTree1HaveTree2(Binary

#include #include #include #include using namespace std; typedef struct BTNode { char data; struct BTNode *lchild; struct BTNode *rchild; }BTNode,*BTree; void C

#include #define nullptr NULL struct BinaryTreeNode { int m_nValue; BinaryTreeNode* m_pLeft; BinaryTreeNode* m_pRight; }; BinaryTreeNode* CreateBinar

#include #include typedef struct node { int data; struct node *next; }Node,*LinkList; LinkList Create_Tail_LinkList(LinkList &L,int length) //尾插法建单链表 { Node * s,*r; L=(LinkList)malloc(sizeof(N

#include #include struct ListNode { int m_nValue; ListNode* m_pNext; }; ListNode* CreateListNode(int value) { ListNode* pNode = new ListNode(); pNode->m_nValue = value; pN

#include #include typedef struct node { int data; struct node *next; }Node,*LinkList; Node *FindKthToTail(LinkList L, unsigned int k) { if (L->next == NULL || k == 0

#include #include #define nullptr NULL struct ListNode { int m_nValue; ListNode* m_pNext; }; ListNode* CreateListNode(int value) { ListNode* pNode = new ListNode();

#include #include //****************************************宏定义****************************************************** typedef int ElemType; typedef struct node { ElemType data; struct node *next; }N

#include #include typedef struct Node { int data; struct Node *next; }LNode,*LinkList; LinkList Create_List() { int num; LNode *r,*s; LinkList L=(LinkList)malloc(sizeof(LNode)); L->next=NULL;

#include int movingCountCore(int threshold, int rows, int cols, int row, int col, bool* visited); bool check(int threshold, int rows, int cols, int row, int col, bool* visited); int getDigitSum(int

#include #include // ====================动态规划==================== int maxProductAfterCutting_solution1(int length) { if(length < 2) return 0; if(length == 2) return 1; if

#include void Reorder(int *pData, unsigned int length, bool (*func)(int)); bool isEven(int n); void ReorderOddEven(int *pData, unsigned int length) { Reorder(pData, length, isEven); } void Reo

#include void Print_Circle(int (*A)[3],int rows,int cols,int start) { int endX=cols-1-start; int endY=rows-1-start; //从左到右打印一行 for(int i=start;i<=endX;++i) printf("%d ",A[start][i]); //从上到下打印一列