zyy/quote_price
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

edit

Browse Source
This commit is contained in:
zhuyiyi
2025-05-09 16:16:35 +08:00
parent 7650802c30
commit 66c8b1be0d
2 changed files with 22 additions and 20 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/main/java/lingtao/net/util/PosterPrice.java
+18 -18
View File
@@ -295,9 +295,9 @@ public class PosterPrice {
break;
}
if (!"24".equals(kind2)) {
// if (width * length < 40 * 50) {
// price = new PriceUtils().getTestPrice(length, width, count, number, areas, prices, min_price, last_price);
// } else {
if ("8".equals(kind2) && width * length < 40 * 50) {
price = new PriceUtils().getTestPrice(length, width, count, number, areas, prices, min_price, last_price);
} else {
danjia = last_price;
for (int i = 0; i < areas.length; i++) {
if (area <= areas[i]) {
@@ -306,7 +306,7 @@ public class PosterPrice {
}
}
price = Math.max(area * danjia, min_price);
// }
}
}
Product pro = new Product();
@@ -404,14 +404,14 @@ public class PosterPrice {
// if (width * length < 40 * 50) {
// price = new PriceUtils().getTestPrice(length, width, count, number, areas, prices, min_price, last_price);
// } else {
danjia = last_price;
for (int i = 0; i < areas.length; i++) {
if (area <= areas[i]) {
danjia = prices[i];
break;
}
danjia = last_price;
for (int i = 0; i < areas.length; i++) {
if (area <= areas[i]) {
danjia = prices[i];
break;
}
price = Math.max(area * danjia, min_price);
}
price = Math.max(area * danjia, min_price);
// }
Product pro = new Product();
List<Product> list = new ArrayList<Product>();
@@ -588,14 +588,14 @@ public class PosterPrice {
// if (width * length < 40 * 50) {
// price = new PriceUtils().getTestPrice(length, width, count, number, areas, prices, min_price, last_price);
// } else {
danjia = last_price;
for (int i = 0; i < areas.length; i++) {
if (area <= areas[i]) {
danjia = prices[i];
break;
}
danjia = last_price;
for (int i = 0; i < areas.length; i++) {
if (area <= areas[i]) {
danjia = prices[i];
break;
}
price = Math.max(area * danjia, min_price);
}
price = Math.max(area * danjia, min_price);
// }
}