MCPcopy Create free account
hub / github.com/algorithm006-class02/algorithm006-class02 / Dfs

Function Dfs

Week_02/G20200343030634/leetcode_77_634.c:34–61  ·  view source on GitHub ↗

传递到下一层需要的信息，1是level，2是极限max，3data，这里max是k组合长度，data是已经完成拼接的数组

Source from the content-addressed store, hash-verified

source not stored for this graph (policy: none)

Callers 3

combineFunction · 0.70
LetterCombinationsMethod · 0.50
DfsMethod · 0.50

Calls 1

pushListFunction · 0.70

Tested by

no test coverage detected