-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
559.java
71 lines (66 loc) · 1.77 KB
/
559.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
__________________________________________________________________________________________________
sample 0 ms submission
/*
// Definition for a Node.
class Node {
public int val;
public List<Node> children;
public Node() {}
public Node(int _val,List<Node> _children) {
val = _val;
children = _children;
}
};
*/
class Solution {
int res = 0;
public int maxDepth(Node root) {
if(root==null)
return 0;
int maxDepth = 0 ;
for(int i = 0 ; i< root.children.size();i++)
{
maxDepth = Math.max(maxDepth,maxDepth(root.children.get(i)));
}
return maxDepth+1;
}
}
__________________________________________________________________________________________________
sample 42348 kb submission
/*
// Definition for a Node.
class Node {
public int val;
public List<Node> children;
public Node() {}
public Node(int _val,List<Node> _children) {
val = _val;
children = _children;
}
};
*/
class Solution {
public int maxDepth(Node root) {
if (root == null) return 0;
Queue<Pair> queue = new LinkedList<>();
queue.add(new Pair(root, 1));
int maxDepth = 0;
while (queue.size() > 0) {
Pair curNode = queue.poll();
maxDepth = Math.max(maxDepth, curNode.depth);
for (Node child : curNode.node.children) {
queue.add(new Pair(child, curNode.depth + 1));
}
}
return maxDepth;
}
class Pair {
Node node;
int depth;
Pair(Node node, int depth) {
this.node = node;
this.depth = depth;
}
}
}
__________________________________________________________________________________________________