订单优化
This commit is contained in:
parent
f23133e394
commit
e405207ea8
@ -453,7 +453,16 @@ func (o *OrderMod) CreateExtraOrder(AddChess, AddNewEmit, ChessList []int, Energ
|
||||
//额外订单补充2;当玩家的棋盘中出现三个相同的满级产物时,立刻生成一个对应的收购订单;
|
||||
for k := range MaxLvChess {
|
||||
ChessNum := GoUtil.GetElemNum(ChessList, k)
|
||||
if ChessNum == 3 {
|
||||
OrderChess := 0
|
||||
for _, order := range o.OrderList {
|
||||
for _, v := range order.MergeId {
|
||||
if v == k {
|
||||
OrderChess++
|
||||
}
|
||||
}
|
||||
}
|
||||
OrderNum := (ChessNum - OrderChess) / 3
|
||||
for i := 0; i < OrderNum; i++ {
|
||||
b1 = true
|
||||
o.addOrder([]int{k, k, k}, DIFF_LOW, Extra_type)
|
||||
}
|
||||
|
||||
Loading…
Reference in New Issue
Block a user