贪心算法--活动安排

package cn.it;

import java.util.Arrays;

public class Tx {
    public static void main(String[] args) {
        int start[]={1,4,2,1,2,4,5};
        int end[]={5,6,3,2,4,5,6};
        int n=6;
        boolean a[]= new boolean[n];
        sort(start,end,n);
        int count = manage(start, end, a, n);
        System.out.println(Arrays.toString(start));
        System.out.println(Arrays.toString(end));
        System.out.println(count+":===:"+ Arrays.toString(a));
        
    }
    
    public static void sort(int start[],int end[],int n){
        //选择排序  将结束时间按照增序排列 
        for(int i=0;i<n;i++){
            for(int j=i;j<n;j++){
                if(end[i]>end[j]){
                    
                    int temp = end[i];
                    end[i]=end[j];
                    end[j]=temp;
                    
                    temp = start[i];
                    start[i]=start[j];
                    start[j]=temp;
                }
            }
        }
    }
    
    public static int manage(int start[],int end[],boolean a[],int n){
        a[0]=true;
        int count=1;
        int j=0;
        for(int i=1;i<n;i++){
            //一直选取开始时间大于结束时间的项，并选取该结束时间项
            if(start[i]>=end[j]){
                a[i]=true;
                j=i;
                count++;
            }else{
                a[i]=false;
            }
        }
        
        return count;
    }
}