Learning content summary
Week preliminary learning data structure, and an idea of the learning frame: the application layer is divided into three areas, and the logical layer implementation layer; and logical layer 1 comprising: linear Table 1, 1: Tree buy and m: n FIG, linear form and comprises a stack (the LIFO), the queue (the FIFO); aspect implementation layer comprises an array (random access memory, a high search efficiency), the list (array of bytes, stored sequentially, insert delete high efficiency). Focus on learning to use the list: a list of each item consists of two units: the first number is stored, a second address of the next element is to be read, thus constituting a chain structure; distinguished list (abstract structures) and arrays (inline configuration), is applied to the array list. In addition, the study also focused on the tree binary tree, binary tree of learning the three search order: first order root, root root sequence and the sequence. Wherein the root of the string in time sequence order information (from left to right, from small to large) order. In addition, a study in depth-first search graph search method and breadth-first search.
This week the completion of "self-study is a craft" on the basis Part2 chapter has reviewed the whole chapter, feeling string, data type, function calls have a better understanding, use and more skilled.
This week the C language has been progress in the prime issue, and learned to deal with the problem quickly block with local function, use the divide and conquer idea (Divide and Conquer).
Textbook learning and problem-solving process
After the encounter at the root of the root sequence and the first sequence of binary tree learning problem, which is to root root first and then order the children left and right children, the children left what extent do the left and right child to the right and to what extent; the root sequence there are similar problems. Below, in the end it is the root sequence or ACBFGED ACBEGFD. Confirmed by looking for information, I learned that the so-called left and right are going to the lowest level.
Code debugging and problem solving in the process
Print "*" timing of diamond, to find the most right will be the middle row more than a few "*", by manual simulation, the second discovery For loop (the control output lower half) of the C language i
The initial value should be minus one.
Code link this week
https://github.com/20191218TangQiheng/TangQiheng/blob/master/%E8%B7%9D%E7%A6%BB%E7%B4%A0%E6%95%B0%E6%9C%80%E5%B0%8F%E8%B7%9D%E7%A6%BB
https://github.com/20191218TangQiheng/TangQiheng/blob/master/%E7%B4%A0%E6%95%B0%E5%AF%B9
https://github.com/20191218TangQiheng/TangQiheng/blob/master/%E6%A3%80%E6%B5%8B%E6%9C%80%E9%95%BF%E5%9B%9E%E6%96%87%E4%B8%B2%EF%BC%88%E5%BF%BD%E7%95%A5%E5%A4%A7%E5%B0%8F%E5%86%99%E5%8F%8A%E6%A0%87%E7%82%B9%EF%BC%89
Last week, the wrong question test summary
Be sure to slow down a bit careful when doing simple concept point of the title.
Algorithm is not calculated time.
This is the next chapter (Chapter VIII) content, it can be passed to the subroutine parameters.
Learning progress bar
33/172hours