This topic created in 2902 days ago, the information mentioned may be changed or developed.
 |
casparchenNov 27, 2018
1
是要问有多少种方案，还是问随便一种？
|
 |
2
@casparchen 所有符合要求的结果
|
|
casparchenNov 27, 2018
3
如果要列出所有结果那一个 DFS 不就行了
|
|
4
```
def dfs(lst, start, m): if m <= 0: print(list(filter(lambda x: x != None, lst))) else: for i in range(start, len(lst)): lst[i] = i dfs(lst, i+2, m-1) lst[i] = None dfs([None for i in range(9)], 0, 5) ``` ``` [0, 2, 4, 6, 8] [Finished in 0.1s] ``` |
1 |
5
选 n 的时候:n,f(n-2);不选 n 的时候:f(n-1)
|
 |
6
 |
 |
azygoteNov 28, 2018 via iPhone
8
回溯法
|
 |
9
这道题目也许和青蛙跳的问题类似，希望这篇文章对你有所帮助：[一只青蛙跳出来的分治法、回溯法与动态规划]( https://www.cnblogs.com/genialx/p/10191366.html)
|
Select Language