发布一个k8s部署视频:https://edu.csdn.net/course/detail/26967
课程内容:各种k8s部署方式。包括minikube部署,kubeadm部署,kubeasz部署,rancher部署,k3s部署。包括开发测试环境部署k8s,和生产环境部署k8s。
腾讯课堂连接地址https://ke.qq.com/course/478827?taid=4373109931462251&tuin=ba64518
第二个视频发布 https://edu.csdn.net/course/detail/27109
腾讯课堂连接地址https://ke.qq.com/course/484107?tuin=ba64518
介绍主要的k8s资源的使用配置和命令。包括configmap,pod,service,replicaset,namespace,deployment,daemonset,ingress,pv,pvc,sc,role,rolebinding,clusterrole,clusterrolebinding,secret,serviceaccount,statefulset,job,cronjob,podDisruptionbudget,podSecurityPolicy,networkPolicy,resourceQuota,limitrange,endpoint,event,conponentstatus,node,apiservice,controllerRevision等。
第三个视频发布:https://edu.csdn.net/course/detail/27574
详细介绍helm命令,学习helm chart语法,编写helm chart。深入分析各项目源码,学习编写helm插件
————————————————------------------------------------------------------------------------------------------------------------------
第16题(树):
题目(微软):
输入一颗二元树,从上往下按层打印树的每个结点,同一层中按照从左往右的顺序打印。
例如输入
8
/ /
6 10
/ / / /
5 7 9 11
输出8 6 10 5 7 9 11。
package com.microsoft;
import java.util.ArrayList;
import java.util.List;
import java.util.Random;
public class TreeLeverPrint {
private Node root;
public TreeLeverPrint(int []data){
for(int i=0;i<data.length;i++){
Node node=new Node();
node.value=data[i];
if(root==null){
root=node;
}else{
insert(root,node);
}
}
}
public void printLever(){
List<Node> nodeList=new ArrayList<Node>();
nodeList.add(root);
printLever(nodeList);
}
public void printLever(List<Node> parentList){
if(parentList.size()==0){
return;
}
List<Node> nextLeverList=new ArrayList<Node>();
for(int i=0;i<parentList.size();i++){
Node parent=parentList.get(i);
System.out.print(parent.value+" ");
if(parent.left!=null){
nextLeverList.add(parent.left);
}
if(parent.right!=null){
nextLeverList.add(parent.right);
}
}
printLever(nextLeverList);
}
private void insert(Node parent,Node node){
int random=new Random().nextInt(2);
if(random==1){
if(parent.left!=null){
insert(parent.left,node);
}else{
parent.left=node;
node.lever=parent.lever+1;
}
}else{
if(parent.right!=null){
insert(parent.right,node);
}else{
parent.right=node;
node.lever=parent.lever+1;
}
}
}
public void print() {
Node h = this.root;
this.print(0, h);
}
private void print(int level, Node node) {
if(node==null){
return;
}
for (int i = 0; i < level; i++) {
System.out.format(" ");
}
System.out.format("|");
for (int i = 0; i < level; i++) {
System.out.format("-");
}
System.out.format("%d%s%n", node.value,","+node.lever);
print(level + 1, node.left);
print(level+1,node.right);
}
private class Node{
private Node left;
private Node right;
private int value;
private int lever;
}
public static void main(String[] args) {
int []data=new int[]{1,2,3,4,5,6,7,8,9,10};
TreeLeverPrint tree=new TreeLeverPrint(data);
tree.print();
tree.printLever();
}
}