C++

Law of emeter) Definition: one object should have the least understanding of other objects The core concept of the dimit rule is inter-class decoupling and weak coupling. Only after weak coupling can the reusability of classes be improved.   The

We know that C ++ has the function overload concept. The function overload function is to rewrite a function multiple times so that it can have multiple types of parameters. Simply put, multiple functions are defined using the same function name.

A class with a virtual function has a pointer called a "virtual table" (the number of virtual functions has a number of pointers), which is used to point to this class of virtual function. That is, use it to determine the function to be called.For

I haven't done any algorithm questions for a long time. I will repeat several simple algorithm questions.Question 1: Calculate the largest sum of sub-ArraysThis is a very common algorithm question. Many people can quickly write algorithms, but many

I. Overview Definition: You can use a prototype instance to specify the object type and copy the prototype to create a new object. In other words, you do not need to reinitialize the object, but dynamically obtain the status of the object during

This article is from an excellent post of CU, which summarizes the static knowledge in a comprehensive manner, so I will share it with you.Generally, static refers to the concept of static storage. In fact, static in c ++ contains two meanings.1)

During the interview, some interviewers are very concerned about some special keywords in C ++;Sorted out some keywords that are more informative.• ExplicitUsed to declare constructors. The declared constructor is a display constructor and cannot be

I. Overview In the design and implementation of an object-oriented system, object creation is the most common operation. There is a problem here: if an application uses too many objects, it will cause a large storage overhead. Especially for a large

Overview: 1. Why do I need to use youyuan? Generally, for common functions, it is impossible to protect members of the category class. To do so, you must make all the members of the class public (shared ), however, the problem is that any external

# include  Using namespace std; Template Class TemplateClassTest{Public:TemplateClassTest (T & InA, T & InB): a (InA), B (InB ){}T & getA ();T & getB ();Private:T;T B;}; Template T & TemplateClassTest : getA (){Return;} Template T &

[Cpp]Void LoadResImage (int nResID, Image * & lpImage){HMODULE hModule = AfxGetInstanceHandle ();HRSRC hRsrc =: FindResource (hModule, MAKEINTRESOURCE (nResID), _ T ("PNG"); // typeIf (! HRsrc)Return;// Load resource into memoryDWORD len =

Volatile is interpreted as "unstable" in English, that is, the value of the variable modified with this keyword may be changed at any time. The type variables declared by the compiler can be changed by unknown factors, such as the operating system,

Question:1. Create a text file named textfile and write the following information to the file:C ++ lab!Input and output stream operations!Text File Created!Close the file, open the textfile file in input mode, read the data, and output the file

1. Memory Allocation Method(1) distribution from the static storage area. For example, static and global variables are used. The data in the static storage area has been allocated when the program is compiled. It exists during the running of the

Although C ++ is compatible with C, it also supports the type conversion usage of C language, that is, to enclose the type in parentheses. This conversion visibility is poor and it is difficult to track incorrect conversions. C ++ provides mandatory

Problem:Specify the coordinates of N points on the plane to locate the two closest points. Solution:We first sort the x coordinates of N points. We use the fast sorting method with the worst complexity O (n * logn, in the sorting process,

Calculate the width of a binary treeIdea: there are too many solutions for this question. You can search or use the shortest path. I wrote it with dijkstra () and reviewed the dijkstra algorithm. Code:[Cpp]# Include # Include # Include # Include #

The system size recognition code is provided for reference only.Traditional writing: Int get_order (){Union endian{Short s;Char c [2];} Order; Order. s = 0x1234; If (order. c [0] = 0x12 & order. c [1] = 0x34){Return 1;/* big endian */}Else{Return 0;/

250PT: Taxi departs from (0, 0) at a certain speed and the walking speed is also fixed, so the fastest must be walking all, or walking to a taxi and then taking a bus.You won't take two taxis. Enumerate all taxis.[Cpp]Class GrabbingTaxi {Public:Int

Question:In 1976 the ''four Color Map Theorem "was proven with the degree of a computer. this theorem states that every map can be colored using only four colors, in such a way that no region is colored using the same color as a neighbor region.Here