Traditional Chinese version of big talk Information Structure

Render manager has carefully reviewed the checking and checking kernel, but the checking kernel has not been avoided yet. Here, I am sorry to those who have already written this article. The current survey is as follows:

First printing:

1.01 above P37, there is a "+" operator that should be "= ".

Under P37 1.02, it must be O (n !), Coming soon! The token becomes the upper mark.

In the upper part of 1.03 P55, the text "Big Brother, thank you" should point to the villain below. See Region

1.04 P20, replace "I," in "int I, sum = 0, n = 100;" in "int I, sum = 0, n =;" is redundant and can be divisible, because I changes are not useful.
 
1.05 P62, numbers 3-6-5, left margin 3, "head index are not empty" should be changed to "head index exist ".
 
1.06 P62, expires 3-6 and expires 3-6-6. in the two regions, the "head Index" is changed to "back-end address ". Values 3-6-6, and "0900" should be changed to "NULL ".
 
1.07 P64, 6th rows in the Code, "/* declare a conclusion p */" should be changed to "/* declare p */".
 
1.08 P68, Row 3: "use to store the end point of e data .", Change "e resource s endpoint" to "resource e's end point ".
 
1.09 P76, the first line, "while the cur mark is the next indicator in the simple direction to the next link column, the operator storing the element in the lower column contains the lower limit. ", Divide the word "mark" and add a sentence before the last sentence: "We call cur a" mark ."

1.10 P113, the second line in the last section, "only the left-inclusive margin" is changed to "as long as the left-inclusive margin is reached ".

1.11 P113, the last line in the last section, "is the result of empty heap stacking .", Divide the "result".
 
1.12 P117, 6th, matching the sentence before the first sentence and the sentence before the second sentence. The result is "Starting followed by character" X ", because the heap character at this time is broken ...... Therefore, "*" is not output to the heap. Next, extract the number 3, and the formula for the total table is 931-3. For example, the Right Direction of limit 4-9-8 ."

1.13 P149, the first line of the fourth paragraph, "false settings S =" abcabcabc ",", where the string S should be "abcababca ". The ① values of P150, 5-7-4, and P151, 5-7-5 should be changed to the following values.

1.14 P151, the second row of the second part of the inverted data, "In April 5-7-4," changed to "in April 5-7-5 ,".
 
1.15 P157, 5-7-5 in the small shard: "First calculate the value of the next shard column to 1st", should be changed to "001234223 ".
 
1.16 P158, the last line, "nextval [9] = nextval [3] = 1" the last "1" should be changed to "0 ".
 
1.17 P168, 6-4-1 small shard second row: "The location of the links should be changed to" the location of their links in the links column ".
 
1.18 P169, The firstchild of row A of the number of tables 6-4-3 should be "1" rather than "-1 ".

1.19 P184, 6-6-2 The fourth section of Binary Character 2. "If there is a limit, there are at most 1 = 20-1 points ", it should be "21-1 nodes ".

1.20 P165, 6-2 bytes the third line of the first section, "and G, H, I, J are also .", It should be changed to "G, H, I, and J are also cousins ."

1.21 P185, 6-6-4 then the second row of the first section, "the second row of the second row is", where the "degree" is changed to "depth" and the third row, "Its degree is 4", which should be changed to "its depth is 4 ". In the third section, the first line is "equal to the same degree number", and "degree number" is changed to "depth". In the fourth line, "k as the degree number is also an integer ", "degree" is changed to "depth"; P186, the first line, "This is a complete binary regression, degree is 4 ", "degree is 4" to "depth is 4 ".

1.23 P215, 4th ~ In the five rows, "for example, the rightmost vertex in period 6-11-4", change "rightmost vertex" to "bottom right ". In the second line, "the forest formed by the three trees on the right" is changed to "bottom ". In line 5, "for example, the forests of the three trees on the right" are changed to "below ".

1.24 P215, the first line of the second part of the inverted data, "but if we change" 6-11-4 "to" 6-11-5 "for the left segment of the second segment ".

1.25 P219, the first line of the second paragraph, "first convert the two binary trees into the dual structure of the sub-nodes plus rights", and then add "Note: the number of links between links is called Weight )". For example, "6-12-5" in the same line is changed to "6-12-4 ". In the second row of the third section, "6-12-5's binary sector a" is changed to "6-12-4 ".

1.26 P219, counting the third row, "the route length of each shard is lk", and "lk" should be changed to "lk", that is, k is the lower mark.

1.27 P220, the fourth paragraph, "6-12-5 binary B", "6-12-5" to "6-12-4 ".

1.28 P235, the first line of the third paragraph, "left margin in 7-2-9", where "left margin" is changed to "TOP ", in the following example, "the length of the two channels on the right side is 3", and "right side" is changed to "bottom ".

1.29 P236, line 2, "two regions vi, vj, E,", this region "E" should be changed to "V ".

1.30 P237, Segment 1 and Segment 2 of segment 7-2-13, the arrows between segment A and segment B are reversed.

1.31 P360, listen 8-7-9, there are too many rows in the period, and the shape is too complex, so make the following changes bigger than the limit:

1.32 P267, the fifth line of the inverted number, "arjvex [0] = 0", where "arjvex" should be "adjvex ".

