java 分配算法

原文地址：http://blog.csdn.net/qq_30085577/article/details/52756715

版权声明：本文为博主原创文章，未经博主允许不得转载。

[java] view plain copy

1. /* 
2.      * 随机分配 
3.      */  
4.     public Map<String,List<String>> allotOfRandom(List<String> users,List<String> tasks){  
5.         Map<String,List<String>> allot=new ConcurrentHashMap<String,List<String>>(); //保存分配的信息  
6.         if(users!=null&&users.size()>0&&tasks!=null&&tasks.size()>0){  
7.             for(int i=0;i<tasks.size();i++){  
8.                     int r_user=new Random().nextInt(users.size());  
9.                     if(allot.containsKey(users.get(r_user))){  
10.                         List<String> list=allot.get(users.get(r_user));  
11.                         list.add(tasks.get(i));  
12.                         allot.put(users.get(r_user), list);  
13.                     }else{  
14.                         List<String> list=new ArrayList<String>();  
15.                         list.add(tasks.get(i));  
16.                         allot.put(users.get(r_user), list);  
17.                     }  
18.             }  
19.         }  
20.         return allot;  
21.     }  
22.     /* 
23.      * 平均分配 
24.      */  
25.     public Map<String,List<String>> allotOfAverage(List<String> users,List<String> tasks){  
26.         Map<String,List<String>> allot=new ConcurrentHashMap<String,List<String>>(); //保存分配的信息  
27.         if(users!=null&&users.size()>0&&tasks!=null&&tasks.size()>0){  
28.             for(int i=0;i<tasks.size();i++){  
29.                 int j=i%users.size();  
30.                 if(allot.containsKey(users.get(j))){  
31.                     List<String> list=allot.get(users.get(j));  
32.                     list.add(tasks.get(i));  
33.                     allot.put(users.get(j), list);  
34.                 }else{  
35.                     List<String> list=new ArrayList<String>();  
36.                     list.add(tasks.get(i));  
37.                     allot.put(users.get(j), list);  
38.                 }  
39.             }  
40.         }  
41.         return allot;  
42.     }  
43.     /* 
44.      * 权重分配 
45.      */  
46.     public Map<String,List<String>> allotOfProportion(Map<String,String> users,List<String> tasks){  
47.             Map<String,List<String>> allot=new ConcurrentHashMap<String,List<String>>(); //保存分配的信息  
48.             if(users!=null&&users.size()>0&&tasks!=null&&tasks.size()>0){  
49.                 int a=0;//总权重   
50.                 for(Entry<String, String> entry:users.entrySet()){    
51.                    a+=Integer.parseInt(entry.getValue());    
52.                 }  
53.                 int start=0,end=0;//起始下标 ,结束下标   
54.                 if(a>0){  
55.                     for(Entry<String, String> entry:users.entrySet()){    
56.                         List<String> allotTask=new ArrayList<String>();    
57.                         end+=Integer.parseInt(entry.getValue());//权重累计    
58.                         for(;start<tasks.size()*end/a;start++){    
59.                             allotTask.add(tasks.get(start));    
60.                         }    
61.                         allot.put(entry.getKey(),allotTask);    
62.                     }   
63.                 }  
64.             }  
65.         return allot;  
66.     }