无端科技Java面试

一、广度优先遍历与深度优先遍历

https://blog.csdn.net/weixin_42289193/article/details/81741756

二、根据前序和中序遍历构建二叉树

 

/** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ public class Solution { public TreeNode reConstructBinaryTree(int [] pre,int [] mid) { return rebuildTree(pre,mid,0,pre.length-1,0,mid.length-1); } private TreeNode rebuildTree(int [] pre,int [] mid,int pre_start,int pre_end,int mid_start,int mid_end){ if(pre_start>pre_end){ return null; } int pre_root=pre[pre_start]; int mid_root_index=0; while(mid_root_index<=mid_end){ if(mid[mid_root_index]==pre_root){ break; } mid_root_index++; } int length=mid_root_index-mid_start; TreeNode treeNode=new TreeNode(pre_root); /*即实际迭代的函数体：求出当前root节点在前序中序额位置，然后分开，再由下式进行第n此迭代*/ treeNode.left=rebuildTree(pre,mid,pre_start+1,pre_start+length,mid_start,mid_root_index-1); treeNode.right=rebuildTree(pre,mid,pre_start+length+1,pre_end,mid_root_index+1,mid_end); return treeNode; } }

三、TCP阻塞原理

https://www.cnblogs.com/never--more/p/7193628.html

四、堆栈区别

https://blog.csdn.net/whaosy/article/details/8613386