🐞 fix(gvg): 遗迹选择对手逻辑

This commit is contained in:
luying
2023-02-22 14:28:45 +08:00
parent a3ea2be808
commit 2f73cc010c
2 changed files with 4 additions and 2 deletions

View File

@@ -86,7 +86,7 @@ export function refreshVestigeOppRanks(rank: number) {
let beforeRanks = randomRank(rangeBeforeFrom == -1? rank: rangeBeforeFrom, rangeBeforeTo == -1? rank: rangeBeforeTo, rangeBeforeNum); let beforeRanks = randomRank(rangeBeforeFrom == -1? rank: rangeBeforeFrom, rangeBeforeTo == -1? rank: rangeBeforeTo, rangeBeforeNum);
let afterRanks = randomRank(rangeAfterFrom == -1? rank: rangeAfterFrom, rangeAfterTo == -1? rank: rangeAfterTo, rangeAfterNum); let afterRanks = randomRank(rangeAfterFrom == -1? rank: rangeAfterFrom, rangeAfterTo == -1? rank: rangeAfterTo, rangeAfterNum);
let topRanks = getNumberArr(dicRange.topChallengeFrom + 1, dicRange.topChallengeTo); let topRanks = getNumberArr(dicRange.topChallengeFrom, dicRange.topChallengeTo);
let ranks = [...topRanks, ...beforeRanks, ...afterRanks]; let ranks = [...topRanks, ...beforeRanks, ...afterRanks];
return uniqueArr(ranks.sort((a, b) => a - b)); return uniqueArr(ranks.sort((a, b) => a - b));
} }

View File

@@ -161,7 +161,9 @@ export function uniqueArr<T>(arr: T[]) {
export function getNumberArr(from: number, to: number) { export function getNumberArr(from: number, to: number) {
let arr: number[] = []; let arr: number[] = [];
for(let i = from; i <= to; i++) arr.push(i); for(let i = from; i <= to; i++) {
if(i > 0) arr.push(i);
}
return arr; return arr;
} }