• 利用map ,找出list里面string类型,长度最小的那个


    package main;
    
    import java.util.ArrayList;
    import java.util.Arrays;
    import java.util.Collection;
    import java.util.Collections;
    import java.util.HashMap;
    import java.util.Iterator;
    import java.util.List;
    import java.util.Map;
    import java.util.Set;
    import java.util.TreeSet;
    
    import javax.print.attribute.HashAttributeSet;
    
    public class 发过的 {
        public static void main(String[] args) {
            ArrayList<String> arrayList  =new ArrayList<>();
            arrayList.add("sdfsdfs");
            arrayList.add("sdwerwerfsdfs");
            arrayList.add("werwr");
            arrayList.add("we");
            arrayList.add("sdfswewdfs");
            arrayList.add("werwewrwerwerwrw");
            arrayList.add("wwerwerwewesfsdrwrew");
            
            getMinValue(arrayList);
            System.out.println("最小Value是:::::::::::::"+ getMinValue(arrayList));
    //        HashMap<Integer,String> hashMap=new  HashMap<Integer,String>();
    //        for (String string : arrayList) {
    //             int len=string.length();
    //            hashMap.put(string.length(), string);
    //        }
    //       
    //        Iterator<Map.Entry<Integer, String>> entries = hashMap.entrySet().iterator(); 
    //        while (entries.hasNext()) { 
    //          Map.Entry<Integer, String> entry = entries.next(); 
    //          System.out.println("Key = " + entry.getKey() + ", Value = " + entry.getValue()); 
    //        }
    //        
    //        Set<Integer> set = hashMap.keySet();
    //         Object[] obj = set.toArray();
    //         Arrays.sort(obj);
    //        System.out.println(obj[0]);
    //    
    //        String  resultValue = "";
    //        //根据key ,找Value
    //        for(Map.Entry<Integer,String> str : hashMap.entrySet()){
    //            if(obj[0].equals(str.getKey())){
    //               resultValue = str.getValue();
    //           }
    //        }
    //        System.out.println("最小Value是:::::::::::::"+resultValue);
            
            
            
            
            
        }
        
        
        private static String getMinValue( ArrayList<String> arrayList) {
            //定义一个map来存截取的数据
            HashMap<Integer,String> hashMap=new  HashMap<Integer,String>();
            for (String string : arrayList) {
                 int len=string.length();
                hashMap.put(string.length(), string);
            }
            //获取所有的key值
            Set<Integer> set = hashMap.keySet();
             Object[] obj = set.toArray();
             //排序
             Arrays.sort(obj);
             //最小的Value值的变量
            String  resultValue = "";
            //根据key ,找Value
            for(Map.Entry<Integer,String> str : hashMap.entrySet()){
                if(obj[0].equals(str.getKey())){
                   resultValue = str.getValue();
               }
            }
         return resultValue ;
        }
        
        
        
    
    }
  • 相关阅读:
    oracle ebs应用产品安全性-交叉验证规则
    ORA-04021 timeout occurred while waiting to lock object
    ORA-04021:timeout occurred while waiting to lock object
    ebs双节点webservice部署问题
    ebs如何将客户化的PL/SQL程序发布到webservice
    adcfgclone.pl appsTier报错Unable to locate 'linkxlC' utility in path
    CS231n 作业1 SVM+softmax+两层神经网络
    ReVision: Automated Classification, Analysisand Redesign of Chart Images
    No.1 Extracting and Retargeting Color Mappings from Bitmap Images of Visualizations
    HankerRank刷题第四天(排序类型)Quicksort In-Place
  • 原文地址:https://www.cnblogs.com/xiaoniuniu886/p/10607231.html
Copyright © 2020-2023  润新知