lzaiwei的专栏

#include using namespace std;int BitOneNumbers(int i);int main(){ int i; cin>>i; int numbers=BitOneNumbers(i); system("pause"); return 0;}int BitOneNumbers(int i){ int counts=0; wh

#include #include using namespace std;class Solution {public: int lengthOfLongestSubstring(string s) { int length_substr=0; int temp=0; int hashTable[256]; int i=0; while (i!=256) {

#include using namespace std;//创建树结构typedef struct node{ int data; struct node *ltree,*rtree;}*BitTree,bitTree;//创建树函数void creat_tree(BitTree &tree);void MirrorRecursively(BitTree &pNode);

/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode *addTw

#include #include using namespace std;//定义2*2矩阵struct Mxtri2{ Mxtri2(long long m00=0,long long m01=0,long long m10=0,long long m11=0) { m_00=m00; m_01=m01; m_10=m10; m_11=m11; } long

#include using namespace std;struct NodeLink{ int data_in; NodeLink *next;};NodeLink *Rever(NodeLink *node);int main(){ NodeLink *head,*Node,*temp; int data_in; cin>>data_in; Node=new No

#include #include #include using namespace std;class Solution {public: vector twoSum(vector &numbers, int target) { vector > temp; for( unsigned int i=0; i<numbers.size(); ++i ) { pai

#include #include using namespace std;//创建树结构typedef struct node{ int data; struct node *ltree,*rtree;}*BitTree,bitTree;//创建树函数void creat_tree(BitTree &tree);void MirrorRecursively(BitTree

#include using namespace std;typedef struct LinkNode{ int data_in; LinkNode *next;};LinkNode* LasterNum(LinkNode *node,int m);int main(){ LinkNode *node,*head; node=new LinkNode; head=n

#include #include using namespace std;long long CharToInt(char *str);int g_valid;enum Valid_str{ Valid=0, Invalid};int main(){ char *ch="-1232324324324"; long long num=CharToInt(ch); s

#include #include using namespace std;void StackToQueue(void);int main(){ StackToQueue(); system("pause"); return 0;}//实现stack to queuevoid StackToQueue(){ stack temp1; stack temp2; i

1、指针或者引用传递用作输出，不能用const修饰，或者失去输出功能；2、参数是指针，用const修饰，防止修改；值传递没有必要，因其使用的是其对应的副本；3、对于非内部数据类型，例如类，使用引用，不需要产生副本调用构造函数与析构函数，可以使用const修饰，对于正常类型按值传递，不需要使用引用，因效率差不多；4、const修饰函数返回，必须使用const变量接收；对于按值返回，加上c

#include #include using namespace std;char OutOnceTimes(string str);int main(){ string str; cin>>str; char OnceTime=OutOnceTimes(str); system("pause"); return 0;}char OutOnceTimes(stri

#include #include #include using namespace std;//创建树结构typedef struct node{ int data; struct node *ltree,*rtree;}*BitTree,bitTree;//创建树函数void creat_tree(BitTree &tree);void PrintFromTopToB

#include using namespace std;typedef struct NodeLink{ int data_in; NodeLink *next;};NodeLink* EndK(NodeLink *Node,int k);int main(){ NodeLink *node=NULL,*head,*temp; int data_in; node=

#include #include using namespace std;bool StackPop(int *p1,int *p2,int length);int main(){ int p1[]={1,2,3,4,5}; int p2[]={4,5,3,3,1}; bool xx=StackPop(p1,p2,5); system("pause"); return

#include using namespace std;int CountN(int number);int main(){ int m=5; int count_n=CountN(m); system("pause"); return 0;}int CountN(int number){ int number1=1; int number2=2; int c

#include using namespace std;//创建树节点结构体typedef struct TreeNode{ int data_in; TreeNode *m_left; TreeNode *m_right;}*BitTree,bitTree;//树高度int TreeHight(BitTree &bittree);//创建树节点void Creat

#include using namespace std;//创建数结构typedef struct node{ int data; struct node *ltree; struct node *rtree;}*BitTree,bitTree;void creat_tree(BitTree &tree);void pre_travel(BitTree &tree);v

#include using namespace std;//创建树结构typedef struct node{ int data; struct node *ltree,*rtree;}*BitTree,bitTree;//创建树函数void creat_tree(BitTree &tree);void mid_travel(BitTree tree,BitTree &bs

#include #include #include using namespace std;template class CStackWithMin{public: CStackWithMin(){}; virtual ~CStackWithMin(){}; T& top(void); const T& top(void) const; void push(const T

#include#define LENG 10using namespace std;int Max_num(int max_num[],int leng);int main(){ int data_in[LENG]; int max_data=0; for (int i=0;i>data_in[i]; } max_data=Max_num(data_in,LENG);

#include#include #include #include#includeusing namespace std;typedef multiset> HeapMax;//获取k个最小的数void Min_Num(unsigned int k,HeapMax& Heap_Max,vector &Data_vector);int main(){ std::vector

#include using namespace std;bool Veri_BST(int data_in[],int length);int main(){ int n; cin>>n; int *data_in=new int[n]; //输入数组 for (int i=0;i>data_in[i]; } bool ver=Veri_BST(data_in,n);

#include #include using namespace std;typedef struct BitTree{ int data; struct BitTree *m_pLeft,*m_pRight;}*NodeTree,nodetree;void Creat_Tree(NodeTree &tree);void FinfPath(NodeTree &path

#include #include using namespace std;void ReverseStr(char* str_in,char* str_out);void Reverse(char *pBegin,char *pEnd);int main(){ char* str_resever="I am a student"; char* str_return="";

1、面向对象热点COM和CORBA；2、不相干的比继承，逻辑相关则继承；3、若在逻辑A是B的一部分，不允许B从A派生，用A和其它组合出B；