1. 1>2, 2>4, 5>2.... Here we want get the relationship of all these balls
2.two trees here, and they maybe interleave with each other, if so, we need to get the first common node of them
2.1 two strings, how to get the common substring of them. (suffix tree)
3.how to distinguish 12 balls with one ball of different weight. The detail of the problem is as the pre-exam.
4.there is a polygon and a point here, how to tell whether the point lies in the polygon or not.
5.singleton pattern in C++
原文链接: https://www.cnblogs.com/gzgujs/archive/2013/05/08/3067251.html
欢迎关注
微信关注下方公众号，第一时间获取干货硬货；公众号内回复【pdf】免费获取数百本计算机经典书籍
原创文章受到原创版权保护。转载请注明出处：https://www.ccppcoding.com/archives/87638
非原创文章文中已经注明原地址，如有侵权，联系删除
关注公众号【高性能架构探索】，第一时间获取最新文章
转载文章受原作者版权保护。转载请注明原作者出处！
