From e5f0f2897811b62332db5ad41ef901dec58a4673 Mon Sep 17 00:00:00 2001 From: lkddi Date: Sun, 12 Apr 2026 18:04:28 +0800 Subject: [PATCH] =?UTF-8?q?=E4=BC=98=E5=8C=96=E6=98=BE=E7=A4=BA=E5=BF=AB?= =?UTF-8?q?=E9=80=9F=E4=B8=8B=E5=8D=95=E9=87=91=E9=A2=9D?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- .../partials/games/baccarat-panel.blade.php | 18 ++++++++++-------- .../partials/games/horse-race-panel.blade.php | 16 ++++++++++------ 2 files changed, 20 insertions(+), 14 deletions(-) diff --git a/resources/views/chat/partials/games/baccarat-panel.blade.php b/resources/views/chat/partials/games/baccarat-panel.blade.php index 22ec6d8..c8ff424 100644 --- a/resources/views/chat/partials/games/baccarat-panel.blade.php +++ b/resources/views/chat/partials/games/baccarat-panel.blade.php @@ -490,15 +490,17 @@ const min = this.minBet || 100; const max = this.maxBet || 50000; - // 默认比例:1x, 5x, 10x, 50x, 100x (基于最小下注) - // 同时确保不超过最大下注 - return [ + // 生成阶梯:最小值, 10倍, 100倍, 500倍, 最大值 + // 并确保每个阶梯都不超过最大值,最后去重排序取前5个 + let steps = [ min, - Math.min(min * 5, max), - Math.min(min * 10, max), - Math.min(min * 50, max), - Math.min(min * 100, max) - ].filter((v, i, a) => a.indexOf(v) === i); // 去重 + min * 10, + min * 100, + min * 500, + max + ].map(v => Math.min(v, max)); + + return [...new Set(steps)].sort((a, b) => a - b).slice(0, 5); }, /** diff --git a/resources/views/chat/partials/games/horse-race-panel.blade.php b/resources/views/chat/partials/games/horse-race-panel.blade.php index e96a6dc..3107f42 100644 --- a/resources/views/chat/partials/games/horse-race-panel.blade.php +++ b/resources/views/chat/partials/games/horse-race-panel.blade.php @@ -434,13 +434,17 @@ get quickBetAmounts() { const min = this.minBet || 100; const max = this.maxBet || 100000; - return [ + + // 生成阶梯:最小值, 10倍, 100倍, 500倍, 最大值 + let steps = [ min, - Math.min(min * 5, max), - Math.min(min * 10, max), - Math.min(min * 50, max), - Math.min(min * 100, max) - ].filter((v, i, a) => a.indexOf(v) === i); + min * 10, + min * 100, + min * 500, + max + ].map(v => Math.min(v, max)); + + return [...new Set(steps)].sort((a, b) => a - b).slice(0, 5); }, /**