Computer science-and technology

Yesterday I went to SJTU to attend the Google summer internship audition. The data structure,AlgorithmEven though I have taken over 80 exams for both of them .. But I forgot about it.

Read most of the previous choice questionsProgramI am depressed only when it comes to computing complexity, because I didn't calculate complexity seriously in the past .. The O (logn) and O (N ^ 3) entered during the examination are basically endorsed. So I want to strengthen the first point:Proficient in algorithm calculation.

It is not difficult for the next three questions. Calculate the multiplication of the N * n matrix represented by a one-dimensional array, and use non-recursive traversal of a binary tree to design an algorithm to find the maximum value of the sum of one element in the array that is the sum of the other two elements.

In the first example, I set three .. At that time, I really couldn't figure out how the dual-loop method was implemented. Non-recursive traversal of the binary tree, I used to take the mid-term exam, but I forgot, at last, create 2 ^ I nodes on layer I .. The space complexity is huge. The last question cannot be thought of, so I had to sacrifice the Invincible Algorithm-hash... The second point I want to strengthen:Familiar with common algorithms!

After the written test, wyh and HB both decided to humiliate the school, so I refused Google .. Continue to yy ibm .. Today, I won't go to eBay. There is a memory problem. Xuhui Computer City is far away ..

Think about it. We are learning computer science and technology. Science is at the front, but I used to do too much "technology. Nowadays, high-level languages are encapsulated so well that you don't need to worry about anything. The difference between a master and a cainiao is who is more familiar with the SDK and who is familiar with various class libraries .. I am still a student in tnnd, but I still need to pay attention to some more essential things. Now I have decided to reinvent algorithms. I will review or learn one type every week. There will also be dozens of things next year, henchen ~ Come on!