| | |
|---|
| | | copyProperties(two1, twoVO); |
|---|
| | | // 判断第一组题目的问题题目及回答题目，哪个是答案 |
|---|
| | | if (Constants.ZERO.equals(one.getIsAnswer())) { |
|---|
| | | oneVO.setIsQuestion(0); |
|---|
| | | twoVO.setIsQuestion(1); |
|---|
| | | } else { |
|---|
| | | oneVO.setIsQuestion(1); |
|---|
| | | twoVO.setIsQuestion(0); |
|---|
| | | } else { |
|---|
| | | oneVO.setIsQuestion(0); |
|---|
| | | twoVO.setIsQuestion(1); |
|---|
| | | } |
|---|
| | | voList.add(oneVO); |
|---|
| | | voList.add(twoVO); |
|---|
| | |
|---|
| | | return (int) (sum * ((double) accuracy / 100)); |
|---|
| | | } |
|---|
| | | |
|---|
| | | @Override |
|---|
| | | public int residueWeek(TUserStudy studyRecord, List<TStudy> studyList) { |
|---|
| | | // 已学习周目 |
|---|
| | | int residueWeek = 0; |
|---|
| | | // 已学习到的周目 |
|---|
| | | Integer studyWeek = studyRecord.getWeek(); |
|---|
| | | // 根据季度分组封装 |
|---|
| | | Map<Integer, List<TStudy>> studyMap = new HashMap<>(8); |
|---|
| | | for (TStudy study : studyList) { |
|---|
| | | Integer quarter = study.getQuarter(); |
|---|
| | | List<TStudy> itemList = studyMap.get(quarter); |
|---|
| | | if (null == itemList) { |
|---|
| | | itemList = new ArrayList<>(); |
|---|
| | | } |
|---|
| | | itemList.add(study); |
|---|
| | | studyMap.put(quarter, itemList); |
|---|
| | | } |
|---|
| | | // 顺序排序 |
|---|
| | | Map<Integer, List<TStudy>> itemMap = new HashMap<>(8); |
|---|
| | | List<Integer> keyList = new ArrayList<>(); |
|---|
| | | for (Map.Entry<Integer, List<TStudy>> map : studyMap.entrySet()) { |
|---|
| | | Integer key = map.getKey(); |
|---|
| | | keyList.add(key); |
|---|
| | | } |
|---|
| | | Collections.sort(keyList); |
|---|
| | | for (Integer key : keyList) { |
|---|
| | | List<TStudy> itemList = studyMap.get(key); |
|---|
| | | itemMap.put(key, itemList); |
|---|
| | | } |
|---|
| | | // 计算已学习周目 |
|---|
| | | boolean v = false; |
|---|
| | | for (Map.Entry<Integer, List<TStudy>> map : itemMap.entrySet()) { |
|---|
| | | List<TStudy> list = map.getValue(); |
|---|
| | | for (int i = 0; i < list.size(); i++) { |
|---|
| | | TStudy item = list.get(i); |
|---|
| | | if (item.getWeek().equals(studyWeek)) { |
|---|
| | | Integer listen = studyRecord.getListen(); |
|---|
| | | Integer answer = studyRecord.getAnswer(); |
|---|
| | | Integer look = studyRecord.getLook(); |
|---|
| | | Integer induction = studyRecord.getInduction(); |
|---|
| | | Integer pair = studyRecord.getPair(); |
|---|
| | | Integer gameDifficulty = studyRecord.getGameDifficulty(); |
|---|
| | | // 听音选图、看图选音、音图相配、有问有答、归纳排除的进度是否 100%，并且超级听力的游戏难度是否为2 |
|---|
| | | boolean isStudy = Constants.ONE_HUNDRED.equals(listen) && Constants.ONE_HUNDRED.equals(look) && |
|---|
| | | Constants.ONE_HUNDRED.equals(induction) && Constants.ONE_HUNDRED.equals(pair) && |
|---|
| | | Constants.ONE_HUNDRED.equals(answer) && Constants.TWO.equals(gameDifficulty); |
|---|
| | | if (isStudy) { |
|---|
| | | residueWeek++; |
|---|
| | | } |
|---|
| | | v = true; |
|---|
| | | break; |
|---|
| | | } else { |
|---|
| | | residueWeek++; |
|---|
| | | } |
|---|
| | | } |
|---|
| | | if (v) { |
|---|
| | | break; |
|---|
| | | } |
|---|
| | | } |
|---|
| | | return studyList.size() - residueWeek; |
|---|
| | | } |
|---|
| | | |
|---|
| | | } |
|---|
