Commit 367bceba authored by linzhiguo's avatar linzhiguo

+ 优化干扰题

parent e089d14b
......@@ -164,7 +164,6 @@ cc.Class({
handleData(data){
let arr = {};
arr.time = data.time*2;
let len = data.mouses.length;
if (len == 1)
return data;
......@@ -175,29 +174,27 @@ cc.Class({
arr.audio_url = data.audio_url;
arr.mouses = [];
let words = [];
let words = [], origin = [];
for(let i = 0; i < len; i++){
words[i] = data.mouses[i].word;
origin[i] = words[i];
arr.mouses[i] = {};
arr.mouses[i].word = data.mouses[i].word;
arr.mouses[i].correct = true;
arr.mouses[i].audio_url = data.mouses[i].audio_url;
}
let letter, tmp, j, k;
do{
this.shuffle(words);
}while(this.compareOne(origin, words));
let letter, tmp, j;
for(let i = 0; i < len; i++){
j = i+ len;
arr.mouses[j] = {};
letter = data.mouses[i].word;
do {
k = RandomInt(len, i);
}while(letter == words[k])
tmp = words[k];
words[k] = words[i];
words[i] = tmp;
tmp = words[i];
arr.mouses[j].word = tmp;
arr.mouses[j].correct = letter == tmp.toUpperCase() || letter == tmp.toLowerCase();
......@@ -570,4 +567,13 @@ cc.Class({
return arr;
},
compareOne(a, b){
let len = a.length;
for(let i = 0; i < len; i++){
if (a[i] == b[i])
return true;
}
return false;
},
});
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment