Free yourself 12.14~12.20
Last year, due to the epidemic, the school opened half a month earlier, so the winter vacation was correspondingly advanced by nearly half a month. Basically, it was the first batch of schools to have holidays. Looking at the nearly 80-day winter vacation, I don’t know how to do or how to do it; I was over-stressed before the exam, and my heart was relieved after the exam, so there was no motivation to learn. . . Following this momentum, I stopped at an old friend's house in Wuhan on the way home, and took the opportunity to visit Happy Valley, Ocean Park, Hubei Provincial Museum, Optics Valley Pedestrian Street...
Game time 12.20~12.28
These days are very boring, and the premature vacation time makes me feel lonely (my friends never come back). At that time, I also went to read some computer information every day, and did some extensions after the C language course that I just completed. Exercises, I was recommended by a friend to buy a copy of "One Hundred Years of Solitude" in the bookstore. After nibbling, I was really lonely hahahaha, and I consciously downloaded my favorite game, and my daily rhythm became games and meals. ,go to bed. . . .
Start of training (start of feature film) 12.28~2.4
12.28~1.14 (C language learning stage)
The happy time is always very short. I signed up for an educational institution to train computer knowledge before, which officially started on December 28th last year. At that time, I just finished learning the C language, compared to the exams in the same period. The research students are too far behind: the logic of the question is very confusing, and there is no good idea. When I see a question, it is a for loop, without considering the time complexity and space complexity (I didn’t understand this thing at the time. What, simply to find out about the concept), so my solution to a problem when the teacher questions usually as a negative QAQ (cry chirp), still remember there was a problem is factorial and I direct to get started is a double for the cycle on I was spit out by the teacher and did the problem without details. This is not to blame. I hadn't seen anything in the world at that time, and writing a problem was the kind of ordinary way of thinking and solution.
With the rapid increase in code reading, I learned some small details under the careful guidance of the teacher, such as don’t just put the intermediate function in the loop, for example (int i=0;i<strlen(str);i++) , this The function does not have much impact on the whole, but what this taught me is that there are things that can be saved with variables once you ask for it. Why do you have to ask for trouble to repeat the process? It's a small detail, hahaha.
During this period also I learned some basic sort of new to even when a bubble sort must fiddle for a long time, and then a few days later learned select , insert , Hill, so a series of sorting method, was also write them In the blog ↓
Sorting algorithm: bubbling, selection, insertion, hill, heap row, bucket row, fast row, merge
1.14~2.4 (C++ learning stage) + 2.18 ~ 2.28 (C++11 learning stage)
At this stage, I started to work on the above questions. I still remember the embarrassing scene that I got an array question after watching it for a long time. Hahaha, it was really a simple question for an hour and a half. I am not familiar with the format of C++. It looks a little awkward.
I was surprised by how many, many, when I tried to write questions. Refreshing solutions, many times I have to admire the magic of binary (bitwise AND, bitwise OR, exclusive OR), the magical use of array subscripts (Eradosi screening method)... I have learned some algorithms such as double pointer, greedy one after another . , Various sorts, hash tables, stacks and queues, binary tree traversal, dynamic programming, bit operations , and learned various traversals of binary trees. I once thought that I hadn’t learned the C language in the computer room before I had my scalp and looked at C++ code and tried to write it. After a trick, I finally lost to the binary tree. During the holiday, I finally got back a game and learned this piece again. I actually wrote the code by myself with reference to some information
. The creation and level of the binary search tree. , Middle and post-order traversal (recursive && non-recursive)
Later, under the leadership of the teacher, I also wrote graph-related code, the creation of graphs, BFS, DFS algorithm, Kruskal algorithm...
The construction of graphs and BFS (breadth first search), DFS (depth first search), Primm minimum spanning tree algorithm , And search set and kruskal algorithm.
In this process, I have kept blogging on CSDN. The knowledge points that the teacher talked about, I thought about showing it in a better and more general way. When learning the sorting algorithm, the teacher uses vector <int> For example, I used the template class template<typename T> for the first time when I was writing . It may not seem like a simple gadget now, but I was new to template knowledge and applied it to my own In terms of things, that is the happiness that other things can’t compare. Hahahaha OvO~~~
It’s really wonderful to succeed in one thing~~~
2.28 ~ ∞
So far, I have brushed 220+ questions on Likou and wrote nearly 50 blogs. The improvement is really huge (but I am still a weak chicken). I am very fortunate that I did not waste my vacation to play games to tease girls. It is to spend time on learning professional knowledge (every day from 9 to 11 lives for two months), which greatly improves the familiarity with the code, and can also answer some questions in the "C language learning exchange group" , Do not poke!
Tomorrow is the second semester of the sophomore year. Let’s set a flag: I got the internship offer from Dachang in the first semester of my junior year, and I got the official job offer in the second semester of my junior year. I hope to see this article a year later. I got the internship salary at Dachang, come on! ! !
It’s late, and I have to rush to class tomorrow, so I’ll stop here first~~~