Lession Learned: This is the first non-trivial Gready Algorithm I wrote. It costs a bit of time for me to get it right. For non-trivial algorithm, the pseudocode design&check is really the crucial part.
1. In the complex loop&algorithm, it is helpful to use "Assert" to assist debugging.
2. In the complex algorithm, always verify if the logic is correct after writting one code statement. The logic must keep clear!
3. Don't make quick assumption, for example, "If the input data is sorted...". This is the second time I made wrong assumption. 
4. Check the edge condition again. Do remember to spend some time to check the input data's edge condition. It worths the time!
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。