String extractSummary(String description,String[] key words)
目标是找出此产品描述中包含N个关键字(每个关键词至少出现一次)的长度最短的子串,作为产品简介输出。
import java.util.HashMap;
import java.util.Map;
public class ShortSummary {
static int count[];
static Map<String,Integer> map = new HashMap<String,Integer>();
static String[] text;
public static void main(String[] args) {
text = "When we are born we are unblemished As we grow we develop many complexities due to many influences in our lives".split(" ");
String[] keywords = {"develop","complexities"};
extractSummary(text,keywords);
}
public static void extractSummary(String[] description,String[] keywords) {
count = new int[keywords.length];
for(int i=0;i<keywords.length;i++){
map.put(keywords[i], i);
}
int start = 0; int len = description.length; int min=len;
for(int i=0;i<len;i++){
int t=getLocation(i,len-1);
if (t>-1) {
if (min>t) {
min = t;
start=i;
}
}
}
for(int i=start;i<=start+min;i++) {
System.out.print(description[i]+" ");
}
}
public static int getLocation(int from,int to){
int start = from;
while( from <= to&&!isAllGetted()) {
Integer i = map.get(text[from]);
if (i!=null) {
count[i]++;
}
from++;
}
if (isAllGetted())
return from - start - 1;
return -1;
}
public static boolean isAllGetted() {
for(int i=0;i<count.length;i++){
if (count[i]==0) {
return false;
}
}
return true;
}
}