剑指Offer之Java算法习题精讲排列与N叉树

题目一

 解法

class Solution {
    LinkedList> ans = new LinkedList>();
    public List> permute(int[] nums) {
        LinkedList list = new LinkedList();
        boolean[] bo = new boolean[nums.length];
        method(nums,bo,list);
        return ans;
    }
    public void method(int[] nums,boolean[] bo ,LinkedList list){
        if(list.size()==nums.length){
            ans.add(new LinkedList(list));
            return;
        }
        for(int i = 0;i 
 

题目二

 解法

/*
// Definition for a Node.
class Node {
    public int val;
    public List children;
    public Node() {}
    public Node(int _val) {
        val = _val;
    }
    public Node(int _val, List _children) {
        val = _val;
        children = _children;
    }
};
*/
 
class Solution {
    public int maxDepth(Node root) {
        if(root==null){
            return 0;
        }
        int maxChildDepth = 0;
        for(int i = 0;i 
 

到此这篇关于剑指Offer之Java算法习题精讲排列与N叉树的文章就介绍到这了,更多相关Java N叉树内容请搜索脚本之家以前的文章或继续浏览下面的相关文章希望大家以后多多支持脚本之家！