經常使用算法列舉

時間 2020-10-25

標籤 html java node 指針 code htm blog 排序遞歸 rem 欄目 HTML 简体版

原文原文鏈接

1. 深度優先遍歷

使用場景：常見於各類組合，樹遍歷，前序遍歷、中序遍歷、後續遍歷html

private void dfs(int[] arr, int target,int begin, Deque<Integer> path, Set<List<Integer>> res) {
     if ( path.size()== target) {
        res.add(new ArrayList<>(path));
        return;
    }else if(begin>arr.length){
        return;
    }
    for (int i = begin; i < arr.length; i++) {
        path.add(arr[i]);
        dfs(arr,target,i+1,path,res);
        path.removeLast();
    }
}

2. 廣度優先遍歷

常見於樹遍歷，樹層級，節點next指針等場景java

public List<List<Integer>> levelOrderBottom(TreeNode root) {
 List<List<Integer>> levelOrder = new LinkedList<List<Integer>>();
        if (root == null) {
            return levelOrder;
        }
        Queue<TreeNode> queue = new LinkedList<TreeNode>();
        queue.offer(root);
        while (!queue.isEmpty()) {
            List<Integer> level = new ArrayList<Integer>();
            int size = queue.size();
            for (int i = 0; i < size; i++) {
                TreeNode node = queue.poll();
                level.add(node.val);
                TreeNode left = node.left, right = node.right;
                if (left != null) {
                    queue.offer(left);
                }
                if (right != null) {
                    queue.offer(right);
                }
            }
            levelOrder.add(0, level);
        }
        return levelOrder;


    }