zoukankan      html  css  js  c++  java
  • 对象排序

    /** OK
    * @param paraMap store_ids: "20,30"
    * class_ids: "75,80"
    * @return List<LessonPiont> sort by point
    */
    public List<LessonPiont> getLessonPointList(HashMap<String,String> paraMap){
    CourseUtil util = new CourseUtil();
    List<Map<String,Object>> list = util.getCourseByMyOderCT(paraMap); //get data from index
    ArrayList<LessonPiont> pointList = new ArrayList<LessonPiont>();
    for (Map<String,Object> map:list) {
    for (String key : map.keySet()) {
    LessonPiont lessonPoint = new LessonPiont();
    lessonPoint.parseKey(key);
    HashMap<String,Object> valueMap = (HashMap<String,Object>)map.get(key);
    int point =Integer.parseInt(valueMap.get("sign_name").toString());
    lessonPoint.setPoint(point);
    pointList.add(lessonPoint);
    }
    }

    Collections.sort(pointList, new Comparator<LessonPiont>(){
    @Override
    public int compare(LessonPiont less1, LessonPiont less2) {
    if(less1.getPoint()>less2.getPoint()){
    return -1;
    }else{
    return 1;
    }
    }
    });
    return pointList;
    }
  • 相关阅读:
    超级迷宫我的计划表
    不敢死队
    Let the Balloon Rise
    Hangover
    汉诺塔系列2
    Tri Tiling(递推)
    Tiling(递推,高精度)
    Color Me Less
    I Think I Need a Houseboat(圆计算)
    Kbased Numbers(递推)
  • 原文地址:https://www.cnblogs.com/ctaixw/p/6115271.html
Copyright © 2011-2022 走看看