贪心算法每次取最优解
import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.*;
public class GreedyAlgorithm {
public static void main(String[] args) {
HashMap<String,HashSet<String>> broadcasts = new HashMap<String, HashSet<String>>();
HashSet<String> hashSet1 = new HashSet<String>();
hashSet1.add("上海");
hashSet1.add("天津");
hashSet1.add("北京");
HashSet<String> hashSet2 = new HashSet<String>();
hashSet2.add("广州");
hashSet2.add("北京");
hashSet2.add("深圳");
HashSet<String> hashSet3 = new HashSet<String>();
hashSet3.add("成都");
hashSet3.add("上海");
hashSet3.add("杭州");
HashSet<String> hashSet4 = new HashSet<String>();
hashSet4.add("天津");
hashSet4.add("上海");
HashSet<String> hashSet5 = new HashSet<String>();
hashSet5.add("杭州");
hashSet5.add("大连");
//数据放入broadcast
broadcasts.put("K1", hashSet1);
broadcasts.put("K2", hashSet2);
broadcasts.put("K3", hashSet3);
broadcasts.put("K4", hashSet4);
broadcasts.put("K5", hashSet5);
//allAreas 填充
HashSet<String> allAreas = new HashSet<String>();
allAreas.add("上海");
allAreas.add("北京");
allAreas.add("成都");
allAreas.add("杭州");
allAreas.add("天津");
allAreas.add("广州");
allAreas.add("深圳");
allAreas.add("大连");
//已选择的电台
ArrayList<String> selects = new ArrayList<String>();
//tempSet 暂存
HashSet<String> tempSet = new HashSet<String>();
String maxKey = null;
while(allAreas.size() != 0) { // allAreas不为空则继续
//maxKey 循环前置空
maxKey = null;
for(String key : broadcasts.keySet()) {
//tempSet 循环前置空
tempSet.clear();
//key覆盖的区域加到tempSet上
HashSet<String> areas = broadcasts.get(key);
tempSet.addAll(areas);
//tempSet覆盖的区域和allAreas未覆盖的区域的交集加到tempSet上
tempSet.retainAll(allAreas);
// tempSet.size() >broadcasts.get(maxKey).size())贪心算法的核心,每次取最优解
if(tempSet.size() > 0 &&
(maxKey == null || tempSet.size() >broadcasts.get(maxKey).size())){
maxKey = key;
}
}
//maxKey != null有最优解
if(maxKey != null) {
selects.add(maxKey);
//将以覆盖的从broadcasts上去除
allAreas.removeAll(broadcasts.get(maxKey));
}
}
System.out.println("覆盖" + selects);//[K1,K2,K3,K5]
}
}