zoukankan      html  css  js  c++  java
  • 马拉松参赛人员显示(瞬逝版)

    service层代码:

    // 马拉松参赛成员列表
    public List<JoinMarathonView> joinMarathonList() {

    List<JoinMarathonView> marathonjoinAllList = joinMarathonDao.getNamesByMarathon();// 包含唯一mberid的集合
    List<Marathon> allCityList = joinMarathonDao.getAllCity();
    List<JoinMarathonView> allAwardList = joinMarathonDao.getAllAward();

    for (JoinMarathonView coreofonelist : marathonjoinAllList) { // 加城市
    StringBuilder citystr = new StringBuilder();
    int count = 0;
    for (Marathon allcityone : allCityList) {
    if (allcityone.getMemberId().equals(coreofonelist.getMemberId())) {
    citystr.append(allcityone.getCity());
    citystr.append(",");
    count++;
    }
    }
    coreofonelist.setCity(citystr.toString());
    coreofonelist.setCount(count);
    } // 一个大循环结束


    for (JoinMarathonView coreofonelist : marathonjoinAllList) { // 加奖项
    StringBuilder str = new StringBuilder();
    for (JoinMarathonView allawardone : allAwardList) {
    if (allawardone.getMemberId().equals(coreofonelist.getMemberId())) {
    String addaward = allawardone.getName() + "x" + allawardone.getCount() + "(" + allawardone.getMemo()+ ")";
    str.append(addaward);
    }
    }
    coreofonelist.setAward(str.toString());
    } // 第二个大循环结束


    return marathonjoinAllList;
    }// 方法结束

    这个代码可能马上要被弃掉,因为需求的改变,还是记录下来,方便以后参考

  • 相关阅读:
    1062 Talent and Virtue (25 分)
    1083 List Grades (25 分)
    1149 Dangerous Goods Packaging (25 分)
    1121 Damn Single (25 分)
    1120 Friend Numbers (20 分)
    1084 Broken Keyboard (20 分)
    1092 To Buy or Not to Buy (20 分)
    数组与链表
    二叉树
    时间复杂度与空间复杂度
  • 原文地址:https://www.cnblogs.com/zz-3m23d-begining/p/6648325.html
Copyright © 2011-2022 走看看