Clone N-ary Tree
给一个n个children的树, 求一个这个数的deep copy.
|
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 |
/* // Definition for a Node. class Node { public int val; public List<Node> children; public Node() { children = new ArrayList<Node>(); } public Node(int _val) { val = _val; children = new ArrayList<Node>(); } public Node(int _val,ArrayList<Node> _children) { val = _val; children = _children; } }; */ class Solution { public Node cloneTree(Node root) { if(root == null) return null; Node cloned = new Node(root.val); for(int i = 0; i < root.children.size(); i++){ cloned.children.add(cloneTree(root.children.get(i))); } return cloned; } } |