C++

Pointer: variable, the stored value is the address of another variable, and the type of the pointer depends on the type of variable pointed to. The pointer must be initialized when used, or it is a wild pointer. The junk address will be stored.      

Prototype traps:We should pay attention to two kinds of behavior when dealing with the prototype problem.1. When we perform a complete substitution of the prototype object, it is possible to trigger some kind of exception in the prototype chain.2.

Reprinted from: http://news.ccidnet.com/art/32855/20100713/2114025_1.htmlAuthor: MT1 new operator, also called new expression; new expressions are common and most commonly used, for example:string* PS = new string ("abc");The above new expression

1#include 2 3 intMain ()4 {5 //Output Number6printf"%d\n",1+2);//17printf"%d\n",3-4);//28 9printf"%d\n",5*6);//3Tenprintf"%d\n",8/4);//4---Thinking and 6 difference One Aprintf"%d\n",8./5.);//5 This output

A simple string compressionWrite a string compression program that compresses the repeated letters that are present in the string and outputs the compressed string.Compression rules:1. Compress only consecutive occurrences of characters. For example,

Who wants to write a program that comes with a bunch of DLLs, especially names with such obvious names.So in the online look, it is necessary to download the source code and then compile, but looked at others said the compilation time, up to a few

A pull-out sort is a sort algorithm that does not alter the original sequence (array), but rather creates a new sequence that operates in a new sequence.Here is an example of a small-to-large-order stop explanation.Fundamental thinking and

In the ten classical data mining algorithms, theKNN algorithm is one of the simplest. The algorithm is an inert learning method (Lazy learner), which differs from the decision tree, the naïve Bayesian approach (eager learner). Lazy Learning method

Heap: The operating system has a linked list that records the free memory address, when the system receives the application, it iterates through the list, finds the first heap node that is larger than the requested space, and then removes the node

static void Main (string[] args) { Thread t1 = new Thread (new ThreadStart (TestMethod)); Thread t2 = new Thread (new Parameterizedthreadstart (TestMethod)); T1. IsBackground = true; T2.

After writing the previous article, I found a question:That is, the plugin cannot be previewed in real time.After learning slate, I found a way to:Overriding the Synchronizeproperties functionThe header file is added:#if With_editor ufunction ()

1, the conversion of IP　　1) Positive Conversion　Structure sockaddr_in An IP address structure in C + + that contains information such as address home, port, and IP addressSuch as:　　　　Sockaddr_in addr;addr.sin_family = af_inet; Specifies the address

The previous article discussed some basic knowledge about virtual tables, in addition to the storage structure of virtual function in memory, and also analyzed the underlying implementation of single inheritance and multiple inheritance.The first is

TreeView Default ExpansionTreeview1.expandall ();TreeView Judge Click Node:private void treeView1_AfterSelect (object sender, TreeViewEventArgs e) { if (TreeView1.SelectedNode.Name = = " Node name ") {

Read and Write Registry1. Read Public Static stringGetregeditdata () {//Win10 Read and write localmachine permissions, no access rightsRegistryKey HKML =Registry.currentuser; RegistryKey Software= Hkml. OpenSubKey ("Software",true); RegistryKey

VariableVariable declaration: example: int a = 3;//declares an integer variable A with an initial value of 3 float B = 9.88f//float type data must be preceded by a value of F, if not the default is a double type, cannot be implicitly converted,

// Demo Example string " Big " ; int i = getstringexistcount ("abcdf greatly dssdf large DFSDFAD large SRE top WF large SDA fwefr" , s); Console.WriteLine (" search to" {0} "appears in the string for the total

/// ///Take Intermediate text/// /// Total Text /// left Text /// Right Text /// Find the intermediate text returned, no return null found Public Static stringGetmiddlestring

#include #includestring>#includeclassitem{ public: Item (std::stringstr): name (str) {}~item () {std::cout"unitialize!"std::endl;} voidDump () {std::cout"I ' am"std::endl;} StaticItem *createitem (std::stringStr) {Item*pitem =NewItem (str);

[2016 Changzhou No. 1 summer camp Day7], 2016 Changzhou day7 Sequence)[Description]Bucket has a sequence, which is initially empty. It inserts 1-n into the sequence sequentially, where I is inserted to the right of the current ai number (ai = 0