C++

Today, I used some STL functions when I was doing C ++ Primer Chapter 1 exercise 14th, which completely overturned my views on C ++. In the past, I always thought C ++ was very troublesome. To implement a function, I had to write a bunch of code,

Problem:When writing a program, we often find that the program uses more memory than we applied for. In order to optimize the memory usage of the program, we want to optimize the memory usage, but I find that my Code cannot be optimized. What should

In efficient C ++ programming, we can see a good memory pool implementation solution. Here we share it and let's see what's wrong.The Code is as follows:Template Class CMemoryPool{Public:Enum {EXPANSION_SIZE = 32 }; CMemoryPool (unsigned int

MAP container1) concept: map is a container used to store data and retrieve data from a dataset. Its data composition includes two items: one is its data value and the other is the keyword used for sorting. The keyword is unique and used to sort

I. Example Generally, an automobile engine works in four states: suction, compression, power, and exhaust. During running, different States may have different behaviors. The current state machine will transition to the next state when

Features of member functions being overloaded:(1) the same range (in the same class );(2) The function name is the same;(3) parameters are different;(4) virtual keywords are optional.Override refers to the function of a derived class that overwrites

Although it is relatively simple, it is still a bit complicated for beginners. record it. Write a class for C ++ database operations.1 ADOConn. h01 # if! Defined (afx_adoconn_h000056a56674_91dc_43bb_bd09_9a0c8995161e00000000ded _)02 # define

Given two strings, character p corresponds to build a subtree, character e is white, and character f is black. Different layers of black spots f correspond to different values, the top part is 1024, and the bottom part is 256 for each subtree .....,

[Cpp]# Include # Include # Include Using namespace std;Const int n= 55009;Int n, q, a, B, fa [N], vis [N], ans [N], v [N], Max [N], Min [N], up [N], down [N];Vector need [N], edge [N], kv [N];Int find (int x){If (x = fa [x]) return x;Int y = fa [x];

Question: splay, interval reversal. [Cpp]# Include # Include # Include # Include # Include # Include # Include # Include # Include # Include # Include Using namespace std;# Define inf 0x3f3f3f# Deprecision Max 110# Define M 101000# Define keytree ch

[Cpp]# Include # Include # Include # Include # Include Using namespace std; Bool comp (const string & s1, const string & s2){Int I, j, k, m, n;Int c1 = 0, c2 = 0;For (I = 0; I {For (j = I + 1; j {If (s1 [I]> s1 [j])C1 ++;}}For (I = 0; I {For (j = I +

[Cpp]/****************************Directly select sorting for a single-chain table*******************************/# Include # Include Struct node{Int num;Struct node * next;};Struct node * head = NULL;Cre_list () // initialize the node{Head =

This question was solved only now when I did not understand the question at the time of last year's research and collection of topics. I am really sorry, ORZ, And it is weak, the status is not very good recently, so you need to adjust your

Concept When a subclass object passes a value to a Base class object, such as foo (Base derived_obj), the copy constructor of this Base class is called. at this time, the sub-class features will be cut, and only the operations related to the base

A man and a woman wash clothes together. It takes some time to wash clothes in different colors, in order not to allow two people to wash their clothes in one color, they must find the shortest time for the two to finish the clothes. Idea: This

Floyd + Lexicographic Order [Cpp]# Include "stdio. h"# Include "string. h"# Define INF 99999999Int map [505] [505], tax [505], path [505] [504];Int n;Void init (){Int I, j;For (I = 1; I For (j = 1; j If (I = j) map [I] [j] = 0;Else map [I] [j] = INF;

Hdu1671Phone ListSimple dictionary treeThe space for time is too expensive. If there are multiple groups of data, erLet's release it when it's used up.[Cpp]# Include Using namespace std; Struct trie{Bool exist;Int num;Trie * next [10];Trie (){Exist =

This question is the same as the above question 1201, so we only need to change the weight.Note that there are a lot of questions on this side. Well, I have worked with 100*10005. Later, I wanted to change to a loop queue. I didn't expect that the

The question of determining the strongly connected component of a directed graph. determining whether any two points are connected is to determining whether the strongly connected component is one. This question is to use two DFS to calculate the

Question: divide the tree to find the k-digit number in the interval. [Cpp]# Include # Include # Include # Include # Include # Include # Include # Include # Include # Include # Include Using namespace std;# Define inf 0x3f3f3f# Define M 110000Int