1.33 P282, 8th small bytes, "I = 2 at this time ." Change to "at this time v = 2 .". P283, 11th tips, "I = 3 at this time ." Change to "at this time v = 3 ."

1.34 P280-P281, mat" matirx "should be changed to" matrix "(a total of five changes, points are P280 generation third line, line 1, line 8, line 27, and line 29 on behalf of zookeeper ). In the generation of the provided lower limit, the matrix is modified to arc.

1.35 P306, Row 3, in the formula "min {ltv [j] + len ......", "+" Should be "-".

1.36 P85, bottom generation, add "q = rearB-> next;" between the second and third sentences in four generations ;", and modify the last sentence "free (p);" to "free (q);/* release q */".

1.37 P28, the fourth row of the inverted data, "the operation of 100 secondary is 100 times greater than the operation of 10 times", should be "1000 times larger than the operation of 10 times ".

1.38 P49, union generation operator, there are a lot of problems, the amendment is as follows. The union clause is the relational word of the C statement, so the number of letters is added with an additional L. For more information, see the "01 temporary table sequence saving sequence _ List. c" file in the source sequence.

1.39 P232, ipv7-2-6, and vertex B and vertex D lack two reverse zookeeper. This is because the definition of "directed completely" refers to the two arcs with opposite directions between any two vertices.

1.40 P266. In September 7-6-3, the moment when the operator is connected is somewhat ambiguous. Arc [v2] [v1] should be 18, and arc [v3] [v6] and arc [v6] [v3] should both be 24.

1.41 P351, Segment 8-7-2, Segment 1, except for segment 35 and end 99.

1.42 P305 6th small keys, "The ltv corresponding value is 19, 25, 13", the three data sequence should be "19, 13, 25 ".

1.43 P353, the seventh row of the inverted number, "the balance factor has not experienced any change", changed to "the balance factor has not exceeded the limit (-, 1 )".

The BF value of Point 7 in Section 15 of 1.44 P356, period 8-7-8 should be-2 rather than-1.

1.45 P369, the second line of Case 2, "delete end point 1 at this time", changed to "delete end point 4 at this time ".

1.46 P399, the third line in the third section of the bold text, "(non-linear regression or non-linear addition)", changed to "non-linear regression (or non-linear addition) relationship ".

1.47 P80, the third inverted row, "j = k [999]. cur = 1", should change "k" to "L ".

1.48 P412, returns the second line "L. r [J-1] = L. r [j] ", in which the upper limit should be a plus sign, that is," L. r [j + 1] = L. r [j] ".

1.49 P340, the first line below the generation queue, "InsertBST (T, 93);" it should be "InsertBST (& T, 93);", one line below, "InsertBST (T, 95);" it should be "InsertBST (& T, 95 );"

1.50 P425, middle segment, the last line of heap sorting definition, "sub-small value in n elements ", the "minor" should be changed to "minor ".

1.51 P253, 7-4-10, and the effect of V1 should be changed to V2.

 

1.52 P351, the second line of the last segment is "(that is, its left sub-shard height is 2 rows to the right sub-shard height is 0)", where 2 should be changed to 3. P352, the small 2 in the upper-left corner of the end point of period 8-7-2 also needs to be changed to 3.

1.53 P361, representing 22nd rows of bytes, "if (taller)", should be changed to "if (* taller )". The source region provided by this region also has the same region and has been modified.

1.54 P171, limit 6-4-2, each ending point has an additional finger domain (that is, there should be four square boxes for five ), should be removed, as shown below.

 

1.55 P209, 7th rows, "7th ~ Line 8, whild (", where" whild "should be" while ".

1.56 P270, 2nd rows, "hypothetical N = (P, {E})" where "P" should be "V"

1.57 P136, with an inverted Number of 2nd rows. "It may be 65 characters or more." 65 "should be" 6.5"

1.58 P308, the last line, "the cross-sectional column is an upgraded version of linear regression, multiple connected end columns are upgraded versions of the connected string columns. ", It should be changed to "Cross-border end columns are simplified for the structure of the forward-facing end string, multi-choice string columns are normalized to the structure of the undirected choice string."

----------------------------------------------

After the publication of the big talk data structure, I found a lot of news, which brought difficulties to the readers of the website. I am very sorry, what I can do now is to deploy the survey information at the most appropriate time to prevent the hacker. It has been passed through with the publishing house. During the second printing, the website administrator in the survey will be corrected. If you are very concerned that you do not need to generate the website administrator information, you may wish to wait for two or three months before renewal. I believe that the quality of your account will be much better. Again, I am sorry to the already-confirmed users, and it will be time-consuming for you to make corrections, of course, after spending more than ten minutes of modification, you will be able to renew your current subscription early, which is a great pity!

It is also expected that users can understand that, because the relationship is higher than the upper limit, the output may also affect the larger area. As the author, I am also very energetic. In fact, when published in the Chinese site, there will be many reasons for this issue, such as the absence of surveys and the absence of such issues. Therefore, render manager has made great efforts before publishing this article, but he has not avoided the development of the website. What is important now is how to compile the website, do not cause a fault or failure. Micro-engine Windows also requires ding, so we hope you can use the heart chart similar to ding to view the correction. Please refer to the content of your website instead of your website. Too many!