leetcode-559. N叉樹的最大深度-C語言

class Solution { public: int max = 0; void get(Node *node, int dep){ int i; if(!node->children.size() && dep > max) { max = dep; } for

>>阅读原文<<