The beauty of "catalogue" programming

The beauty of programming

1. 2.1 The number of 1 in the binary number
2. 2.2 Factorial
3. 2.4 1 of the number
4. 2.5 Finding the largest number of K
5. 2.6 Accurately express floating-point numbers
6. 2.7 Seeking greatest common divisor
7. 2.8 Find an Integer that matches the criteria
8. 2.10 to find the largest and smallest number in an array
9. 2.12 Quickly find two numbers that meet the criteria
10. 2.13 Maximum multiplication of sub-arrays
11. 2.14 The maximum value of the sum of the subarray of the array
12. 2.15 Maximum value of the sum of the subarray (two-dimensional)
13. 2.16 to find the maximum increment subsequence of an array
14. 2.17 Array Loop displacement
15. 2.18 Array Segmentation
16. 2.19 Interval Coincidence judgment
17. 2.20 Program Understanding and Time analysis
18. 2.21 test of the addition of the face
19. 3.5 generation of the shortest digest
20. 3.7 Queue Fetch MAX operation problem ☆
21. 3.9 Rebuilding the binary tree
22. 3.10 Layered Traversal Binary tree
23. Finding the maximum distance of a node in a binary tree
24. Cpu
25. "2014 Programming Beauty Qualifying" question B

The beauty of "catalogue" programming