问题描述
首先
i这个网站是新的
i有一个问题来开发一个关于它的算法
firstly
i am new in this site
i have a problem to develop a algorithm about that
推荐答案
你的意思是我们可以去2或4表格1 ？
你还没有说好问题，对于inst你没有说过，一旦你去过它就不能回到广场了。
既然你没有说明那么我去的时候我可以回到广场它可以不止一次访问一个广场，因此有无数的解决方案，例如
1 4 5 2 3 6 9
1 4 5 2 1 4 5 2 3 6 9
1 4 5 2 1 4 5 2 1 4 5 2 3 6 9
1 4 5 2 1 4 5 2 1 4 5 2 1 4 5 2 3 6 9
等
除非说明所有条件，否则无法创建算法来解决问题。
A ssume you mean "we can go 2 or 4 form 1"?
You have not stated the problem well enough, for instance you have not stated that you can not go back to a square once you have visitied it.
Since you have not stated that then I can go back to a square once I have visited it a can visit a a square more than once and therefore there are an infinite number of solutions e.g.
1 4 5 2 3 6 9
1 4 5 2 1 4 5 2 3 6 9
1 4 5 2 1 4 5 2 1 4 5 2 3 6 9
1 4 5 2 1 4 5 2 1 4 5 2 1 4 5 2 3 6 9
and so on
Until you state all the conditions it would be impossible to create a algorithm to solve the problem.
这篇关于你能帮忙算法吗？的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持！