算法实践-最大数量活动选择-贪心算法

发布一个k8s部署视频：https://edu.youkuaiyun.com/course/detail/26967

课程内容：各种k8s部署方式。包括minikube部署，kubeadm部署，kubeasz部署，rancher部署，k3s部署。包括开发测试环境部署k8s，和生产环境部署k8s。

腾讯课堂连接地址https://ke.qq.com/course/478827?taid=4373109931462251&tuin=ba64518

第二个视频发布  https://edu.youkuaiyun.com/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.youkuaiyun.com/course/detail/27574

详细介绍helm命令，学习helm chart语法，编写helm chart。深入分析各项目源码，学习编写helm插件
————————————————------------------------------------------------------------------------------------------------------------------

package com.greedy;

public class ActivitySelect {
	private int[][]activity;
	private int[][]select;
	private int index;
	public ActivitySelect(int[][]activity){
		this.activity=activity;
		select=new int[activity.length][2];
		
	}
	public void activitySelector(){
		inneractivitySelector(0);
		printActivity();
	}
	private void inneractivitySelector(int start){
		int m=start+1;
		if(m==activity.length){
			select[index][0]=activity[start][0];
			select[index][1]=activity[start][1];
		}else{
			while(m<activity.length&&activity[m][0]<activity[start][1]){
				m=m+1;
			}
			if(m<activity.length){
				select[index][0]=activity[start][0];
				select[index][1]=activity[start][1];
				index=index+1;
				inneractivitySelector(m);
			}
		}
		
	}
	public void printActivity(){
		for(int i=0;i<select.length;i++){
			if(select[i][0]==0){
				break;
			}
			System.out.print("("+select[i][0]+","+select[i][1]+") ");
		}
		System.out.println();
	}
	public static void main(String[] args) {
		int[][]activity=new int[][]{
				{1,4},
				{3,5},
				{0,6},
				{5,7},
				{3,9},
				{5,9},
				{6,10},
				{8,11},
				{8,12},
				{2,14},
				{12,16}
		};
		ActivitySelect select=new ActivitySelect(activity);
		select.activitySelector();

	}

}

活动以结束时间升序排列