resource_variation.java~20~

这个是朋友作的毕业设计

package Resource_Selection;

import java.util.*;

public class resource_variation {
    Random rd=new Random();
    rank rank=new rank();
    int rdget=0;
    int i=0,j=0;
    int lv=0;
    int father;
    int xch;
    int temp[]={0};
    public resource_variation(int a[][],int m, int n){
      rdget = Math.abs(rd.nextInt()) % 3 + 1;
      while (i<n){
           rdget = Math.abs(rd.nextInt()) % n + 1;
         if (rank.rank(a,rdget) > lv) {
           lv=rank.rank(a,rdget);
           father = rdget;
           }
           i++;
         }

      switch (rdget)
      {
        case 1:
                   rdget = Math.abs(rd.nextInt()) %100 +1;
                 int start=(rdget-1)*n/100,end=rdget*n/100;
                 if(start>end){
                   xch=start;
                   start=end;
                   end=start;
                 }
                 for (i=0;i<n;i++)
                 {
                   temp[i]=a[father][i];
                 }
                 for (i=start;i<=end;i++)
                 {
                   temp[i]=~a[father][i];
                 }

        case 2:
          int ra[]={0};
          for (i=0;i<4;i++){
            ra[i] = Math.abs(rd.nextInt()) % n + 1;
          }
          for(i=0;i<4;i++){
            for(j=0;j<4;j++){
              if(ra[i]>ra[j]){
                xch=ra[i];
                ra[i]=ra[j];
                ra[j]=xch;
              }
            }
          }
          j=0;
          for(i=0;i<ra[0];i++){
            temp[j]=a[father][i];
            j++;
          }
          for(i=ra[2];i<ra[3];i++){
            temp[j]=a[father][i];
            j++;
          }
          for(i=ra[1];i<ra[2];i++){
            temp[j]=a[father][i];
            j++;
          }
          for(i=ra[0];i<ra[1];i++){
            temp[j]=a[father][i];
            j++;
          }
          for(i=ra[0];i<ra[1];i++){
            temp[j]=a[father][i];
            j++;
          }
          for(i=ra[3];i<n;i++){
            temp[j]=a[father][i];
            j++;
          }

        case 3:


      }
      for(i=0;i<n;i++){
        a[father][i]=temp[i];
      }




  }

}