C++

Prepare content: The address of the variable, the contents of the variable, direct addressing, and indirection.(1). The address of the variableThe first address of the storage space that the variable occupies in memory.(2). The contents of the

1#include 2 using namespacestd;3 4typedefstructTbtnode5 {6 Chardata;7 intLtag,rtag;8 structTbtnode *Lchild;9 structTbtnode *Rchild;Ten }tbtnode; One ATbtnode *Inittbtnode () - { -Tbtnode * p= (tbtnode*)malloc(sizeof(Tbtnode)); theP->

1. The difference between a pointer and a reference Answer: A, the pointer can be modified, the reference cannot be changed. B, the pointer occupies memory, the reference does not occupy memory. C, references cannot be null pointers

New and delete in C + + are operators, new assigns objects automatically call constructors, delete objects automatically call destructors, whereas the C language malloc () and free () are functions. In theory, malloc free and new and delete can be

Type conversion has C-style, and of course, C + + style. C-style conversion format is very simple (type) EXPRESSION, but C-style type conversion has a lot of shortcomings, sometimes with C-style conversion is not appropriate, because it can be

A few common librariesHttp://stackoverflow.com/questions/3637581/fastest-c-serialization Boost:fast, assorted C + + library including serialization Protobuf:fast Cross-platform, cross-language serialization with C + + module

Set is also a more common container in STL. The Set collection container realizes the data structure of the red and black tree's balanced binary tree, which automatically adjusts the arrangement of the binary tree and puts the elements in the

Virtual function declarations such as the following:Virtual returntype functionname (Parameter)The virtual function must be implemented, even if the null implementation, if not implemented, the compiler will error. Its purpose is to enable it to be

Map Map iterator Iterator invalidation Map initialization Map Insert Element MapThe feature of map is that all key values are automatically sorted. All elements are pair types , with both an entity value (value) and

/**************filename:server.cpp****************The program implements a simple HTTP server through a standard socketRunning the server can access the server directory through the browserHTML files and JPG Images complete the initial HTTP server

In use. NET, the metadata (metadata) and code are stored in the "self-contained" unit, which is called the assembly. We can access this information while the program is running.In System.Reflection there is a class ———— Assembly that we can use to

C # Get all property names for incoming objectsprolist P1 = new Prolist ();List lt = getattr (p1);Returns the property of the passed-in object using generics, namePublic list getattr (T dx){list ls = new list ();Type types = dx. GetType ();foreach

WinForm gets a collection of methods for the current path of the application, as follows, which is worth collecting//Gets the full path of the current process, including the file name (process name).String str =This. GetType ().

Test instructions: Give a rectangle of three kinds of operation, clockwise rotation, counterclockwise rotation, symmetry, give the original coordinates, and then give the operand, ask the last coordinates obtainedDraw a mock-up and you'll find the

Hdu 3791 Binary Search Tree, hdu1_1 Binary Search Tree Original question link: http://acm.hust.edu.cn/vjudge/problem/viewProblem.action? Id = 20911 Simple questions:1 # include 2 # include 3 # include 4 # include 5 # include 6 # include 7

[LeetCode] Isomorphic Strings Given two strings s and t, determine if they are isomorphic. Two strings are isomorphic if the characters in s can be replaced to get t. All occurrences of a character must be replaced with another character while

[Dp] poj 3661 Running Question: A cow can run for n minutes and its fatigue is limited to m. Next, you can run a [I] meters per minute. Then, you can choose to run or rest every minute. Fatigue increases by a little. Rest reduces fatigue every

String Simple Matching C ++ implementation /** The simple match of a string is compared once with each letter corresponding to the primary string, knowing that all the letters of a string match successfully */# include # Include #

POJ 1088 ski Memory search #include #include #include #include #include #include #include #include #include #include #include

POJ 3237 Tree (Tree link Division)  This question took one afternoon .. I have always thought that the arrays max and min do not need to be changed. I only need to change the lazy array, and then use the lazy mark to return the max or-min during the