一个句子，找出最字符最少的关键词

    //一个句子，找出最字符最少的关键词，eg practice makes perfect
    
    public static void main(String[] args) {
        int minLen=0;
        String str=null;
        String sentence="practice makes perfect";
        String[] strings=sentence.split(" ");
        /*for(int i=0;i<strings.length;++i){
            System.out.println(strings[i]);
        }*/
        minLen=strings[0].length();
        str=strings[0];
        for(int i=1;i<strings.length;++i){
            if(strings[i].length()<minLen){
                minLen=strings[i].length();
                str=strings[i];
            }
        }
        System.out.println("The min keyword is "+str+"
it's length is "+str.length());
    }

}
运行结果
The min keyword is makes
it's length is 5

注，如果空格个数多于一个，eg. practice     makes perfect

运行结果：

The min keyword is
it's length is 0

把第7行改为

String[] strings=sentence.split("\s{1,}");
或者
String[] strings=sentence.split("\s+");

就可以了，参考 http://maoa.cn/?post=406

hashmap：

    public static void main(String[] args) {
        String sentence="practice  makes perfect";
        String[] strings=sentence.split("\s+");
        HashMap<Integer,String> map = new HashMap<Integer,String>();
        for(int i=0;i<strings.length;++i){
            map.put(strings[i].length(), strings[i]);
        }
        Iterator<Entry<Integer,String>> iter=map.entrySet().iterator();
        Entry<Integer,String> entry=iter.next();
        int minLen=entry.getKey();
        String str=entry.getValue();
        while(iter.hasNext()){
            entry=iter.next();
            if(entry.getKey()<minLen){
                minLen=entry.getKey();
                str=entry.getValue();
            }
        }
        System.out.println("The min keyword is "+str+"
it's length is "+str.length());
    }