C # as Effective
1.const to declare those keywords must be determined at compile time period, such as attribute parameters, switch case statement labels, enum definition, and occasionally also used to declare that do not vary with the version of the value. In addition to the value it should consider more flexible declared as readonly constants.
40 speak algorithm
1. Algorithm for Learning:
Classification -chunked up
deliberate practice (boring, practice shortcomings, weaknesses, uncomfortable)
feedback (active: github to see the master code, leetcode, passive code review)
interview solving a family of four:
① clear title means
② list all possible solutions (to find the optimal solution)
③coding (write)
④test Cases
data structure 2.map and set: the hash table or a binary search tree, the former query fast O (1), the latter is relatively ordered
3. preorder: left and right root
preorder traversal: about root
subsequent traversal: about root
meaning preorder traversal of the binary search tree in front 4:
normal binary: Investigation ability to write code
binary search tree : left and right root traversal sequence is an ordered array
5. Fibonacci recursion is not efficient, because there is double counting
