OR映射是一个需要穷举测试覆盖的主要层。
The or mapping is a major layer that needs exhaustive test coverage.
然而,看看可行的、首选的航班数量如此之多时,我们应该认识到不要再用穷举搜索法对每一次查询进行验证。
However looking at the total number of possible flights to ones that are viable and preferable should start to eliminate the need to apply Brute Force searching to every single query.
笔者不认为,缓存是一个好的、永久的搜索处理方式,但很显然穷举搜索的成本又太高。
I cannot imagine anyone thinks that caching is a good idea and a permanent solution to search. And clearly brute force hits are too expensive.
So I'm going to solve this by enumerate and check, which is an example of what's called a brute-force algorithm.
你懂的,所以我得靠列举和检验来解决这个问题,这就是我们说的穷举算法。
应用推荐