订单优化

This commit is contained in:
hahwu 2025-09-11 14:10:51 +08:00
parent 1344325fcc
commit 5ecdfd81bd

View File

@ -530,12 +530,12 @@ func (o *OrderMod) CreateExtraOrder(AddChess, AddNewEmit, ChessList []int, Energ
MaxLvChess[ChessId]++ MaxLvChess[ChessId]++
} }
} }
b2 := true b3 := false
//额外订单补充2当玩家的棋盘中出现三个相同的满级产物时立刻生成一个对应的收购订单 //额外订单补充2当玩家的棋盘中出现三个相同的满级产物时立刻生成一个对应的收购订单
for k := range MaxLvChess { for k := range MaxLvChess {
ChessNum := GoUtil.GetElemNum(ChessList, k) ChessNum := GoUtil.GetElemNum(ChessList, k)
if ChessNum == 3 && Level >= 12 { if ChessNum == 3 && Level >= 12 {
b2 := true
for _, v := range o.OrderList { for _, v := range o.OrderList {
if GoUtil.SliceEqual(v.MergeId, []int{k, k, k}) { if GoUtil.SliceEqual(v.MergeId, []int{k, k, k}) {
b2 = false b2 = false
@ -543,6 +543,7 @@ func (o *OrderMod) CreateExtraOrder(AddChess, AddNewEmit, ChessList []int, Energ
} }
} }
if b2 { if b2 {
b3 = true
o.addOrder([]int{k, k, k}, DIFF_LOW, Extra_type) o.addOrder([]int{k, k, k}, DIFF_LOW, Extra_type)
} }
} }
@ -559,7 +560,7 @@ func (o *OrderMod) CreateExtraOrder(AddChess, AddNewEmit, ChessList []int, Energ
o.addOrder([]int{ChessId}, DIFF_LOW, Preheat_type) o.addOrder([]int{ChessId}, DIFF_LOW, Preheat_type)
} }
} }
return b1 || b2 return b1 || b3
} }
// 返回订单列表 // 返回订单列表