=w=

摘要： "1. Question / 实践题目" "2. Analysis / 问题描述" "3. Algorithm / 算法描述（说明你的贪心策略，并且参考会场安排问题，利用反证法证明贪心选择和最优子结构性质）" "3.1. Huffman Tree Algorithm" "3.1.1. How to 阅读全文

摘要： "1. Find an Optimal Solution without Repetitions Why DP?" "2. Two Features of DP" "2.1. Optimal Substructure" "2.2. Overlapping Subproblems" "3. Matri 阅读全文

摘要： "1. Question / 实践题目" "2. Analysis / 问题描述" "3. Algorithm / 算法描述" "3.1. Substitution" "3.2. Insertion" "3.3. Deletion" "3.4. Sepcial Cases" "3.5. Equati 阅读全文

摘要： "1. Smaller and Easier" "2. Recursion" "2.1. Introduction" "2.2. Common solution" "2.2.1 Fibonacci" "2.2.1. Find Out the Equation" "2.2.2. Convert the 阅读全文

摘要： "1. Introduction" "2. Preparations" "2.1. Inline functions" "2.2. Templates" "2.3. RandomAccessIterator" "3. Explore sort() in STL" "3.1. Introduction 阅读全文

摘要： C formatting in Swift is similar to that in C: create a String type variable or constant with a c formatting string, and display the variable or const 阅读全文

摘要： A simple way to receive standard input from the console is using the readLine() function . For example, we are to receive from the console, the code c 阅读全文

摘要： 1. Question / 实践题目 2. Analysis / 问题描述 The task is to find the median of the union of two sequences in a non descending order with the same length, wit 阅读全文

摘要： Q1 找第k小的数 设计一个平均时间为O(n)的算法，在n(1输入格式: 输入有两行： 第一行是n和k，0输出格式: 输出第k小的数 输入样例: 在这里给出一组输入。例如： 输出样例: 在这里给出相应的输出。例如： Notes (1) Explicitly write at the end of t 阅读全文

摘要： 1. 请上网了解编码规范，说明你本学期的编码遵循哪个规范及该规范的链接。 It seems that the coding style of Google is highly recommended and popular. https://google.github.io/styleguide/c 阅读全文