付款页满减送券，计算阶梯问题处理

@@ -869,7 +869,7 @@ Page({
         let result = {};
         let result = {};
         let maxPrice = -Infinity;
         let maxPrice = -Infinity;
         for (let i = 0; i < arr.length; i++) {
         for (let i = 0; i < arr.length; i++) {
-            const price = parseInt(arr[i].price, 10);
+            const price = parseFloat(arr[i].price, 10);
             if (price <= num && price > maxPrice) {
             if (price <= num && price > maxPrice) {
                 maxPrice = price;
                 maxPrice = price;
                 result = arr[i];
                 result = arr[i];